The Complexity of the Finite Containment Problem for Petri Nets

Verifying lossy channel systems has nonprimitive recursive complexity

Information Processing Letters

A Practical Approach to Verification of Mobile Systems Using Net Unfoldings

Fundamenta Informaticae - Petri Nets 2008

Towards Modelling Information Security with Key-Challenge Petri Nets

NordSec '09 Proceedings of the 14th Nordic Conference on Secure IT Systems: Identity and Privacy in the Internet Age

Vector addition system reachability problem: a short self-contained proof

Proceedings of the 38th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages

Error-correcting Petri nets

Natural Computing: an international journal

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

Algorithmic verification of asynchronous programs

ACM Transactions on Programming Languages and Systems (TOPLAS)

A Practical Approach to Verification of Mobile Systems Using Net Unfoldings

Fundamenta Informaticae - Petri Nets 2008

The theory of WSTS: the case of complete WSTS

PETRI NETS'12 Proceedings of the 33rd international conference on Application and Theory of Petri Nets

The power of well-structured systems

CONCUR'13 Proceedings of the 24th international conference on Concurrency Theory

A relational trace logic for vector addition systems with application to context-freeness

CONCUR'13 Proceedings of the 24th international conference on Concurrency Theory

A theory of name boundedness

CONCUR'13 Proceedings of the 24th international conference on Concurrency Theory

Presburger Vector Addition Systems

LICS '13 Proceedings of the 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science

On the Context-Freeness Problem for Vector Addition Systems

LICS '13 Proceedings of the 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science