81 search results - page 7 / 17 » On the Computation of Stubborn Sets of Colored Petri Nets |
LPNMR
2001
Springer
14 years 11 days ago
2001
Springer
In this paper bounded model checking of asynchronous concurrent systems is introduced as a promising application area for answer set programming. As the model of asynchronous syst...
ISPA
2004
Springer
14 years 1 months ago
2004
Springer
Abstract. Powerful grid and cluster computers allow efficient distributed simulation. Optimistic simulation techniques have been developed which allow for more parallelism in the l...
CONCUR
1995
Springer
13 years 11 months ago
1995
Springer
Abstract. We exploit a notion of interface for Petri nets in order to design a set of net combinators. For such a calculus of nets, we focus on the behavioural congruences arising ...
AUTOMATICA
2010
13 years 6 months ago
2010
In this paper we present an efficient approach for the fault detection of discrete event systems using Petri nets. We assume that some of the transitions of the net are unobservabl...
FSTTCS
2009
Springer
14 years 2 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...