Sciweavers

17 search results - page 1 / 4
» How Expressive Are Petri Net Schemata
Sort
View
APN
2006
Springer
13 years 6 months ago
How Expressive Are Petri Net Schemata?
Petri net schemata are an intuitive and expressive approach to describe high-level Petri nets. A Petri net schema is a Petri net with edges and transitions inscribed by terms and B...
Andreas Glausch, Wolfgang Reisig
FSTTCS
2008
Springer
13 years 6 months ago
The unfolding of general Petri nets
The unfolding of (1-)safe Petri nets to occurrence nets is well understood. There is a universal characterization of the unfolding of a safe net which is part and parcel of a core...
Jonathan Hayman, Glynn Winskel
CONCUR
2009
Springer
13 years 11 months ago
Encoding Asynchronous Interactions Using Open Petri Nets
Abstract. We present an encoding for (bound) processes of the asynchronous CCS with replication into open Petri nets: ordinary Petri nets equipped with a distinguished set of open ...
Paolo Baldan, Filippo Bonchi, Fabio Gadducci
FUIN
2007
108views more  FUIN 2007»
13 years 4 months ago
An Axiomatization of the Token Game Based on Petri Algebras
The firing rule of Petri nets relies on a residuation operation for the commutative monoid of natural numbers. We identify a class of residuated commutative monoids, called Petri ...
Eric Badouel, Jules Chenou, Goulven Guillou
FUIN
2010
172views more  FUIN 2010»
13 years 2 months ago
Bounded Parametric Verification for Distributed Time Petri Nets with Discrete-Time Semantics
Bounded Model Checking (BMC) is an efficient technique applicable to verification of temporal properties of (timed) distributed systems. In this paper we show for the first time ho...
Michal Knapik, Wojciech Penczek, Maciej Szreter, A...