357 search results - page 16 / 72 » On the Model of Computation of Place Transition Petri Nets |
TASE
2008
IEEE
13 years 7 months ago
2008
IEEE
In this paper we deal with the problem of modeling railway networks with Petri nets so as to apply the theory of supervisory control for discrete event systems to automatically de...
BIRTHDAY
2005
Springer
14 years 1 months ago
2005
Springer
Abstract In this paper, we propose a new loose semantics for place/transition nets based on transition systems and generalizing the reachability graph semantics. The loose semantic...
ENTCS
2006
13 years 7 months ago
2006
The term Ubiquitous Computing was coined by Mark Weiser almost two decades ago. Despite all the time that has passed since Weiser's vision, ubiquitous computing still has a l...
IFIP
2005
Springer
14 years 1 months ago
2005
Springer
Recently, opacity has proved to be a promising technique for describing security properties. Much of the work has been couched in terms of Petri nets. Here, we extend the notion of...
ICALP
2010
Springer
14 years 10 days ago
2010
Springer
We show that the downward-closure of a Petri net language is effectively computable. This is mainly done by using the notions defined for showing decidability of the reachability...