Skip to main content
SpringerLink
Log in

Bisimulation and action refinement

  • Concurrency I
  • Conference paper
  • First Online:
STACS 91 (STACS 1991)

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

Included in the following conference series:

Abstract

For event structures with silent moves we consider several types of bisimulation that incorporate ‘true’ concurrency to a varying degree, and show how each can be lifted in a uniform way to a congruence w.r.t. action refinement. We prove that we have constructed the coarsest congruences that respect interleaving, pomset and history preserving bisimulation.

This work was partially supported by the Deutsche Forschungsgemeinschaft, Sonderforschungsbereich 342: Methoden und Werkzeuge zur Nutzung paralleler Rechnerarchitekturen, TU München and the ESPRIT Basic Research Action No. 3148 DEMON (Design Methods Based on Nets).

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. S. Abramsky. Observation equivalence as a testing equivalence. Theor. Comp. Sci., 53:225–241, 1987.

    Article  Google Scholar 

  2. L. Aceto. On relating concurrency and nondeterminism. Technical Report 6/89, Dept. Comp. Sci. Univ. of Sussex, Brigthon, 1989.

    Google Scholar 

  3. L. Aceto. Full abstractions for series-parallel pomsets. Technical Report 1/90, Dept. Comp. Sci. Univ. of Sussex, Brigthon, 1990.

    Google Scholar 

  4. L. Aceto and M. Hennesy. Towards action-refinement in process algebras. Technical Report 3/88, Dept. Comp. Sci. Univ. of Sussex, Brigthon, 1988.

    Google Scholar 

  5. G. Boudol and I. Castellani. On the semantics of concurrency: Partial orders and transition systems. In H. Ehrig et al., editors, TAPSOFT 87, Vol. I, Lect. Notes Comp. Sci. 249, 123–137, 1987.

    Google Scholar 

  6. E. Best, R. Devillers, A. Kiehn, and L. Pomello. Fully concurrent bisimulation. Technical Report LIT-202, Univ. Bruxelles, 1989.

    Google Scholar 

  7. E. Best and C. Fernandéz. Nonsequential Processes: a Petri Net View. EATCS Monographs on Theor. Comput. Sci. 13. Springer, 1988.

    Google Scholar 

  8. L. Castellano, G. De Michelis, and L. Pomello. Concurrency vs. interleaving: An instructive example. Bull. EATCS, 31:12–15, 1987.

    Google Scholar 

  9. R. Devillers. Maximality preserving bisimulation. Technical Report LIT-214, Univ. Bruxelles, 1990.

    Google Scholar 

  10. R.J. v Glabbeek and U. Goltz. Equivalence notions for concurrent systems and refinement of actions. In A. Kreczmar and G. Mirkowska, editors, MFCS 89, Lect. Notes Comp. Sci. 379, 237–248, 1989.

    Google Scholar 

  11. R.J. v. Glabbeek and U. Goltz. Refinement of actions in causality based models. In J.W. de Bakker, W.P. de Roever, and G. Rozenberg, editors, Proc. REX Workshop on Stepwise Refinement of Distrib. Systems 1989, Lect. Notes Comp. Sci. 430, 267–300, 1990.

    Google Scholar 

  12. R.J. v. Glabbeek. The refinement theorem for ST-bisimulation semantics. In M. Broy and C.B. Jones, editors, Proc. IFIP Working Conference on Programming Concepts and Methods, Sea of Galilee, Israel, 1990. to appear.

    Google Scholar 

  13. J. Grabowski. On partial languages. Fundamenta Informaticae, IV.2:428–498, 1981.

    Google Scholar 

  14. R.J. v. Glabbeek and F. Vaandrager. Petri net models for algebraic theories of concurrency. In J.W. de Bakker et al., editors, PARLE Vol. II, Lect. Notes Comp. Sci. 259, 224–242, 1987.

    Google Scholar 

  15. R.J. v. Glabbeek and W.P. Weijland. Refinement in branching time semantics. In Proc. AMAST Conf., pages 197–201, 1989.

    Google Scholar 

  16. L. Lamport. On interprocess communication I. Distributed Comp., 1:77–85, 1986.

    Article  Google Scholar 

  17. R. Milner. A modal characterisation of observable machine-behaviour. In G. Astesiano and C. Böhm, editors, CAAP 81, Lect. Notes Comp. Sci. 112, pages 267–310, 1981.

    Google Scholar 

  18. R. Milner. Calculi for synchrony and asynchrony. Theor. Comput. Sci., 25:267–310, 1983.

    Article  Google Scholar 

  19. M. Nielsen, U. Engberg, and K. Larsen. Partial order semantics for concurrency. In J.W. de Bakker et al., editors, Proc. REX School / Workshop Linear Time, Branching Time and Partial Order in Logic and Models of Concurrency. Noordwijkerhout, 1988, Lect. Notes Comp. Sci. 354, 523–548, 1989.

    Google Scholar 

  20. M. Nielsen, G.D. Plotkin, and G. Winskel. Petri nets, event structures and domains I. Theor. Comput. Sci., 13:85–108, 1981.

    Article  Google Scholar 

  21. D. Park. Concurrency and automata on infinite sequences. In P. Deussen, editor, Proc. 5th GI Conf. on Theoretical Comp. Sci., Lect. Notes Comp. Sci. 104, 167–183, 1981.

    Google Scholar 

  22. V. Pratt. Modelling concurrency with partial orders. Int. J. Parallel Prog., 15:33–71, 1986.

    Article  Google Scholar 

  23. A. Rabinovich and B.A. Trakhtenbrot. Behaviour structures and nets. Fundamenta Informaticae, 11:357–404, 1988.

    Google Scholar 

  24. W. Vogler. Bisimulation and action refinement. Technical Report SFB-Bericht Nr. 342/10/90A, Inst. f. Informatik, TU München, 1990.

    Google Scholar 

  25. W. Vogler. Failures semantics based on interval semiwords is a congruence for refinement. In C. Choffrut and T. Lengauer, editors, STACS 90, Lect. Notes Comp. Sci. 415, 285–297, 1990. To appear in Distributed Computing.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institut für Informatik, TU München, 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 Matthias Jantzen

Rights and permissions

Reprints and permissions

Copyright information

© 1991 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Vogler, W. (1991). Bisimulation and action refinement. In: Choffrut, C., Jantzen, M. (eds) STACS 91. STACS 1991. Lecture Notes in Computer Science, vol 480. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0020808

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-53709-0

  • Online ISBN: 978-3-540-47002-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation