Alternating two-way AC-tree automata
Information and Computation
The Reachability Problem for Object Nets
Fundamenta Informaticae - Special Issue on Concurrency Specification and Programming (CS&P)
Verifying Dynamic Pointer-Manipulating Threads
FM '08 Proceedings of the 15th international symposium on Formal Methods
Labeled Step Sequences in Petri Nets
PETRI NETS '08 Proceedings of the 29th international conference on Applications and Theory of Petri Nets
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)
On Yen's Path Logic for Petri Nets
RP '09 Proceedings of the 3rd International Workshop on Reachability Problems
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
Vector addition system reachability problem: a short self-contained proof
Proceedings of the 38th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
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
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
Algorithmic verification of asynchronous programs
ACM Transactions on Programming Languages and Systems (TOPLAS)
The Reachability Problem for Object Nets
Fundamenta Informaticae - Special Issue on Concurrency Specification and Programming (CS&P)
On selective unboundedness of VASS
Journal of Computer and System Sciences
Presburger Vector Addition Systems
LICS '13 Proceedings of the 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science
| Hi-index | 5.23 |