A structure to decide reachability in Petri nets
From MaRDI portal
Publication:1193891
DOI10.1016/0304-3975(92)90173-DzbMath0769.68104WikidataQ127976180 ScholiaQ127976180MaRDI QIDQ1193891
Publication date: 27 September 1992
Published in: Theoretical Computer Science (Search for Journal in Brave)
68R10: Graph theory (including graph drawing) in computer science
68Q85: Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.)
Related Items
Unnamed Item, Unnamed Item, Unnamed Item, Unnamed Item, Analyzing Reachability for Some Petri Nets With Fast Growing Markings, Reachability in Petri Nets with Inhibitor Arcs, Unnamed Item, Coverability, Termination, and Finiteness in Recursive Petri Nets, Polynomial Time Reachability Analysis in Discrete State Chemical Reaction Networks Obeying Conservation Laws, Unboundedness Problems for Languages of Vector Addition Systems., Multi-Dimensional Long-Run Average Problems for Vector Addition Systems with States, Groups Whose Word Problem is a Petri Net Language, Applying CEGAR to the Petri Net State Equation, Long-Run Average Behavior of Vector Addition Systems with States, Coverability in 2-VASS with one unary counter is in NP, Unboundedness problems for machines with reversal-bounded counters, Coverability and Termination in Recursive Petri Nets, Guiding Craig interpolation with domain-specific abstractions, On selective unboundedness of VASS, The reachability problem for branching vector addition systems requires doubly-exponential space, Verification of membrane systems with delays via Petri nets with delays, Extensional Petri net, Bounded self-stabilizing Petri nets, Towards massively parallel computations in algebraic geometry, Flat Petri nets (invited talk), A lazy query scheme for reachability analysis in Petri nets, On detectability of labeled Petri nets and finite automata, Data flow analysis of asynchronous systems using infinite abstract domains, Directed reachability for infinite-state systems, Reachability analysis of low-order discrete state reaction networks obeying conservation laws, Alternating two-way AC-tree automata, Context-free commutative grammars with integer counters and resets, Coverability Trees for Petri Nets with Unordered Data, Reachability Problems for Continuous Chemical Reaction Networks, Complexity Hierarchies beyond Elementary, Finding a Witness Path for Non-liveness in Free-Choice Nets, ON YEN'S PATH LOGIC FOR PETRI NETS, Vector Addition System Reversible Reachability Problem, Forward analysis for WSTS, part I: completions, On Yen’s Path Logic for Petri Nets, Selective petri net languages
Cites Work
