An algorithm for the general Petri net reachability problem
STOC '81 Proceedings of the thirteenth annual ACM symposium on Theory of computing
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
The Mathematical Theory of Context-Free Languages
The Mathematical Theory of Context-Free Languages
Modeling and Analysis of the Behavior of Information Systems
IEEE Transactions on Software Engineering
ACM SIGACT News
Reasoning about systems with many processes
Journal of the ACM (JACM)
Modeling and Analysis of Workflows Using Petri Nets
Journal of Intelligent Information Systems - Special issue on workflow management systems
Analysis issues in Petri nets with inhibitor arcs
Theoretical Computer Science
A Survey of Petri Net Methods for Controlled Discrete EventSystems
Discrete Event Dynamic Systems
An Algorithm Constructing the Semilinear Post* for 2-Dim Reset/Transfer VASS
MFCS '00 Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science
Reformulation and Approximation in Model Checking
SARA '02 Proceedings of the 4th International Symposium on Abstraction, Reformulation, and Approximation
Rewrite Closure for Ground and Cancellative AC Theories
FST TCS '01 Proceedings of the 21st Conference on Foundations of Software Technology and Theoretical Computer Science
Safe Datalog Queries with Linear Constraints
CP '98 Proceedings of the 4th International Conference on Principles and Practice of Constraint Programming
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
Computing communication cost by Petri nets for hardware/software codesign
RSP '97 Proceedings of the 8th International Workshop on Rapid System Prototyping (RSP '97) Shortening the Path from Specification to Prototype
Refining the hierarchy of blind multicounter languages and twist-closed trios
Information and Computation
A Sufficient Condition for Reachability in a General Petri Net
Discrete Event Dynamic Systems
Timed Automata with Data Structures for Distributed Systems Design and Analysis
SEFM '05 Proceedings of the Third IEEE International Conference on Software Engineering and Formal Methods
Alternating two-way AC-tree automata
Information and Computation
On Communicating Automata with Bounded Channels
Fundamenta Informaticae - Half a Century of Inspirational Research: Honoring the Scientific Influence of Antoni Mazurkiewicz
Labeled Step Sequences in Petri Nets
PETRI NETS '08 Proceedings of the 29th international conference on Applications and Theory of Petri Nets
Reversal-Bounded Counter Machines Revisited
MFCS '08 Proceedings of the 33rd international symposium on Mathematical Foundations of Computer Science
Information and Computation
Analyzing Reachability for Some Petri Nets With Fast Growing Markings
Electronic Notes in Theoretical Computer Science (ENTCS)
Reachability in Petri Nets with Inhibitor Arcs
Electronic Notes in Theoretical Computer Science (ENTCS)
LTL with the freeze quantifier and register automata
ACM Transactions on Computational Logic (TOCL)
On Trace-Expressible Behaviour of Petri Nets
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)
Reachability in Timed Counter Systems
Electronic Notes in Theoretical Computer Science (ENTCS)
Levels of Persistency in Place/Transition Nets
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)
Weak Time Petri Nets Strike Back!
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
The bag automaton: a model of nondeterministic storage
Journal of Automata, Languages and Combinatorics
Mixing Coverability and Reachability to Analyze VASS with One Zero-Test
SOFSEM '10 Proceedings of the 36th Conference on Current Trends in Theory and Practice of Computer Science
Expressiveness of Petri Nets with Stopwatches. Dense-time Part
Fundamenta Informaticae
Petri nets with simple circuits
COCOON'03 Proceedings of the 9th annual international conference on Computing and combinatorics
ICATPN'03 Proceedings of the 24th international conference on Applications and theory of Petri nets
Bag automata and stochastic retrieval of biomolecules in solution
CIAA'03 Proceedings of the 8th international conference on Implementation and application of automata
Reachability in unions of commutative rewriting systems is decidable
STACS'07 Proceedings of the 24th annual conference on Theoretical aspects of computer science
Finding paths with the right cost
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
On the dynamics of PB systems with volatile membranes
WMC'07 Proceedings of the 8th international conference on Membrane computing
The reachability problem for branching vector addition systems requires doubly-exponential space
Information Processing Letters
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
Rewriting systems for reachability in vector addition systems with pairs
RP'10 Proceedings of the 4th international conference on Reachability problems
On the verification of membrane systems with dynamic structure
Natural Computing: an international journal
Vector addition system reachability problem: a short self-contained proof
Proceedings of the 38th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
On the complexity of the Bernays-Schönfinkel class with datalog
LPAR'10 Proceedings of the 17th international conference on Logic for programming, artificial intelligence, and reasoning
Two-variable logic on data words
ACM Transactions on Computational Logic (TOCL)
Applying CEGAR to the petri net state equation
TACAS'11/ETAPS'11 Proceedings of the 17th international conference on Tools and algorithms for the construction and analysis of systems: part of the joint European conferences on theory and practice of software
Finding a witness path for non-liveness in free-choice nets
PETRI NETS'11 Proceedings of the 32nd international conference on Applications and theory of Petri Nets
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
Decidability of LTL for vector addition systems with one zero-test
RP'11 Proceedings of the 5th international conference on Reachability problems
Flat counter automata almost everywhere!
ATVA'05 Proceedings of the Third international conference on Automated Technology for Verification and Analysis
Automata and logics for words and trees over an infinite alphabet
CSL'06 Proceedings of the 20th international conference on Computer Science Logic
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
Reachability analysis of communicating pushdown systems
FOSSACS'10 Proceedings of the 13th international conference on Foundations of Software Science and Computational Structures
Catalytic petri nets are turing complete
LATA'12 Proceedings of the 6th international conference on Language and Automata Theory and Applications
Levels of Persistency in Place/Transition Nets
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)
Expressiveness of Petri Nets with Stopwatches. Dense-time Part
Fundamenta Informaticae
On Trace-Expressible Behaviour of Petri Nets
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)
On Communicating Automata with Bounded Channels
Fundamenta Informaticae - Half a Century of Inspirational Research: Honoring the Scientific Influence of Antoni Mazurkiewicz
Reachability In Some Classes Of Acyclic Petri Nets
Fundamenta Informaticae
Reachability In Some Classes Of Acyclic Petri Nets
Fundamenta Informaticae
Local testing of message sequence charts is difficult
FCT'07 Proceedings of the 16th international conference on Fundamentals of Computation Theory
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)
A relational trace logic for vector addition systems with application to context-freeness
CONCUR'13 Proceedings of the 24th international conference on Concurrency Theory
Proceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages
Presburger Vector Addition Systems
LICS '13 Proceedings of the 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science
Reasoning about Data Repetitions with Counter Systems
LICS '13 Proceedings of the 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science
| Hi-index | 0.00 |
A convincing proof of the decidability of reachability in vector addition systems is presented. No drastically new ideas beyond those in Sacerdote and Tenney, and Mayr are made use of. The complicated tree constructions in the earlier proofs are completely eliminated.