A fully abstract semantics for termination in Petri nets

  • Robert Gold
Contributions
First Online:
Part of the Lecture Notes in Computer Science book series (LNCS, volume 841)

Abstract

Since most Petri nets that arise from practical applications are extremely complex, methods for modular construction supported by compositional semantics have to be applied. An important property of asynchronous concurrent systems, which should be captured by semantics, is termination for every finite input, since infinite behaviour for finite inputs is caused by erroneous infinite loops and should be avoided.

We give a trace semantics for Petri nets, which describes the input/output behaviour together with termination behaviour and is compositional with respect to net operators for parallel composition with asynchronous communication. This semantics is fully abstract with respect to a very basic semantics that gives for every finite input the corresponding output and the information, whether the system terminates or not.

Keywords

Parallel Composition Asynchronous Communication Input Place Firing Sequence Compositional Semantic 
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.
This is a preview of subscription content, log in to check access.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    Brock, J.D.; Ackerman, W.B.: Scenarios: A model of non-determinate computation. In: Diaz, J.; Ramos, I. (eds.), Proc. of the International Colloquium on Formalization of Programming Concepts, Peniscola 1981 (LNCS 107) Springer (1981), pp. 252–259Google Scholar
  2. [2]
    de Boer, F.S.; Kok, J.N.; Palamidessi, C.; Rutten, J.J.M.M.: The failure of failures in a paradigm for asynchronous communication. In: Baeten, J.C.M.; Groote, J.F. (eds.), CONCUR 91, Amsterdam 1991 (LNCS 527) Springer (1991), pp. 111–126Google Scholar
  3. [3]
    Brauer, W.; Reisig, W.; Rozenberg, G. (eds.): Petri nets: central models and their properties. (LNCS 254) Springer (1987)Google Scholar
  4. [4]
    Gold, R.: Dataflow semantics for Petri nets. In: Havel, I.M., Koubek, V. (eds.), MFCS 92 (LNCS 629) Springer (1992), pp. 275–283Google Scholar
  5. [5]
    Gold, R.: Datenflußsemantiken für Petrinetze. TU München, Fakultät für Informatik, Dissertation (1993)Google Scholar
  6. [6]
    Gold, R.; Vogler, W.: Quality criteria for partial order semantics of place/transition nets with capacities. Fund. Informaticae 17, pp. 187–210 (1992)Google Scholar
  7. [7]
    Jonsson, B.: A fully abstract trace model for dataflow networks. In: Proc. of the 16th Annual ACM Symposium on Principles of Programming Languages, Austin 1989, pp. 155–165Google Scholar
  8. [8]
    Mazurkiewicz, A.: Trace theory. In: Brauer, W.; Reisig, W.; Rozenberg, G. (eds.), Petri Nets: Applications and Relationships to Other Models of Concurrency (LNCS 255) Springer (1987), pp. 279–324Google Scholar
  9. [9]
    Reisig, W.: Petri nets. Springer (1985)Google Scholar
  10. [10]
    Vogler, W.: Failures semantics and deadlocking of modular Petri nets. Acta Informatica 26, pp. 333–348 (1989)Google Scholar
  11. [11]
    Vogler, W.: Modular construction and partial order semantics of Petri nets. (LNCS 625) Springer (1992)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1994

Authors and Affiliations

  • Robert Gold
    • 1
  1. 1.Fakultät für InformatikTechnische Universität MünchenMünchen

Personalised recommendations