47 search results - page 4 / 10 » Decidability Problems in Petri Nets with Names and Replicati... |
ATAL
2008
Springer
13 years 7 months ago
2008
Springer
Agents programmed in BDI-inspired languages have goals to achieve and a library of plans that can be used to achieve them, typically requiring further goals to be adopted. This is...
IANDC
2008
13 years 5 months ago
2008
Timed Petri nets and timed automata are two standard models for the analysis of real-time systems. In this paper, we prove that they are incomparable for the timed language equival...
ENTCS
2007
13 years 5 months ago
2007
In recent papers we have introduced Mobile Synchronizing Petri Nets, a new model for mobility based on coloured Petri Nets. It allows the description of systems composed of a coll...
FSTTCS
2006
Springer
13 years 9 months 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...
CONCUR
2009
Springer
13 years 9 months ago
2009
Springer
We consider the model of Time Petri Nets where time is associated with transitions. Two semantics for time elapsing can be considered: the strong one, for which all transitions are...