The equality problem for vector addition systems is undecidable (original) (raw)
Related papers
A decidability theorem for a class of vector-addition systems
Information Processing Letters, 1975
Petri Net Reachability Graphs: Decidability Status of First Order Properties
Christophe Morvan, Roland Meyer
Logical Methods in Computer Science, 2012
Reachability analysis for a class of Petri nets
Decidability and complexity of Petri nets with unordered data
Theoretical Computer Science, 2011
Decidability results in First-Order Hybrid Petri Nets
Discrete Event Dynamic Systems, 2001
The context-freeness of the languages associated with vector addition systems is decidable
Theoretical Computer Science, 1992
Model Checking Vector Addition Systems with one zero-test
Logical Methods in Computer Science, 2012
Linear time analysis of properties of conflict-free and general Petri nets
Luigi Laura, Paola Alimonti, Umberto Nanni
Theoretical Computer Science, 2011
Petri Net Reachability Checking Is Polynomial with Optimal Abstraction Hierarchies
Lecture Notes in Computer Science, 2005
Decidability issues for Petri nets
1994
The equivalence of vector addition systems to a subclass of post canonical systems
Information Processing Letters, 1978
Reachability test in Petri nets by Gröbner bases
1995
Reachability in Two-Dimensional Vector Addition Systems with States Is PSPACE-Complete
2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science, 2015
Cyclic Petri Net Reachability Sets are Semi-linear Effectively Constructible
1997
A Reduced Reachability Tree for a Class of Unbounded Petri Nets
The Confluence Property for Petri Nets and its Applications
2006
Petri Nets, Flat Languages and Linear Arithmetic
2013
Decidability results in firstorder hybrid petri nets. Discrete Event Dynamic Systems
2001
Normal and sinkless petri nets
Journal of Computer and System Sciences, 1993
Decidability Problems in Petri Nets with Names and Replication
Fundamenta Informaticae
Some Decidability Results for Nested Petri Nets
Lecture Notes in Computer Science, 2000
Place-boundedness for vector addition systems with one zero-test
FSTTCS, 2010
An algebraic structure of petri nets
Lecture Notes in Computer Science, 1980
A well-structured framework for analysing petri net extensions
Claudine Picaronny, Alain Finkel
Information and Computation, 2004
Analyzing Reachability for Some Petri Nets With Fast Growing Markings
Electronic Notes in Theoretical Computer Science, 2008
Decidability Results for Restricted Models of Petri Nets with Name Creation and Replication
Lecture Notes in Computer Science, 2009
A description of the non-sequential execution of Petri nets in partially commutative linear logic
Logic Colloquium, 2004
Improving reachability analysis for partially symmetric high level Petri nets
ω-Petri Nets: Algorithms and Complexity
Fundamenta Informaticae
Petri nets with generalized algebra: a comparison
Electronic Notes in Theoretical Computer Science, 1999