A structure to decide reachability in Petri nets

DOI10.1016/0304-3975(92)90173-DzbMath0769.68104WikidataQ127976180 ScholiaQ127976180MaRDI QIDQ1193891

J. L. Lambert

Publication date: 27 September 1992

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

reachabilityPetri netsprecovering graph

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items

Guiding Craig interpolation with domain-specific abstractions, Polynomial Time Reachability Analysis in Discrete State Chemical Reaction Networks Obeying Conservation Laws, Alternating two-way AC-tree automata, Bounded self-stabilizing Petri nets, Context-free commutative grammars with integer counters and resets, On selective unboundedness of VASS, Selective petri net languages, The reachability problem for branching vector addition systems requires doubly-exponential space, 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, On detectability of labeled Petri nets and finite automata, Unnamed Item, Unboundedness Problems for Languages of Vector Addition Systems., Extensional Petri net, Data flow analysis of asynchronous systems using infinite abstract domains, Directed reachability for infinite-state systems, Long-Run Average Behavior of Vector Addition Systems with States, Verification of membrane systems with delays via Petri nets with delays, Finding a Witness Path for Non-liveness in Free-Choice Nets, ON YEN'S PATH LOGIC FOR PETRI NETS, Unnamed Item, Unnamed Item, Towards massively parallel computations in algebraic geometry, Unnamed Item, Applying CEGAR to the Petri Net State Equation, Coverability Trees for Petri Nets with Unordered Data, Forward analysis for WSTS, part I: completions, Reachability Problems for Continuous Chemical Reaction Networks, Vector Addition System Reversible Reachability Problem, Multi-Dimensional Long-Run Average Problems for Vector Addition Systems with States, Complexity Hierarchies beyond Elementary, Analyzing Reachability for Some Petri Nets With Fast Growing Markings, Reachability in Petri Nets with Inhibitor Arcs, On Yen’s Path Logic for Petri Nets, Reachability analysis of low-order discrete state reaction networks obeying conservation laws, Groups Whose Word Problem is a Petri Net Language, Unnamed Item, Coverability, Termination, and Finiteness in Recursive Petri Nets, Flat Petri nets (invited talk), A lazy query scheme for reachability analysis in Petri nets

Cites Work

• Finding a partial solution to a linear system of equations in positive integers
• On the reachability problem for 5-dimensional vector addition systems
• Parallel program schemata
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item