Reachability in Petri nets with inhibitor arcs

DOI10.1016/J.ENTCS.2008.12.042MaRDI QIDQ4982097zbMATH OpenOpenAlexFDO

Authors Klaus Reinhardt

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

zbMATH Keywords

counter automatainhibitor arcsmonotone transitive closurePetri netsreachability

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) Automata and formal grammars in connection with logical questions (03D05) Formal languages and automata (68Q45) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• Entscheidbarkeit bei Petri Netzen
• Decidability of the Petri net reachability problem
• Reachability in cyclic extended free-choice systems
• On Petri nets with hierarchical special arcs
• Analysis issues in Petri nets with inhibitor arcs

Cites work

• A structure to decide reachability in Petri nets
• An Algorithm for the General Petri Net Reachability Problem
• scientific article; zbMATH DE number 3755880 (Why is no real title available?)
• scientific article; zbMATH DE number 2196614 (Why is no real title available?)
• Languages that Capture Complexity Classes
• Projections of vector addition system reachability sets are semilinear
• Proving termination with multiset orderings
• Rational sets in commutative monoids
• Refining the nonterminal complexity of graph-controlled, programmed, and matrix grammars
• Remarks on blind and partially blind one-way multicounter machines
• Semigroups, Presburger formulas, and languages

Cited in

(34)

• Analysis issues in Petri nets with inhibitor arcs
• Domain and event structure semantics for Petri nets with read and inhibitor arcs
• Theory of reaction automata: a survey
• A lazy query scheme for reachability analysis in Petri nets
• The emptiness problem for valence automata over graph monoids
• Approximating Petri net reachability along context-free traces
• Small universal deterministic Petri nets with inhibitors arcs
• On the coverability problem for pushdown vector addition systems in one dimension
• Minimal Cost Reachability/Coverability in Priced Timed Petri Nets
• MONOTONIC ABSTRACTION: ON EFFICIENT VERIFICATION OF PARAMETERIZED SYSTEMS
• scientific article; zbMATH DE number 762060 (Why is no real title available?)
• Unboundedness problems for languages of vector addition systems
• Affine extensions of integer vector addition systems with states
• Coverability, termination, and finiteness in recursive Petri nets
• Undecidability of performance equivalence of Petri nets
• scientific article; zbMATH DE number 7559493 (Why is no real title available?)
• Reachability for two-counter machines with one test and one reset
• On Petri nets with hierarchical special arcs
• Affine extensions of integer vector addition systems with states
• On functions weakly computable by pushdown Petri nets and related systems
• Small universal non-deterministic Petri nets with inhibitor arcs
• Applications and Theory of Petri Nets 2004
• Coverability in 2-VASS with one unary counter is in NP
• Coverability and Termination in Recursive Petri Nets
• On the reversibility of circular conservative Petri nets
• The complexity of bidirected reachability in valence systems
• Flattability of priority vector addition systems
• The complexity of linear temporal verification for continuous counter systems
• History-deterministic vector addition systems
• Verifying unboundedness via amalgamation
• Language inclusion for boundedly-ambiguous vector addition systems is decidable
• Challenges of the reachability problem in infinite-state systems (invited paper)
• Bridging the gap between plain VASS and branching VASS
• Reduction rules for reset/inhibitor nets

This page was built for publication: Reachability in Petri nets with inhibitor arcs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4982097)