Reachability in Petri Nets with Inhibitor Arcs
From MaRDI portal
Publication:4982097
DOI10.1016/j.entcs.2008.12.042zbMath1337.68191OpenAlexW2090401819MaRDI QIDQ4982097
Publication date: 23 March 2015
Published in: Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.entcs.2008.12.042
Formal languages and automata (68Q45) Automata and formal grammars in connection with logical questions (03D05) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Decidability of theories and sets of sentences (03B25)
Related Items
On the Coverability Problem for Pushdown Vector Addition Systems in One Dimension, Reduction rules for reset/inhibitor nets, Unnamed Item, The emptiness problem for valence automata over graph monoids, Coverability in 2-VASS with one unary counter is in NP, Coverability and Termination in Recursive Petri Nets, Unnamed Item, Unboundedness Problems for Languages of Vector Addition Systems., Theory of reaction automata: a survey, Undecidability of performance equivalence of Petri nets, Unnamed Item, Unnamed Item, Minimal Cost Reachability/Coverability in Priced Timed Petri Nets, MONOTONIC ABSTRACTION: ON EFFICIENT VERIFICATION OF PARAMETERIZED SYSTEMS, On Petri Nets with Hierarchical Special Arcs, Unnamed Item, Coverability, Termination, and Finiteness in Recursive Petri Nets, A lazy query scheme for reachability analysis in Petri nets
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A structure to decide reachability in Petri nets
- Remarks on blind and partially blind one-way multicounter machines
- Projections of vector addition system reachability sets are semilinear
- Semigroups, Presburger formulas, and languages
- Rational sets in commutative monoids
- An Algorithm for the General Petri Net Reachability Problem
- Languages that Capture Complexity Classes
- Proving termination with multiset orderings
