1014 search results - page 45 / 203 » ''What Is a Petri Net |
TOPNOC
2008
13 years 7 months ago
2008
Abstract. In a seminal paper, McMillan proposed a technique for constructing a finite complete prefix of the unfolding of bounded (i.e., finitestate) Petri nets, which can be used ...
CONCUR
1999
Springer
13 years 12 months ago
1999
Springer
Abstract. The unfolding method, initially introduced for systems modelled by Petri nets, is applied to synchronous products of transition systems, a model introduced by Arnold [2]....
CAISE
2003
Springer
13 years 11 months ago
2003
Springer
This paper presents an approach for the improvement of the efficiency of the performance analysis of large workflow models. We propose a simple and powerful decidable Petri net red...
BIRTHDAY
2008
Springer
13 years 9 months ago
2008
Springer
The Scholten/Dijkstra "Pebble Game" is re-examined. We show that the algorithm lends itself to a distributed as well as an online version, and even to a reversed variant....
EMISA
2002
Springer
13 years 7 months ago
2002
Springer
DAWN is technique for modelling and verifying network algorithms, which is based on Petri nets and temporal logic. In this paper, we present a different perspective of DAWN that al...