58 search results - page 5 / 12 » A Class of Petri Nets with a Convex Reachability Set |
103
click to vote
APN
2000
Springer
15 years 1 months ago
2000
Springer
Many techniques for the verification of reactive systems rely on the analysis of their reachable state spaces. In this paper, a new algorithm for the symbolic generation of the sta...
147
click to vote
MMM
2005
Springer
15 years 3 months ago
2005
Springer
A composite multimedia object (cmo) is comprised of different media components such as text, video, audio and image, with a variety of constraints that must be adhered to. The con...
ASP
2001
Springer
15 years 2 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...
FUIN
2010
14 years 7 months ago
2010
In this paper we study decidability of several extensions of P/T nets with name creation and/or replication. In particular, we study how to restrict the models of RN systems (P/T n...
CONCUR
2000
Springer
15 years 1 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...