How Expressive Are Petri Net Schemata?

  • Andreas Glausch
  • Wolfgang Reisig
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4024)


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.


Transition System Function Symbol Expressive Power Boolean Expression Minimal Step 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Genrich, H.J.: Predicate/Transition Nets. In: Brauer, W., Reisig, W., Rozenberg, G. (eds.) APN 1986. LNCS, vol. 254, pp. 207–247. Springer, Heidelberg (1987)Google Scholar
  2. 2.
    Gurevich, Y.: Sequential Abstract State Machines Capture Sequential Algorithms. ACM Transactions on Computational Logic 1(1), 77–111 (2000)CrossRefMathSciNetGoogle Scholar
  3. 3.
    Nielsen, M., Rozenberg, G., Thiagarajan, P.S.: Elementary transition systems. Theor. Comput. Sci. 96(1), 3–33 (1992)zbMATHCrossRefMathSciNetGoogle Scholar
  4. 4.
    Reisig, W.: Elements of Distributed Algorithms: Modeling and Analysis with Petri Nets. Springer, Heidelberg (1998)zbMATHGoogle Scholar
  5. 5.
    Reisig, W.: On Gurevich’s Theorem on Sequential Algorithms. Acta Informatica 39(5), 273–305 (2003)zbMATHCrossRefMathSciNetGoogle Scholar
  6. 6.
    Reisig, W.: On the Expressive Power of Petri Net Schemata. In: Ciardo, G., Darondeau, P. (eds.) ICATPN 2005. LNCS, vol. 3536, pp. 349–364. Springer, Heidelberg (2005)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Andreas Glausch
    • 1
  • Wolfgang Reisig
    • 1
  1. 1.Institut für InformatikHumboldt-Universität zu Berlin 

Personalised recommendations