Sciweavers

1014 search results - page 45 / 203
» ''What Is a Petri Net
Sort
View
TOPNOC
2008
15 years 20 days ago
McMillan's Complete Prefix for Contextual Nets
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 ...
Paolo Baldan, Andrea Corradini, Barbara König...
CONCUR
1999
Springer
15 years 5 months ago
An Unfolding Algorithm for Synchronous Products of Transition Systems
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]....
Javier Esparza, Stefan Römer
115
Voted
CAISE
2003
Springer
15 years 4 months ago
Improving the Efficiency of Workflow Analysis
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...
Loucif Zerguini
97
Voted
BIRTHDAY
2008
Springer
15 years 2 months ago
The Scholten/Dijkstra Pebble Game Played Straightly, Distributedly, Online and Reversed
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....
Wolfgang Reisig
90
Voted
EMISA
2002
Springer
15 years 18 days ago
DAWN for component based systems - just a different perspective
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...
Ekkart Kindler