Sciweavers

66 search results - page 3 / 14
» Diagnosability of bounded Petri nets
Sort
View
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...
BPM
2008
Springer
136views Business» more  BPM 2008»
13 years 9 months ago
A Region-Based Algorithm for Discovering Petri Nets from Event Logs
The paper presents a new method for the synthesis of Petri nets from event logs in the area of Process Mining. The method derives a bounded Petri net that over-approximates the beh...
Josep Carmona, Jordi Cortadella, Michael Kishinevs...
PNPM
1987
13 years 11 months ago
Toward a Definition of Modeling Power for Stochastic Petri Net Models
Some insight on the meaning of "modeling power" for Stochastic Petri Net models is given. Extensions characterizing a Stochastic Petri Net are categorized as logical or ...
Gianfranco Ciardo
QEST
2009
IEEE
14 years 2 months ago
Integrating TPNs and Performance Bound Techniques in ITPN-PerfBound: A New Import Functionality
Abstract—ITPN-PerfBound is a graphical tool for the modeling and performance bound analysis of Interval Time Petri Nets (ITPN), that has been developed within the DrawNET modelin...
Elina Pacini Naumovich, Simona Bernardi
FUIN
2007
108views more  FUIN 2007»
13 years 7 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