Sciweavers

1369 search results - page 56 / 274
» On the Semantics of Petri Nets
Sort
View
BIRTHDAY
2005
Springer
14 years 2 months ago
Simulating Algebraic High-Level Nets by Parallel Attributed Graph Transformation
The “classical” approach to represent Petri nets by graph transformation systems is to translate each transition of a specific Petri net to a graph rule (behavior rule). This ...
Claudia Ermel, Gabriele Taentzer, Roswitha Bardohl
COORDINATION
2006
Springer
14 years 22 days ago
Formalising Business Process Execution with Bigraphs and Reactive XML
Bigraphical Reactive Systems have been proposed as a meta model for global ubiquitous computing generalising process calculi for mobility such as the pi-calculus and the Mobile Amb...
Thomas T. Hildebrandt, Henning Niss, Martin Olsen
AUTOMATICA
2005
93views more  AUTOMATICA 2005»
13 years 9 months ago
Steady-state performance evaluation of continuous mono-T-semiflow Petri nets
The number of states in discrete event systems can increase exponentially with respect to the size of the system. A way to face this state explosion problem consists of relaxing t...
Jorge Júlvez, Laura Recalde, Manuel Silva
AC
2003
Springer
14 years 2 months ago
Unbounded Petri Net Synthesis
We address the problem of deciding uniformly for graphs or languages of a given class whether they are generated by unlabelled Place-Transition nets whose sets of reachable marking...
Philippe Darondeau
QEST
2009
IEEE
14 years 3 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