pith. sign in

Understanding Petri Nets – Modeling Techniques, Analysis Methods, Case Studies

Reisig W · 2013 · DOI 10.1007/978-3-642-33278-4

3 Pith papers cite this work. Polarity classification is still indexing.

3 Pith papers citing it
open at publisher browse 3 citing papers

fields

cs.LO 2 cs.FL 1

years

2025 1 2023 1 2022 1

verdicts

UNVERDICTED 3

representative citing papers

Structural Liveness of Conservative Petri Nets

cs.LO · 2025-03-14 · unverdicted · novelty 7.0

Structural liveness of conservative Petri nets is EXPSPACE-complete because minimal live markings are at most doubly exponential in net size.

Taking Complete Finite Prefixes To High Level, Symbolically

cs.LO · 2023-11-19 · unverdicted · novelty 6.0

Extends complete finite prefixes to symbolic unfoldings of high-level Petri nets by generalizing Esparza et al.'s algorithm for safe nets, with prototype evaluation on four new benchmark families and an extension to certain infinite-marking nets.

citing papers explorer

Showing 3 of 3 citing papers.

  • Structural Liveness of Conservative Petri Nets cs.LO · 2025-03-14 · unverdicted · none · ref 28

    Structural liveness of conservative Petri nets is EXPSPACE-complete because minimal live markings are at most doubly exponential in net size.

  • Taking Complete Finite Prefixes To High Level, Symbolically cs.LO · 2023-11-19 · unverdicted · none · ref 3

    Extends complete finite prefixes to symbolic unfoldings of high-level Petri nets by generalizing Esparza et al.'s algorithm for safe nets, with prototype evaluation on four new benchmark families and an extension to certain infinite-marking nets.

  • Correctness Notions for Petri Nets with Identifiers cs.FL · 2022-12-14 · unverdicted · none · ref 1

    Extends Petri nets with identifiers for object- and resource-aware systems and defines generalized correctness criteria with decidability analysis.