325 search results - page 36 / 65 » Controlling Petri Net Process Models |
CIBCB
2007
IEEE
14 years 3 months ago
2007
IEEE
—Many dynamical processes can be represented as directed attributed graphs or Petri nets where relationships between various entities are explicitly expressed. Signaling networks...
BPM
2008
Springer
13 years 10 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...
APCCM
2007
13 years 10 months ago
2007
A business process may be modeled in different ways by different modelers even when utilizing the same modeling language. An appropriate method for solving ambiguity issues in p...
FSTTCS
2006
Springer
14 years 8 days ago
2006
Springer
We establish a decidability boundary of the model checking problem for infinite-state systems defined by Process Rewrite Systems (PRS) or weakly extended Process Rewrite Systems (w...
MASCOTS
2003
13 years 10 months ago
2003
Abstract. In this paper we describe a formalism which uses the stochastic process algebra PEPA as the inscription language for labelled stochastic Petri nets. Viewed in another way...