Advances in Petri nets 1986, part I on Petri nets: central models and their properties
Selected papers of the Second Workshop on Concurrency and compositionality
Elements of distributed algorithms: modeling and analysis with Petri nets
Elements of distributed algorithms: modeling and analysis with Petri nets
Sequential abstract-state machines capture sequential algorithms
ACM Transactions on Computational Logic (TOCL)
On the expressive power of petri net schemata
ICATPN'05 Proceedings of the 26th international conference on Applications and Theory of Petri Nets
| Hi-index | 0.00 |
Petri net schemata are an intuitive and expressive approach to describe high-level Petri nets. A Petri net schema is a Petri net with edges and transitions inscribed by terms and Boolean expressions, respectively. A concrete high-level net is gained by interpreting the symbols in the inscriptions by a structure. The semantics of this high-level net can be described in terms of a transition system. Therefore, the semantics of a Petri net schema can be conceived as a family of transition systems indexed by structures. In this paper we characterize the expressive power of a general version of Petri net schemata. For that purpose we examine families of transition systems in general and characterize the families as generated by Petri net schemata. It turns out that these families of transition systems can be characterized by simple and intuitive requirements.