Sciweavers

183 search results - page 8 / 37
» The Downward-Closure of Petri Net Languages
Sort
View
FUIN
2002
94views more  FUIN 2002»
14 years 9 months ago
A Class of Composable and Preemptible High-level Petri Nets with an Application to Multi-Tasking Systems
This paper presents an extension of an algebra of high-level Petri nets with operations for suspension and abortion. These operations are sound with respect to the semantics of pre...
Hanna Klaudel, Franck Pommereau
AWPN
2008
232views Algorithms» more  AWPN 2008»
14 years 11 months ago
Synthesis of Petri Nets from Infinite Partial Languages with VipTool
Abstract. In this paper we show an implementation of an algorithm to synthesize a place/transition Petri net (p/t-net) from a possibly infinite partial language, which is given by ...
Robin Bergenthum, Sebastian Mauser
79
Voted
ACSD
2009
IEEE
110views Hardware» more  ACSD 2009»
15 years 2 months ago
Variants of the Language Based Synthesis Problem for Petri Nets
The application of synthesis of Petri nets from languages for practical problems has recently attracted increasing attention. However, the classical synthesis problems are often n...
Sebastian Mauser, Robert Lorenz
BPM
2005
Springer
129views Business» more  BPM 2005»
15 years 3 months ago
Transforming BPEL to Petri Nets
We present a Petri net semantics for the Business Process Execution Language for Web Services (BPEL). Our semantics covers the standard behaviour of BPEL as well as the exceptional...
Sebastian Hinz, Karsten Schmidt 0004, Christian St...
87
Voted
IANDC
2008
87views more  IANDC 2008»
14 years 9 months ago
Timed Petri nets and timed automata: On the discriminating power of zeno sequences
Timed Petri nets and timed automata are two standard models for the analysis of real-time systems. In this paper, we prove that they are incomparable for the timed language equival...
Patricia Bouyer, Serge Haddad, Pierre-Alain Reynie...