Sets of pomsets are frequently used as a true-concurrency, linear-time semantics of Petri nets. For a Petri net N, let P(N), a set of pomsets, denote this pomset behaviour of N, and let P := fP(N) j N is a Petri netg denote the class of pomset behaviours of Petri nets, a generalization of L, the class of all Petri net languages. We present here an algebraic characterization for P, similar to th...

It is a well-known fact that for every k-safe Petri net, i.e. a Petri net in which no place contains more than k 2 N tokens under any reachable marking, there is a 1-safe Petri net with the same interleaving behaviour. Indeed these types of Petri nets generate regular languages. In this paper, we show that this equivalence of k-safe and 1-safe Petri nets holds also for their pomset languages, a...

We examine both the modeling power of normal and sinkless Petri nets and the computational complexities of various classical decision problems with respect to these two classes. We argue that although neither normal nor sinkless Petri nets are strictly more powerful than persistent Petri nets, they nonetheless are both capable of modeling a more interesting class of problems. On the other hand,...

Petri nets are a subject of interest to researchers since more than 30 years. They became popular since they allow the graphic representation of computational structures and have a formal underpinning that allows formal proofs of properties. Their use in engineering, however is limited to a rather small number of applications. Many of the graphic notations used in practice are very similar to t...

Software engineering and Petri net theory are disciplines of different nature. Research on software engineering focuses on a problem domain, i.e., the development of complex software systems, and tries to find a coherent set of solutions to cope with the different aspects of the problem, while research on Petri nets investigates applications and properties of a specific model (Petri nets). When...

This work treats the relationship between Petri Nets and languages. In 2003, Darondeau solved the Petri Net synthesis problem for a certain class of languages, i. e. for a given language L of this class he constructed a Petri Net generating the least Petri Net language containing L. Furthermore, he developed a decision procedure which tests for equality of these two languages. It is proved here...

This paper presents the EXHOST-PIPE software: an extension of PIPE – Platform Independent Petri net Editor – that complies with our own specifications. The new version supports the two kinds of Petri nets we have developed: particle Petri nets and plan Petri nets. EXHOST-PIPE also supports colours, modularity, time, guards, differential equations. . . The Petri net player has been extended and ...

Hierarchical Petri nets allow a more abstract view and reconfigurable Petri nets model dynamic structural adaptation. In this contribution we present the combination of reconfigurable Petri nets and hierarchical Petri nets yielding hierarchical structure for reconfigurable Petri nets. Hierarchies are established by substituting transitions by subnets. These subnets are themselves reconfigurable...