Sciweavers

498 search results - page 8 / 100
» On the Category of Petri Net Computations
Sort
View
SOFSEM
2009
Springer
14 years 29 days ago
Partial Order Semantics of Types of Nets
In this paper we define partial order semantics of types of nets. Types of nets are a parametric definition of Petri nets originally developed for a general presentation of the s...
Robert Lorenz, Gabriel Juhás, Sebastian Mau...
TACAS
1997
Springer
197views Algorithms» more  TACAS 1997»
14 years 17 days ago
Design/CPN - A Computer Tool for Coloured Petri Nets
In this paper, we describe the computer tool Design CPN supporting editing, simulation, and state space analysis of Coloured Petri Nets. So far, approximately 40 man-years have bee...
Søren Christensen, Jens Bæk Jø...
LICS
2012
IEEE
11 years 10 months ago
The Ordinal-Recursive Complexity of Timed-arc Petri Nets, Data Nets, and Other Enriched Nets
—We show how to reliably compute fast-growing functions with timed-arc Petri nets and data nets. This construction provides ordinal-recursive lower bounds on the complexity of th...
Serge Haddad, Sylvain Schmitz, Philippe Schnoebele...
CONCUR
1999
Springer
14 years 21 days ago
On the Semantics of Place/Transition Nets
We present several interpretations of the behavior of P/T nets in terms of traces, event structures, and partial orders. Starting from results of Hoogers, Kleijn and Thiagarajan, w...
Rémi Morin, Brigitte Rozoy
APN
2006
Springer
14 years 5 days ago
On the Construction of Pullbacks for Safe Petri Nets
The product of safe Petri nets is a well known operation : it generalizes to concurrent systems the usual synchronous product of automata. In this paper, we consider a more general...
Eric Fabre