1099 search results - page 72 / 220 » Petri net ontology |
CORR
2010
Springer
14 years 12 months ago
2010
Springer
We prove several decidability and undecidability results for -PN, an extension of P/T nets with pure name creation and name management. We give a simple proof of undecidability of...
WSFM
2007
Springer
15 years 6 months ago
2007
Springer
We present and compare existing formalisms that consider the control of Petri net process models in the area of business processes and web services. Control has the aim to force a ...
ACSD
2006
IEEE
15 years 6 months ago
2006
IEEE
A schedule of a Petri Net (PN) represents a set of firing sequences that can be infinitely repeated within a bounded state space, regardless of the outcomes of the nondeterminis...
APN
2005
Springer
15 years 5 months ago
2005
Springer
This paper presents the high level Petri nets analyzer Helena. Helena can be used for the on-the-fly verification of state properties, i.e., properties that must hold in all the ...
123
click to vote
ACSD
2008
IEEE
15 years 1 months ago
2008
IEEE
In this paper we present an algorithm to synthesize a finite unlabeled place/transition Petri net (p/t-net) from a possibly infinite partial language, which is given by a term ove...