Skip to main content
SpringerLink
Log in

A static view of localities

  • Published:
Formal Aspects of Computing

Abstract

This paper proposes alternative, effective characterizations for nets of automata of the location equivalence and preorder presented by Boudol et al. in the companion paper [BCHK]. Contrary to the technical development in the above given reference, where locations are dynamically associated to the subparts of a process in the operational semantics, the equivalence and preorder we propose are based on a static association of locations to the parallel components of a net. Following this static approach, it is possible to give these “distributed nets” a standard operational semantics which associates with each net a finite labelled transition system. Using this operational semantics for distributed nets, we introduce effective notions of equivalence and preorder which are shown to coincide with those proposed in [BCHK].

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.: A static view of localities. Rapport de Recherche 1483, INRIA, Sophia Antipolis, Valbonne, July 1991.

    Google Scholar 

  2. Boudol, G. and Castellani, I.: A non-interleaving semantics for CCS based on proved transitions.Fundamenta Informaticae, 11(4):433–452, 1988.

    Google Scholar 

  3. Boudol, G., Castellani, I., Hennessy, M. and Kiehn, A.: A theory of processes with localities. This volume.

  4. Boudol, G., Castellani, I., Hennessy, M. and Kiehn, A.: Observing localities. Technical Report 4/91, University of Sussex, March 1991. To appear inTheoretical Computer Science. An extended abstract appeared in theProceedings of MFCS '91, LNCS 520.

  5. Castellani, I.:Bisimulations for concurrency, PhD thesis, Report CST-51-88, Department of Computer Science, University of Edinburgh, April 1988.

  6. Castellani, I. and Hennessy, M.: Distributed bisimulations.Journal of the ACM, 36(4):887–911, 1989.

    Google Scholar 

  7. Darondeau, P. and Degano, P.: Causal trees. Publication Interne No. 442, IRISA, Rennes Cedex, France, 1988. An extended abstract appeared in: Proceedings ICALP 89, Stresa (G. Ausiello, M. Dezani-Ciancaglini & S. Ronchi Della Rocca), LNCS 372, Springer-Verlag, pp. 234–248.

  8. Degano, P., De Nicola, R. and Montanari, U.: Universal axioms for bisimulation, 1992. To appear inTheoretical Computer Science.

  9. Degano, P. and Priami, C: Proved trees. In Kuich [Kui92], pages 629–640.

  10. Fernandez, J.-C.: Aldébaran: a tool for verification of communicating processes. Technical report SPECTRE cl4, LGI-IMAG, Grenoble, 1989.

  11. Inverardi, P., Priami, C. and Yankelevich, D.: Verification of concurrent systems in SML, June 1992. To appear inProceedings of the ACM Sigplan Workshop on ML and its applications, San Francisco.

  12. Kiehn, A.: Distributed bisimulations for finite CCS. Technical Report 7/89, University of Sussex, 1989.

  13. Kiehn, A.: Local and global causes. Technical Report 342/23/91, Technische Universitat Munchen, 1991.

  14. Krishnan, P.: Distributed CCS. In J.C.M. Baeten and J.F. Groote, editors,Proceedings CONCUR 91, Amsterdam, volume 527 ofLecture Notes in Computer Science, pages 393–407. Springer-Verlag, 1991.

  15. Kuich, W.: editor.Proceedings 19 th ICALP, Vienna, volume 623 ofLecture Notes in Computer Science. Springer-Verlag, 1992.

  16. Larsen, K.G.: Efficient local correctness checking (extended abstract), 1992. Accepted for CAV '92.

  17. Milner, R.:Communication and Concurrency. Prentice-Hall International, Englewood Cliffs, 1989.

    Google Scholar 

  18. Malhotra, J., Smolka, S., Giacalone, A. and Shapiro, R.: Winston, a tool for hierarchical design and simulation of concurrent systems. InWorkshop on Specification and Verification of Concurrent Systems, Stirling, Scotland, 1988.

    Google Scholar 

  19. Montanari, U. and Yankelevich, D.: A parametric approach to localities. In Kuich [Kui92], pages 617–628.

  20. de Simone, R. and Vergamini, D.: Aboard AUTO. Technical Report 111, INRIA, Centre Sophia-Antipolis, Valbonne Cedex, 1989.

    Google Scholar 

  21. Yankelevich, D.: Inducing preorders on observation trees. Technical Memo HP-PSC-92-33, Hewlett-Packard, Pisa Science Center, April 1992.

Download references

Author information

Authors and Affiliations

  1. School of Cognitive and Computing Sciences, University of Sussex, Brighton, UK

    Luca Aceto

Authors
  1. Luca Aceto
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Aceto, L. A static view of localities. Formal Aspects of Computing 6, 201–222 (1994). https://doi.org/10.1007/BF01221099

Download citation

  • Received:

  • Accepted:

  • Issue Date:

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

Keywords

Search

Navigation