Skip to main content
SpringerLink
Log in

Failures semantics based on interval semiwords is a congruence for refinement

  • Conference paper
  • First Online:
STACS 90 (STACS 1990)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 415))

Included in the following conference series:

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 chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Aceto, L., Hennessy, M.: Towards action-refinement in process algebras. University of Sussex, Computer Science Report 3/88, 1988

    Google Scholar 

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

    Article  Google Scholar 

  3. Brookes, S.D., Hoare, C.A.R., Roscoe, A.W.: A theory of communicating sequential processes. J. ACM 31 (1984) 560–599

    Article  Google Scholar 

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

    Google Scholar 

  5. Degano, P., De Nicola, R., Montanari, U.: CCS is an (augmented) contact free C/E system. In: M.V.Zilli(ed.): Mathematical Models for the Semantics of Parallelism. Springer LNCS 280 (1987) 144–165

    Google Scholar 

  6. Devillers, R.: On the definition of a bisimulation notion based on partial words. Petri Net Newsletter 29 (1988) 16–19

    Google Scholar 

  7. Fishburn, P.C.: Intransitive indifference with unequal indifference intervals. J. Math. Psych. 7 (1970) 144–149

    Article  Google Scholar 

  8. van Glabbeek, R.: The refinement theorem for ST-bisimulation semantics. Unpublished manuscript

    Google Scholar 

  9. van Glabbeek, R., Goltz, U.: Equivalence notions for concurrent systems and refinement of actions. Arbeitspapiere der GMD 366, 1989

    Google Scholar 

  10. van Glabbeek, R., Vaandrager, F.: Petri net models for algebraic theories of concurrency. In: J.W. de Bakker et al.(eds.): PARLE Vol. II, Springer, LNCS 259 (1987) 224–242

    Google Scholar 

  11. Goltz, U.: On representing CCS programs by finite Petri nets. In: M.P.Chytil et al.(eds.): Proc. MFCS 1988, Carlsbad. Springer, LNCS 324 (1988) 339–350

    Google Scholar 

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

    Article  Google Scholar 

  13. Grabowski, J.: On Partial Languages. Ann. Soc. Math. Pol., Fundamenta Informaticae IV.2 (1981) 428–498

    Google Scholar 

  14. Kiehn, A.: On the concurrent behaviour of Petri nets. Techn. Rep. FBI-HH-B 120/86, Univ. Hamburg, Fachber. Informatik, 1986

    Google Scholar 

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

    Google Scholar 

  16. Mazurkiewicz, A.: Trace theory. In: W. Brauer, W.Reisig, G. Rozenberg (eds.): Petri Nets: Applications and Relationship to Other Models of Concurrency. Sprin-ger, LNCS 255 (1987) 279–324

    Google Scholar 

  17. Müller, K.: Constructable Petri nets. EIK 21 (1985) 171–199

    Google Scholar 

  18. Nielsen, M., Engberg, U., Larsen, K.: Partial order semantics for concurrency. In: Course material of the REX School/Workshop on Linear Time, Branching Time and Partial Orders in Logics and Models of Concurrency, Nordwijkerhout, 1988

    Google Scholar 

  19. Nielsen, M., Plotkin, G.D., Winskel, G.: Petri nets, event structures and domains, part I. Theoret. Comp. Sci. 13 (1981) 85–108

    Article  Google Scholar 

  20. Pomello, L.: Some equivalence notions for concurrent systems — an overview. In: G. Rozenberg(ed.): Advances in Petri Nets 1985. Springer, LNCS 222, 381–400

    Google Scholar 

  21. Pratt, V.R.: On the composition of processes. In: Proc. 9th ACM Symp. on Principles of Programming Languages 1982, 213–223

    Google Scholar 

  22. Pratt, V.: Modelling concurrency with partial orders. Int. J. of Parallel Programming 15, 1986

    Google Scholar 

  23. Reisig, W.: On the semantics of Petri nets. In: E.J.Neuhold, G.Chroust(eds.): Formal Models in Programming, Proc. IFIP TC2 Working Conf. on the Role of Abstract Models in Inf. Processing, Wien, 1985. North-Holland 1985, 347–372

    Google Scholar 

  24. Suzuki, I., Murata, T.: A method for stepwise refinement and abstraction of Petri nets. J. Comp. Syst. Sciences 27 (1983) 51–76

    Article  Google Scholar 

  25. Starke, P.H.: Processes in Petri nets. EIK 17 (1981) 389–416

    Google Scholar 

  26. Taubner, D.: The finite representation of abstract programs by automata and Petri nets. Dissertation, Techn. Univ. München, 1988

    Google Scholar 

  27. Valette, R.: Analysis of Petri nets by stepwise refinements. J. Comp. Syst. Sciences 18 (1979) 35–46

    Article  Google Scholar 

  28. Vogler, W.: Behaviour preserving refinements of Petri nets. Proc. 12th Int. Workshop on Graph Theoretic Concepts in Computer Science, Bernried/München, 1986. Springer, LNCS 246 (1987) 82–93

    Google Scholar 

  29. Vogler, W.: Failures semantics and deadlocking of modular Petri nets. Acta Informatica 26 (1989) 333–348. An extended abstract has appeared in: M. P. Chytil et al.(eds.): Proc. MFCS 1988, Carlsbad; Springer, LNCS 324 (1988) 542–551

    Google Scholar 

  30. Vogler, W.: Failures semantics based on interval semiwords is a congruence for refinement. Techn. Rep. TUM-I8905, Techn. Univ. München, 1989

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institut für Informatik, Technische Universität, Arcisstr. 21, D-8000, München 2

    Walter Vogler

Authors
  1. Walter Vogler
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Christian Choffrut Thomas Lengauer

Rights and permissions

Reprints and permissions

Copyright information

© 1990 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Vogler, W. (1990). Failures semantics based on interval semiwords is a congruence for refinement. In: Choffrut, C., Lengauer, T. (eds) STACS 90. STACS 1990. Lecture Notes in Computer Science, vol 415. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-52282-4_51

Download citation

  • DOI: https://doi.org/10.1007/3-540-52282-4_51

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-52282-9

  • Online ISBN: 978-3-540-46945-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation