Selected papers of the Second Workshop on Concurrency and compositionality
Sequential abstract-state machines capture sequential algorithms
ACM Transactions on Computational Logic (TOCL)
How expressive are petri net schemata?
ICATPN'06 Proceedings of the 27th international conference on Applications and Theory of Petri Nets and Other Models of Concurrency
| Hi-index | 0.00 |
High-level Petri nets are frequently represented as Petri net schemas, with places, transitions and arcs inscribed by terms. A concrete system is then gained by interpreting the symbols in those terms. The behavior of a concrete system is a transition system. The composition of all those transition systems represents the behavior of the Petri net schema. This paper characterizes the expressive power of (a basic class of) Petri net schemas. It turns out that quite simple as well as quite general requirements at a transition system suffice to generate it by such a Petri net schema.