357 search results - page 3 / 72 » On the Model of Computation of Place Transition Petri Nets |
ACIIDS
2010
IEEE
13 years 8 months ago
2010
IEEE
Abstract. A genetic algorithm is used to learn a non-deterministic Petri netbased model of non-linear gene interactions, or statistical epistasis. Petri nets are computational mode...
APN
2010
Springer
13 years 10 months ago
2010
Springer
The unfolding technique is an efficient tool to explore the runs of a Petri net in a true concurrency semantics, i.e. without constructing all the interleavings of concurrent actio...
BPM
2008
Springer
13 years 7 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...
IEAAIE
1998
Springer
13 years 10 months ago
1998
Springer
In this paper a novel method of reference places' detection to build topological models is described, as well as an algorithm for route planning based on Fuzzy Petri Nets. The...
CONCUR
2001
Springer
13 years 10 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...