191 search results - page 15 / 39 » Transition systems, link graphs and Petri nets |
ECEASST
2006
13 years 8 months ago
2006
CORR
2010
Springer
13 years 8 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...
APN
2006
Springer
13 years 11 months ago
2006
Springer
A netchart is basically a Petri net whose places are located at some process and whose transitions are labeled by message sequence charts (MSCs). Two recent papers showed independe...
GECCO
2005
Springer
14 years 1 months ago
2005
Springer
Given concentrations of metabolites over a sequence of time steps, the metabolic pathway prediction problem seeks a set of reactions and rate constants for them that could yield t...
JCSS
2010
13 years 6 months ago
2010
: Every cluster in a bounded and live free-choice system has a unique blocking marking. It can be reached by firing an occurrence sequence, which avoids any transition of the clust...