Sciweavers

111 search results - page 7 / 23
» DNA Algorithms for Petri Net Modeling
Sort
View
AUTOMATICA
2005
93views more  AUTOMATICA 2005»
13 years 7 months ago
Steady-state performance evaluation of continuous mono-T-semiflow Petri nets
The number of states in discrete event systems can increase exponentially with respect to the size of the system. A way to face this state explosion problem consists of relaxing t...
Jorge Júlvez, Laura Recalde, Manuel Silva
ENTCS
2002
103views more  ENTCS 2002»
13 years 7 months ago
Translation from timed Petri nets with intervals on transitions to intervals on places (with urgency)
Petri nets where, to my knowledge, the first theoretical model augmented with time constraints [Mer74], and the support of the first reachability algorithm of timed system [BM83, ...
Marc Boyer
26
Voted
FSTTCS
2009
Springer
14 years 2 months ago
Modelchecking counting properties of 1-safe nets with buffers in paraPSPACE
ABSTRACT. We consider concurrent systems that can be modelled as 1-safe Petri nets communicating through a fixed set of buffers (modelled as unbounded places). We identify a param...
M. Praveen, Kamal Lodaya
ASIAN
1998
Springer
111views Algorithms» more  ASIAN 1998»
13 years 12 months ago
A Comparison of Petri Net Semantics under the Collective Token Philosophy
In recent years, several semantics for place/transition Petri nets have been proposed that adopt the collective token philosophy. We investigate distinctions and similarities betwe...
Roberto Bruni, José Meseguer, Ugo Montanari...
APN
2004
Springer
14 years 1 months ago
LTL Model Checking for Modular Petri Nets
We consider the problem of model checking modular Petri nets for the linear time logic LTL-X. An algorithm is presented which can use the synchronisation graph from modular analysi...
Timo Latvala, Marko Mäkelä