Skip to main content
SpringerLink
Log in

Failures semantics based on interval semiwords is a congruence for refinement

  • Published:
Distributed Computing Aims and scope Submit manuscript

Abstract

In this paper concurrent systems are modelled with safe Petri nets. The coarsest equivalence contained in failures equivalence is determined that is a congruence with respect to refinement. It is shown that in this context partial orders are necessary for the description of system runs: what is needed here are so-called interval orders.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Aceto L.: Full abstractions for series-parallel pomsets. Tech Rep 1/90, University of Sussex, Brighton, 1990

    Google Scholar 

  2. Aceto L, Hennessy M: Towards action-refinement in process algebras. In: Proc 4th LICS 1989. IEEE Computer Soc Press 1989, pp 138–145. (A full version has appeared as Tech Rep 3/88, University of Sussex, Brighton, 1988)

  3. André C: The behaviour of a Petri net on a subset of transitions. RAIRO Autom Prod Inf Ind 17:5–21 (1983)

    Google Scholar 

  4. Bergstra JA, Klop JW: Process algebra for synchronous communication. Inf Control 60:109–137 (1984)

    Google Scholar 

  5. Best E, Devillers R: Sequential and concurrent behaviour in Petri net theory. Theor Comp Sci 55:87–136 (1987)

    Google Scholar 

  6. Best E, Devillers R, Kiehn A, Pomello L: Fully concurrent bisimulation. Tech Rep LIT-202, University Bruxelles, 1989 (to appear in Acta Informatica)

  7. Brauer W, Reisig W, Rozenberg G: Petri nets: central models and their properties. Advances in Petri nets 1986, part I. Lect Notes Comput Sci, vol 254. Springer, Berlin Heidelberg New York 1987

    Google Scholar 

  8. Brookes SD, Hoare CAR, Roscoe AW: A theory of communicating sequential processes. J ACM 31:560–599 (1984)

    Google Scholar 

  9. Castellano L, De Michelis G, Pomello L: Concurrency vs. interleaving: an instructive example. Bull EATCS 31:12–15 (1987)

    Google Scholar 

  10. Degano P, De Nicola R, Montanari U. CCS is an (augmented) contact free C/E system. In: Venturini Zilli M (ed) Mathematical models for the semantics of parallelism. Lect Notes Comput Sci, vol. 280. Springer, Berlin Heidelberg New York 1987, pp 144–165

    Google Scholar 

  11. Devillers R: Maximality preserving bisimulation. Tech Rep LIT-214, University Bruxelles, 1990

  12. Fishburn PC: Intransitive indifference with unequal indifference intervals. J Math Psych 7: 144–149 (1970)

    Google Scholar 

  13. van Glabbeek R: The refinement theorem for ST-bisimulation semantics. In: Broy M, Jones CB (eds) Proc IFIP Working Conference on Programming Concepts and Methods, Sea of Galilee, Israel, 1990 (to appear)

  14. van Glabbeek R, Goltz U: Equivalence notions for concurrent systems and refinement of actions. Arbeitspapiere der GMD 366, 1989, also in: Kreczmar A, Mirkowska G (eds) MFCS 89. Lect Notes Comput Sci, vol 379. Springer, Berlin Heidelberg New York 1989, pp 237–248

    Google Scholar 

  15. van Glabbeek R, Goltz U: Refinement of actions in causality based models. In: de Bakker JW, de Roever WP, Rozenberg G (eds) Proc REX School/Workshop on Stepwise Refinement of Distributed Systems, 1989. Lect Notes Comput Sci, vol 430. Springer, Berlin Heidelberg New York 1989, pp 267–300

    Google Scholar 

  16. van Glabbeek R, Vaandrager, F: Petri net models for algebraic theories of concurrency. In: de Bakker JW, Nijman AJ, Treleaven PC (eds) PARLE vol II. Lect Notes Comput Sci, vol 259. Springer, Berlin Heidelberg New York 1987, pp 224–242

    Google Scholar 

  17. Goltz U: On representing CCS programs by finite Petri nets. In: Chytil MP, Janiga L, Koubek V (eds) Proc MFCS 1988, Carlsbad. Lect Notes Comput Sci, vol 324. Springer, Berlin Heidelberg New York 1988, pp 339–350

    Google Scholar 

  18. Goltz U, Reisig W: The non-sequential behaviour of Petri nets. Inf Control 57:125–147 (1983)

    Google Scholar 

  19. Grabowski J: On partial languages. Ann Soc Math Pol. Ser IV, Fundam Inf 2:428–498 (1981)

    Google Scholar 

  20. Kiehn A: On the concurrent behaviour of Petri nets. Tech Rep FBI-HH-B 120/86, University Hamburg, Fachbereich Informatik, 1986

  21. Kiehn A: On the interrelationship between synchronized and non-synchronized behaviour of Petri nets. J Inf Process Cybern EIK 24:3–18 (1988)

    Google Scholar 

  22. Mazurkiewicz A: Trace theory. In: Brauer W, Reisig W, Rozenberg G (eds) Petri nets: applications and relationships to other models of concurrency. Lect Notes Comput Sci, vol 255. Springer, Berlin Heidelberg New York 1987, pp 279–324

    Google Scholar 

  23. Milner R: A calculus of communicating sequential systems. Lect Notes Comput Sci, vol 92. Springer, Berlin Heidelberg New York 1980

    Google Scholar 

  24. Müller K: Constructable Petri nets. J Inf Process Cybern EIK 21:171–199 (1985)

    Google Scholar 

  25. Nielsen M, Engberg U, Larsen K: Partial order semantics for concurrency. In: de Bakker JW, de Roever WP, Rozenberg G (eds) Proc REX School/Workshop on Linear Time, Branching Time and Partial Orders in Logics and Models of Concurrency, Nordwijkerhout, 1988. Lect Notes Comput Sci, vol 354. Springer, Berlin Heidelberg New York 1989, pp 523–548

    Google Scholar 

  26. Nielsen M, Plotkin GD, Winskel G: Petri nets, event structures and domains, part I. Theor Comput Sci 13:85–108 (1981)

    Google Scholar 

  27. Pomello L: Some equivalence notions for concurrent systems — an overview. In: Rozenberg G (ed) Advances in Petri nets 1985. Lect Notes Comput Sci, vol 222. Springer, Berlin Heidelberg New York 1986, pp 381–400

    Google Scholar 

  28. Pratt V: Modelling concurrency with partial orders. Int J Parallel Program 15:33–71 (1986)

    Google Scholar 

  29. Reisig W: On the semantics of Petri nets. In: Neuhold EJ, Chroust G (eds) Formal models in programming. Proc IFIP TC2 Working Conference on the Role of Abstract Models in Information Processing, Wien, 1985. North-Holland, 1985, pp 347–372

  30. Starke PH: Processes in Petri nets. EIK 17:389–416 (1981)

    Google Scholar 

  31. Suzuki L, Murata T: A method for stepwise refinement and abstraction of Petri nets. J Comput Syst Sci 27:51–76 (1983)

    Google Scholar 

  32. Taubner D: Finite representations of CCS and TCSP programs by automata and Petri nets. Lect Notes Comput Sci, vol 369. Springer, Berlin Heidelberg New York 1989

    Google Scholar 

  33. Valette R: Analysis of Petri nets by stepwise refinements. J Comput Syst Sci 18:35–46 (1979)

    Google Scholar 

  34. Vogler W: Behaviour preserving refinements of Petri nets. Proc 12th Int Workshop on Graph Theoretic Concepts in Computer Science. Bernried/München, 1986. Lect Notes Comput Sci, vol 246. Springer, Berlin Heidelberg New York 1987, pp 82–93

    Google Scholar 

  35. Vogler W: Failures semantics and deadlocking of modular Petri nets. Acta Inf 26:333–348 (1989)

    Google Scholar 

  36. Vogler W: Bisimulation and action refinement. Tech Rep SFB-Bericht Nr. 342/10/90A, Technische Universität München, 1990. Partly to appear in STACS 91, Hamburg. Lect Notes Comput Sci. Springer, Berlin Heidelberg New York 1991

  37. Vogler W: Failures semantics based on interval semiwords is a congruence for refinement. In: Choffrut C, Lengauer T (eds) STACS 90. Lect Notes Comput Sci, vol 415. Springer, Berlin Heidelberg New York 1990, pp 285–297

    Google Scholar 

  38. Vogler W: Failures semantics of Petri nets and the refinement of places and transitions. Tech Rep TUM-19003, Technische Universität München, 1990

Download references

Author information

Authors and Affiliations

  1. Institut für Informatik, Technische Universität, Arcisstrasse 21, W-8000, München 2, Federal Republic of Germany

    Walter Vogler

Authors
  1. Walter Vogler
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

After studying in Hamburg (Germany) and Cambridge (England),Walter Vogler received a Ph.D. from Hamburg University with a thesis in graph theory in 1984. Since then he has been working as an assistant in computer science, first in Hamburg and now in München. Currently Vogler's research concentrates on the theory of concurrency, mainly Petri net theory, and graph grammars.

This work was partially supported by the ESPRIT Basic Research Action No. 3148 DEMON (Design Methods Based on Nets)

Rights and permissions

Reprints and permissions

About this article

Cite this article

Vogler, W. Failures semantics based on interval semiwords is a congruence for refinement. Distrib Comput 4, 139–162 (1991). https://doi.org/10.1007/BF01798961

Download citation

  • Received:

  • Accepted:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01798961

Key words

Search

Navigation