Welcome!
To use the personalized features of this site, please log in or register.
If you have forgotten your username or password, we can help.
My Menu
Saved Items

Reproducibility of the Empty Marking

Kurt LautenbachContact Information

(6)  University of Koblenz-Landau, Universitätsstr. 1, 56075 Koblenz, Germany
Abstract
The main theorem of the paper states that the empty marking Ø is reproducible in a p/t-net $$
\mathcal{N}
$$ if and only if there are reproducing T-invariants whose net representations have neither traps nor co-traps (deadlocks, siphons). This result is to be seen in connection to modeling processes, since all processes which have a start and a goal event usually reproduce the empty marking.

Contact Information Kurt Lautenbach
Email: laut@uni-koblenz.de
URL: http://www.uni-koblenz.de/~laut
Fulltext Preview (Small, Large)
Image of the first page of the fulltext

References secured to subscribers.



Export this chapter
Export this chapter as RIS | Text
 
Remote Address: 38.107.191.107 • Server: mpweb04
HTTP User Agent: CCBot/1.0 (+http://www.commoncrawl.org/bot.html)