183 search results - page 1 / 37 » The Downward-Closure of Petri Net Languages |
ICALP
2010
Springer
13 years 9 months 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...
APN
2003
Springer
13 years 8 months ago
2003
Springer
The Petri Net Markup Language (PNML) is an XML-based interchange format for Petri nets. In order to support different versions of Petri nets and, in particular, future versions of ...
IFM
2004
Springer
13 years 10 months ago
2004
Springer
Abstract. In this paper, we address the problem of expressing objectoriented concepts in terms of Petri nets. This is interesting, first, as a possibility of representing concurre...
WSC
2007
13 years 7 months ago
2007
In this paper we present a survey on methods for the synthesis of Petri nets from behavioral descriptions given as languages. We consider place/transition Petri nets, elementary P...
ICALP
2005
Springer
13 years 10 months ago
2005
Springer
The firing rule of Petri nets relies on a residuation operation for the commutative monoid of natural numbers. We identify a class of residuated commutative monoids, called Petri ...