Journal of the ACM (JACM)
Proving termination with multiset orderings
Communications of the ACM
Decidability of Reachability in Persistent Vector Replacement Systems
MFCS '80 Proceedings of the 9th Symposium on Mathematical Foundations of Computer Science
The decidability of the reachability problem for vector addition systems (Preliminary Version)
STOC '77 Proceedings of the ninth annual ACM symposium on Theory of computing
A partial solution to the reachability-problem for vector-addition systems
STOC '74 Proceedings of the sixth annual ACM symposium on Theory of computing
DECIDABILITY QUESTIONS FOR PETRI NETS
DECIDABILITY QUESTIONS FOR PETRI NETS
THE COMPLEXITY OF THE FIN ITE CONTAINMENT PROBLEM FOR PETRI NETS
THE COMPLEXITY OF THE FIN ITE CONTAINMENT PROBLEM FOR PETRI NETS
Reasoning about systems with many processes
Journal of the ACM (JACM)
Reformulation and Approximation in Model Checking
SARA '02 Proceedings of the 4th International Symposium on Abstraction, Reformulation, and Approximation
Properties of Distributed Timed-Arc Petri Nets
FST TCS '01 Proceedings of the 21st Conference on Foundations of Software Technology and Theoretical Computer Science
Testing Undecidability of the Reachability in Petri Nets with the Help of 10th Hilbert Problem
Proceedings of the 20th International Conference on Application and Theory of Petri Nets
Theoretical Aspects of Recursive Petri Nets
Proceedings of the 20th International Conference on Application and Theory of Petri Nets
Towards a Notion of Distributed Time for Petri Nets
ICATPN '01 Proceedings of the 22nd International Conference on Application and Theory of Petri Nets
Behavioural subtyping and property preservation for active objects
FMOODS '02 Proceedings of the IFIP TC6/WG6.1 Fifth International Conference on Formal Methods for Open Object-Based Distributed Systems V
Decidability of reachability in vector addition systems (Preliminary Version)
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
Cycles and communicating classes in membrane systems and molecular dynamics
Theoretical Computer Science
Labeled Step Sequences in Petri Nets
PETRI NETS '08 Proceedings of the 29th international conference on Applications and Theory of Petri Nets
Concurrency, Synchronization, and Conflicts in Petri Nets
CIAA '08 Proceedings of the 13th international conference on Implementation and Applications of Automata
Comparing the Expressiveness of Timed Automata and Timed Extensions of Petri Nets
FORMATS '08 Proceedings of the 6th international conference on Formal Modeling and Analysis of Timed Systems
Information and Computation
Analyzing Reachability for Some Petri Nets With Fast Growing Markings
Electronic Notes in Theoretical Computer Science (ENTCS)
On Trace-Expressible Behaviour of Petri Nets
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)
Reachability is decidable for weakly extended process rewrite systems
Information and Computation
Levels of Persistency in Place/Transition Nets
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)
Reachability in Succinct and Parametric One-Counter Automata
CONCUR 2009 Proceedings of the 20th International Conference on Concurrency Theory
On Yen's Path Logic for Petri Nets
RP '09 Proceedings of the 3rd International Workshop on Reachability Problems
ICATPN'03 Proceedings of the 24th international conference on Applications and theory of Petri nets
Verifying generalized soundness of workflow nets
PSI'06 Proceedings of the 6th international Andrei Ershov memorial conference on Perspectives of systems informatics
On the computational complexity of dominance links in grammatical formalisms
ACL '10 Proceedings of the 48th Annual Meeting of the Association for Computational Linguistics
The downward-closure of petri net languages
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming: Part II
Vector addition system reachability problem: a short self-contained proof
Proceedings of the 38th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Verification of timed-arc Petri nets
SOFSEM'11 Proceedings of the 37th international conference on Current trends in theory and practice of computer science
Vector addition system reachability problem: a short self contained proof
LATA'11 Proceedings of the 5th international conference on Language and automata theory and applications
Model checking coverability graphs of vector addition systems
MFCS'11 Proceedings of the 36th international conference on Mathematical foundations of computer science
The reachability problem for vector addition system with one zero-test
MFCS'11 Proceedings of the 36th international conference on Mathematical foundations of computer science
Vector addition system reversible reachability problem
CONCUR'11 Proceedings of the 22nd international conference on Concurrency theory
The decidability of the reachability problem for CCS!
CONCUR'11 Proceedings of the 22nd international conference on Concurrency theory
Decidability of LTL for vector addition systems with one zero-test
RP'11 Proceedings of the 5th international conference on Reachability problems
Petri-Net-Based coordination algorithms for grid transactions
ISPA'04 Proceedings of the Second international conference on Parallel and Distributed Processing and Applications
Algorithmic verification of asynchronous programs
ACM Transactions on Programming Languages and Systems (TOPLAS)
Rewriting models of boolean programs
RTA'06 Proceedings of the 17th international conference on Term Rewriting and Applications
Refinement and asynchronous composition of modal petri nets
Transactions on Petri Nets and Other Models of Concurrency V
Levels of Persistency in Place/Transition Nets
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)
Language Classes Defined by Concurrent Finite Automata
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)
On Trace-Expressible Behaviour of Petri Nets
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
On persistent reachability in Petri nets
Information and Computation
Bounded context-switching and reentrant locking
FOSSACS'13 Proceedings of the 16th international conference on Foundations of Software Science and Computation Structures
Analysis of Recursively Parallel Programs
ACM Transactions on Programming Languages and Systems (TOPLAS)
Results on equivalence, boundedness, liveness, and covering problems of BPP-Petri nets
PETRI NETS'13 Proceedings of the 34th international conference on Application and Theory of Petri Nets and Concurrency
Channel properties of asynchronously composed petri nets
PETRI NETS'13 Proceedings of the 34th international conference on Application and Theory of Petri Nets and Concurrency
A relational trace logic for vector addition systems with application to context-freeness
CONCUR'13 Proceedings of the 24th international conference on Concurrency Theory
Concurrency control generation for dynamic threads using discrete-event systems
Science of Computer Programming
Presburger Vector Addition Systems
LICS '13 Proceedings of the 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science
| Hi-index | 0.00 |
An algorithm is presented for the general Petri net reachability problem based on a generalization of the basic reachability construction which is symmetric with respect to the initial and final marking. Sets of transition sequences described by finite automata are used for approximations to firing sequences, and the approximation error is assessed by uniformly constructable Presburger expressions. The approximation algorithm is iterated until a sufficient criterion for reachability can be given, not-withstanding the remaining uncertainty.