8 search results - page 1 / 2 » Covering Places and Transitions in Open Nets |
BPM
2008
Springer
13 years 6 months ago
2008
Springer
We present a finite representation of all services M where the composition with a given service N is deadlock-free, and a given set of activities of N can be covered (i.e. is not d...
CORR
2011
Springer
12 years 8 months ago
2011
Springer
—We consider timed Petri nets, i.e., unbounded Petri nets where each token carries a real-valued clock. Transition arcs are labeled with time intervals, which specify constraints...
JUCS
2007
13 years 4 months ago
2007
: This paper describes a method of using Petri net P-invariants in system diagnosis. To model this process a net oriented fault classification is presented. Hence, the considered d...
FOSSACS
2009
Springer
13 years 11 months ago
2009
Springer
Abstract. We extend discrete-timed Petri nets with a cost model that assigns token storage costs to places and firing costs to transitions, and study the minimal cost reachability...
CONCUR
2001
Springer
13 years 9 months ago
2001
Springer
In order to model the behaviour of open concurrent systems by means of Petri nets, we introduce open Petri nets, a generalization of the ordinary model where some places, designate...