CONCUR
2000
Springer
13 years 10 months ago
2000
Springer
Unfoldings are a technique for verification of concurrent and distributed systems introduced by McMillan. The method constructs a finite complete prefix, which can be seen as a sym...
FSTTCS
1993
Springer
13 years 11 months ago
1993
Springer
We study the complexity of several standard problems for 1-safe Petri nets and some of its subclasses. We prove that reachability, liveness, and deadlock are all PSPACE-complete f...
ASP
2001
Springer
13 years 11 months ago
2001
Springer
In this paper bounded model checking of asynchronous concurrent systems is introduced as a promising application area for answer set programming. This is an extension of earlier w...
FSTTCS
2009
Springer
14 years 1 months ago
2009
Springer
ABSTRACT. We consider concurrent systems that can be modelled as 1-safe Petri nets communicating through a fixed set of buffers (modelled as unbounded places). We identify a param...