Advertisement

Refinement of concurrent systems based on local state transformations

  • Lucia Pomello
Technical Contributions
Part of the Lecture Notes in Computer Science book series (LNCS, volume 430)

Abstract

The paper presents a notion of preorder with related equivalence between concurrent systems which supports functional abstraction and refinement. Such abstraction and refinement disregard action names (the action alphabet can be changed) while they require to preserve local state transformations. Since Petri Nets explicitly model both states and state transformations, concurrent systems are considered as modelled by Petri nets, precisely by contact-free Elementary Net systems in which some states are observable (S-labelled systems). The proposed preorder, called State transformation (ST) preorder, is defined on the basis of morphisms between the OLST-algebras associated to the compared systems. OLST-algebras describe the state space of S-labelled systems characterizing system behaviour in terms of observable local state transformations. The paper presents the construction of the unique canonical representative of each ST-equivalence class of S-observable systems, a subclass of S-labelled systems, and discusses ST-preorder and equivalence over S-observable systems in the framework of system development.

Key words

functional abstraction and refinement observable local/global states local state transformations morphisms preserving local state transformations 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

8. References

  1. [Abr87]
    S. Abramsky, Observation Equivalence as a Testing Equivalence, Theor.Comp. Science 53, pp. 225–241, 1987Google Scholar
  2. [Ber86]
    G. Berthelot, Checking Properties of Nets Using Transformations,LNCS Lecture Notes in Computer Science, 222, pp. 19–40, 1986.Google Scholar
  3. [BDKP89]
    E. Best, R. Devillers, A. Kiehn, L. Pomello, Fully Concurrent Bisimulation, submitted paper 1989.Google Scholar
  4. [Bra87]
    W. Brauer, W. Reisig, G. Rozenberg (eds.),Petri Nets: Central Models and Their Properties, LNCS Lecture Notes in Computer Sciences 254, 1987.Google Scholar
  5. [BHR84]
    S.D. Brookes, C.A.R. Hoare, A.W. Roscoe, A Theory of Communicating Sequential Processes, J. ACM 31, N.3, July '84, 1984.Google Scholar
  6. [CDP87]
    L. Castellano, G. De Michelis, L. Pomello, Concurrency vs Interleaving: an instructive example, EATCS Bull., N. 31, pp. 12–15, 1987.Google Scholar
  7. [DDM87]
    P. Degano, R. De Nicola, U. Montanari, Observational equivalences for concurrency models, in ‘Formal description of Programming Concepts III’ (M. Virsing ed.), North Holland, 1987.Google Scholar
  8. [DDS87]
    F. De Cindio, G. De Michelis, C. Simone, GAMERU: a language for the analysis and design of human communication pragmatics, in G. Rozemberg (ed) "Advances in Petri Nets 86'", LNCS Lecture Notes in Computer Sciences, 266, 1987.Google Scholar
  9. [DDPS85]
    F. De Cindio, G. De Michelis, L. Pomello, C. Simone, Exhibited-Behaviour Equivalence and Organizational Abstraction in Concurrent System Design, Proc. 5th International Conference on Distributed Computing, IEEE, Denver, 1985.Google Scholar
  10. [DDPS88]
    F. De Cindio, G. De Michelis, L. Pomello, C. Simone, A State Transformation Equivalence for Concurent Systems: Exhibited Functionality Equivalence, in F.H. Vogt (ed) "CONCURRENCY 88", LNCS Lecture Notes in Computer Sciences, 335, 1988.Google Scholar
  11. [DH84]
    R. De Nicola, M. Hennessy, Testing equivalences for processes, TCS 34, 83–134, 1984.Google Scholar
  12. [GG89]
    R. van Glabbeek, U. Goltz, Refinement of actions in causality based models, in this volume, 1989.Google Scholar
  13. [Hen88]
    M. Hennessy, Algebraic Theory of Processes, The MIT Press, 1988.Google Scholar
  14. [Jif89]
    He Jifeng, Various Refinements and Simulations, in this volume, 1989.Google Scholar
  15. [Lam86]
    L. Lamport, On Interprocess Communication, Part 1: Basic Formalism, Distributed Computing, Vol. 1, pp. 77–85, 1986.CrossRefGoogle Scholar
  16. [Lar89]
    K. Larsen, An Operational Semantics of Context, in this volume, 1989.Google Scholar
  17. [MM88]
    B.J. Meseguer, U. Montanari, Petri Nets are Monoids, SRI-CSL-88-3, january 1988.Google Scholar
  18. [Mil80]
    R. Milner, A Calculus for Communicating Systems, LNCS Lecture Notes in Computer Sciences, 92, 1980.Google Scholar
  19. [Par81]
    D. Park, Concurrency and Automata on Infinite Sequences, Proc. 5th Gl Conference, LNCS Lecture Notes in Computer Sciences, 104, pp. 167–183, 1981.Google Scholar
  20. [Pet73]
    C.A. Petri, Concepts in Net Theory, Mathematical Foundations of Computer Science: Proc. of Symposium and Summer School, High Tatras, sept. 1973, Math. Inst. of the Slovak Acad. of Sciences, pp.137–146, 1973.Google Scholar
  21. [Pet89]
    C.A. Petri, Perfect Nets, Invited talk at the X Int. Conf. On Application and Theory of Petri Nets, Bonn, june 1989.Google Scholar
  22. [Pom86]
    L. Pomello, Some Equivalence Notions for Concurrent Systems: An Overview, in "Advances in Petri Nets 1985" (G. Rozenberg ed.), LNCS Lecture Notes in Computer Sciences, 222, pp. 381–400, 1986.Google Scholar
  23. [PS89a]
    L. Pomello, C. Simone, A State Transformation Preorder over a class of EN-systems, Proc X Int. Conf. On Application and Theory of Petri Nets, Bonn, pp. 247–271, june 1989.Google Scholar
  24. [PS89b]
    L. Pomello, C. Simone, Concurrent Systems as Local State Transformation Algebras: the case of Elementary Net Systems, in "Proc. 3rd Italian Conference on Theoretical Computer Science, Mantova, Nov.89, eds. Bertoni, Bohem, Miglioli, World Scientific Publ. Co., 1989.Google Scholar
  25. [RT86]
    G. Rozenberg, P.S. Thiagarajan, Petri Nets: basic notions, structure, behaviour, in "Current trends in Concurrency" ed. J.W. de Bakker, W.P. de Rover and G. Rozenberg, LNCS Lecture Notes in Computer Sciences, 224, pp. 585–668, 1986.Google Scholar
  26. [Thi87]
    P.S. Thiagarajan, Elementary Net Systems, in [Bra87], pp. 26–59, 1987.Google Scholar
  27. [Val79]
    R. Valette, Analysis of Petri Nets by Stewise Refinements, J. of Computer and System Science, vol.18-1, 1979.Google Scholar
  28. [Voss87]
    K. Voss, Interface as a Basic Concept for Systems Specification and Verification, in "Concurrency and Nets" (eds) K. Voss, H.J. Genrich, G. Rozenberg, Springer Verlag, Berlin, pp.585–604, 1987.Google Scholar
  29. [Win84]
    G. Winskel, A New Definition of Morphism on Petri Nets, in LNCS Lecture Notes in Computer Sciences, 166, pp.140–150, 1984.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1990

Authors and Affiliations

  • Lucia Pomello
    • 1
  1. 1.Dipartimento di Scienze dell'InformazioneMilanoItaly

Personalised recommendations