Sciweavers

357 search results - page 21 / 72
» On the Model of Computation of Place Transition Petri Nets
Sort
View
APN
2006
Springer
13 years 11 months ago
The Synthesis Problem of Netcharts
A netchart is basically a Petri net whose places are located at some process and whose transitions are labeled by message sequence charts (MSCs). Two recent papers showed independe...
Nicolas Baudru, Rémi Morin
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...
TSE
2002
107views more  TSE 2002»
13 years 7 months ago
Fluid Stochastic Petri Nets Augmented with Flush-Out Arcs: A Transient Analysis Technique
Fluid (or Hybrid) Petri Nets with flush-out arcs are Petri net based models with two classes of places: discrete places that carry a natural number of distinct objects (tokens), a...
Marco Gribaudo, András Horváth
ACSD
2001
IEEE
91views Hardware» more  ACSD 2001»
13 years 11 months ago
Synthesis of Net Systems with Inhibitor Arcs from Step Transition Systems
We here consider transition systems of Elementary Net Systems with Inhibitor Arcs. There are basically two di erent types of non-interleaving semantics of such Petri nets, the a-po...
Marta Pietkiewicz-Koutny
AIME
2009
Springer
13 years 8 months ago
Semantic Web-Based Modeling of Clinical Pathways Using the UML Activity Diagrams and OWL-S
: Clinical Pathways can be viewed as workflows, comprising an ordering of activities with associated execution constraints. Workflow models allow formal representation, analysis an...
Ali Daniyal, Syed Sibte Raza Abidi