Skip to main content

Interleaving semantics and action refinement with atomic choice

  • Conference paper
  • First Online:
Advances in Petri Nets 1992

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

Abstract

We investigate how to restrict the concept of action refinement such that established interleaving equivalences for concurrent systems are preserved under these restricted refinements. We show that interleaving bisimulation is preserved under refinement if we do not allow to refine action occurrences deciding choices and action occurrences involved in autoconcurrency On the other hand, interleaving trace equivalence is still not preserved under these restricted refinements.

The work presented here has partly been carried out within the Esprit Basic Research Action 3148 (DEMON) and the Sonderforschungsbereich 182 of the University of Erlangen-Nürnberg.

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

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. L. Aceto: Action Refinement in Process Algebras, PhD-Thesis, University of Sussex, 1990, Report No. 3/91, University of Sussex, Computer Science, February 1991

    Google Scholar 

  2. L. Aceto, M. Hennessy: Adding Action Refinement to a Finite Process Algebra, Report No. 6/90, University of Sussex, Computer Science, November 1990, extended abstract in: Proc. ICALP 91, LNCS 510, Springer-Verlag, pp 506–519, 1991

    Google Scholar 

  3. E. Best, R. Devillers, A. Kiehn, L. Pomello: Concurrent Bisimulation in Petri Nets, Acta Informatica, Vol. 28, pp 231–264, 1991

    Google Scholar 

  4. G. Boudol: Flow Event Structures and Flow Nets, in I. Guessarian (ed.): Semantics of Systems of Concurrent Processes, LNCS 469, Springer-Verlag, pp 62–95, 1990

    Google Scholar 

  5. G. Boudol, I. Castellani: Permutation of Transitions: An Event Structure Semantics for CCS and SCCS, in J.W. de Bakker, W.-P. de Roever & G. Rozenberg (eds.): Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency, LNCS 354, Springer-Verlag, pp 411–427, 1989

    Google Scholar 

  6. W. Brauer, R. Gold, W. Vogler: A Survey of Behaviour and Equivalence Preserving Refinements of Petri Nets, in: Advances in Petri Nets 1990, LNCS 483, Springer-Verlag, pp 1–46, 1990

    Google Scholar 

  7. Ph. Darondeau, P. Degano: Event structures, Causal trees, and Refinements, in: Proc. MFCS 90, LNCS 452, Springer-Verlag, pp 239–245, 1990

    Google Scholar 

  8. Ph. Darondeau, P. Degano: Refinement of Actions in Event Structures and Causal Trees, manuscript, 1991

    Google Scholar 

  9. R. Devillers: Maximality Preserving Bisimulation, Technical Report LIT-1214, Université Libre de Bruxelles, March 1990, to appear in TCS

    Google Scholar 

  10. R.J. van Glabbeek, U. Goltz: Refinement of Actions in Causality Based Models, in J.W. de Bakker, W.-P. de Roever & G. Rozenberg (eds.): Stepwise Refinement of Distributed Systems: Models, Formalism, Correctness, LNCS 430, Springer-Verlag, pp 267–300, 1990

    Google Scholar 

  11. R.J. van Glabbeek, U. Goltz: Equivalences and Refinement, in: I. Guessarian (ed.): Semantics of Systems of Concurrent Processes, LNCS 469, Springer-Verlag, pp 309–333, 1990

    Google Scholar 

  12. R.J. van Glabbeek, U. Goltz: A Deadlock-sensitive Congruence for Action Refinement, SFB-Bericht Nr. 342/23/90 A, TUM-19044, Technische Universität München, November 1990

    Google Scholar 

  13. R. Milner: A Calculus of Communicating Systems, LNCS 92, Springer-Verlag, 1980

    Google Scholar 

  14. M. Nielsen, U. Engberg, K. S. Larsen: Fully Abstract Models for a Process Language with Refinement, in J.W. de Bakker, W.-P. de Roever & G. Rozenberg (eds.): Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency, LNCS 354, Springer-Verlag, pp 523–548, 1989

    Google Scholar 

  15. M. Nielsen, G.D. Plotkin, G. Winskel: Petri Nets, Event Structures and Domains, Part I, Theoretical Computer Science, Vol. 13, No. 1, pp 85–108, 1981

    Google Scholar 

  16. D. Park: Concurrency and Automata on Infinite Sequences, in P. Deussen (ed.): Proc. 5th GI-Conference on Theoretical Computer Science, LNCS 104, Springer-Verlag, pp 167–183, 1981

    Google Scholar 

  17. W. Vogler: Failures Semantics Based on Interval Semiwords is a Congruence for Refinement, Distributed Computing, Vol. 4, pp 139–162, 1991

    Google Scholar 

  18. W. Vogler: Bisimulation and Action Refinement, in: Proc. STACS 91, LNCS 480, Springer-Verlag, pp 309–321, 1991

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Grzegorz Rozenberg

Rights and permissions

Reprints and permissions

Copyright information

© 1992 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Czaja, I., van Glabbeek, R.J., Goltz, U. (1992). Interleaving semantics and action refinement with atomic choice. In: Rozenberg, G. (eds) Advances in Petri Nets 1992. Lecture Notes in Computer Science, vol 609. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-55610-9_169

Download citation

  • DOI: https://doi.org/10.1007/3-540-55610-9_169

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-55610-7

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics