189 search results - page 28 / 38 » The unfolding of general Petri nets |
145
click to vote
APN
2005
Springer
15 years 11 months ago
2005
Springer
STGs give a formalism for the description of asynchronous circuits based on Petri nets. To overcome the state explosion problem one may encounter during circuit synthesis, a nondet...
159
click to vote
ACSD
2005
IEEE
15 years 11 months ago
2005
IEEE
Signal Transition Graphs (STGs) are a version of Petri nets for the specification of asynchronous circuit behaviour. It has been suggested to decompose such a specification as a...
154
click to vote
FOSSACS
2005
Springer
15 years 11 months ago
2005
Springer
We study the concept of choice for true concurrency models such as prime event structures and safe Petri nets. We propose a dynamic variation of the notion of cluster previously in...
163
click to vote
WOSP
2004
ACM
15 years 11 months ago
2004
ACM
Modelling and analysing distributed and mobile software systems is a challenging task. PEPA nets—coloured stochastic Petri nets—are a recently introduced modelling formalism w...
145
click to vote
HCW
1999
IEEE
15 years 10 months ago
1999
IEEE
This paper describes a simulation tool for the analysis of complex jobs described in the form of task graphs. The simulation procedure relies on the PN-based topological represent...