An Algorithm for the General Petri Net Reachability Problem
From MaRDI portal
Decidability of theories and sets of sentences (03B25) Automata and formal grammars in connection with logical questions (03D05) Complexity of computation (including implicit computational complexity) (03D15) Word problems, etc. in computability and recursion theory (03D40) Analysis of algorithms and problem complexity (68Q25) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Recommendations
Cited in
(only showing first 100 items - show all)- On decidability of LTL model checking for process rewrite systems
- Distributed semantics for the \(\pi \)-calculus based on Petri nets with inhibitor ARCS
- Normal Petri nets
- Petri nets and large finite sets
- Some complexity bounds for problems concerning finite and 2-dimensional vector addition systems with states
- Finding a partial solution to a linear system of equations in positive integers
- Problems concerning fairness and temporal logic for conflict-free Petri nets
- Reduction and covering of infinite reachability trees
- The complexity of problems involving structurally bounded and conservative Petri nets
- A unified approach for deciding the existence of certain petri net paths
- Concurrent regular expressions and their relationship to Petri nets
- Finite automata on directed graphs
- The context-freeness of the languages associated with vector addition systems is decidable
- Normal and sinkless Petri nets
- Linear logic as a logic of computations
- Petri net algorithms in the theory of matrix grammars
- Deciding a class of path formulas for conflict-free Petri nets
- Undecidable problems in unreliable computations.
- Refining the hierarchy of blind multicounter languages and twist-closed trios.
- A shrinking lemma for random forbidding context languages
- Analysis issues in Petri nets with inhibitor arcs
- On the decision problem for MELL
- When ambients cannot be opened
- Decidability of the Petri net reachability problem
- On the finite containment problem for Petri nets
- Fifo nets without order deadlock
- Projections of vector addition system reachability sets are semilinear
- Process rewrite systems.
- Bounded self-stabilizing Petri nets
- Petri nets, Horn programs, linear logic and vector games
- Linear logic automata
- Petri nets and regular processes
- Flat Petri nets (invited talk)
- A lazy query scheme for reachability analysis in Petri nets
- On detectability of labeled Petri nets and finite automata
- Static analysis and stochastic search for reachability problem
- Strategic reasoning with a bounded number of resources: the quest for tractability
- Petri net representation and reachability analysis of 0--1 integer linear programming problems
- Structural liveness of Petri nets is \textsc{ExpSpace}-hard and decidable
- Reachability analysis of low-order discrete state reaction networks obeying conservation laws
- Characterization and complexity results on jumping finite automata
- Alternating two-way AC-tree automata
- Incremental construction of coverability graphs
- Type-based information flow analysis for the \(\pi\)-calculus
- Context-free commutative grammars with integer counters and resets
- On complexity of reachability of transition restricted Petri nets
- Rewriting in the partial algebra of typed terms modulo AC
- A Note on Decidable Separability by Piecewise Testable Languages
- Deciding Structural Liveness of Petri Nets
- Honesty by typing
- Finding a witness path for non-liveness in free-choice nets
- A note on the reachability set of Petri nets
- Communicating processes, scheduling, and the complexity of nontermination
- TOWARD UNDERSTANDING THE GENERATIVE CAPACITY OF ERASING RULES IN MATRIX GRAMMARS
- On the Relationship between π-Calculus and Finite Place/Transition Petri Nets
- Weak Time Petri Nets Strike Back!
- Deciding fast termination for probabilistic VASS with nondeterminism
- scientific article; zbMATH DE number 3878366 (Why is no real title available?)
- scientific article; zbMATH DE number 3878371 (Why is no real title available?)
- On functions weakly computable by Petri nets and vector addition systems
- Compositional reachability in Petri nets
- On selective unboundedness of VASS
- Minimal Cost Reachability/Coverability in Priced Timed Petri Nets
- Erasing in Petri Net Languages and Matrix Grammars
- scientific article; zbMATH DE number 4092785 (Why is no real title available?)
- scientific article; zbMATH DE number 78000 (Why is no real title available?)
- The reachability problem for branching vector addition systems requires doubly-exponential space
- scientific article; zbMATH DE number 4127001 (Why is no real title available?)
- Petri net models of flexible and automated manufacturing systems: a survey
- scientific article; zbMATH DE number 1341757 (Why is no real title available?)
- scientific article; zbMATH DE number 1341758 (Why is no real title available?)
- Checking system boundedness using ordinary differential equations
- Tableau methods for PA-processes
- Deciding properties of integral relational automata
- Separability of reachability sets of vector addition systems
- scientific article; zbMATH DE number 3992938 (Why is no real title available?)
- scientific article; zbMATH DE number 2112159 (Why is no real title available?)
- SOME COMPLEXITY RESULTS FOR RINGS OF PETRI NETS
- Verification of membrane systems with delays via Petri nets with delays
- Reachability in Petri nets with inhibitor arcs
- Polynomial vector addition systems with states
- Affine extensions of integer vector addition systems with states
- Coverability, termination, and finiteness in recursive Petri nets
- scientific article; zbMATH DE number 7471708 (Why is no real title available?)
- Any ground associative-commutative theory has a finite canonical system
- On polynomial ideals, their complexity, and applications
- The Reachability Problem for Petri Nets Is Not Elementary
- scientific article; zbMATH DE number 7559493 (Why is no real title available?)
- scientific article; zbMATH DE number 7559502 (Why is no real title available?)
- scientific article; zbMATH DE number 7559504 (Why is no real title available?)
- Non axiomatisability of positive relation algebras with constants, via graph homomorphisms
- Decidability of weak fairness in Petri nets
- Handles and reachability analysis of free choice nets
- High undecidability of weak bisimilarity for Petri nets
- scientific article; zbMATH DE number 7204383 (Why is no real title available?)
- On Petri nets with hierarchical special arcs
- Open Petri nets
- Logics for continuous reachability in Petri nets and vector addition systems with states
- When reachability meets Grzegorczyk
- Affine extensions of integer vector addition systems with states
This page was built for publication: An Algorithm for the General Petri Net Reachability Problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3677184)
