OBJSA Nets: A Class of High-level Nets Having Objects as Domains

  • E. Battiston
  • F. De Cindio
  • G. Mauri
Chapter

Abstract

To define classes of high level nets having structured (individual) tokens is a very fundamental goal for making nets actually usable in real concurrent system modelling. A promising approach is that of combining nets with algebraic specification techniques. This results in a formal specification language which supports both aspects of system modelling, namely data structure and control structure modelling, with suitable abstraction notions.

Some different formalisms combining nets and abstract data types have been proposed. In this paper, we define a class of high-level Petri nets, namely OBJSA net systems (or OBJSA nets for short), in which: 1) the net can be decomposed into state-machine components, i.e. it preserves the main characteristics of Superposed Automata (SA) nets; 2) the domains to which individual tokens belong are defined as abstract data types by using the language OBJ2. For this class of nets two products (namely an S-product ⊗ and a T-product ⊙) are then provided for defining, respectively, the S- and T-invariants as the first step for preserving in the resulting specification language the possibility, typical of nets, of deriving properties of the modelled system by using algebraic techniques.

Keywords

Specification Language Incidence Matrix Parameterized Object Constant Operator Closed Transition 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, log in to check access.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. |AMRW|.
    E. Astesiano, G.F. Mascari, G. Reggio, M. Wirsing, On the parameterized algebraic specification of concurrent systems Proc. CAAP ’85, LNCS 185, Springer Verlag, 1985Google Scholar
  2. |Bat|.
    E. Battiston, Definizione di una classe di reti di alto livello aventi per domini tipi di dati astratti Thesis, Dept. Information Sciences, University of Milano, A.A. 85/86 (in italian)Google Scholar
  3. |Ber|.
    B. Berthomieu et al. Abstract data nets: combining Petri nets and abstract data types for high level specifications of distributed.ystems, Proc. 7th European Workshop on Applications and Theory of Petri Nets, Oxford, UK, 1986Google Scholar
  4. |Bert|.
    G. Berthelot, Transformations and decompositions of nets Proc. Advanced Course on Petri nets, Bad Honnef, September 1986Google Scholar
  5. |BCG|.
    R. Balzer, T. Cheatham, C. Green, Software Technology in the 1990’s Using a new Paradigm in Computer, 11.85, pp. 39–45Google Scholar
  6. |BDM1|.
    E. Battiston, F. De Cindio, G. Mauri, OBJSA Net Systems Int. Rep., Dip. Scienze dell’Informazione, Milano, 1987Google Scholar
  7. |BDM2|.
    E. Battiston, F. De Cindio, G. Mauri, OBJSA nets: OBJ2 and Petri Nets for specifying concurrent systems accepted for pubblication in “Experiences with OBJ” (R. Gallimore ed.), to appearGoogle Scholar
  8. |BFP|.
    E. Best, C. Fernandez, H. Plünnecke Concurrent systems and processes. GMD-Studien Nr.104. 1985 MATHGoogle Scholar
  9. |BV|.
    C. Beierle, A. Voss, On implementation of loose abstract data type specifications and their vertical composition Proc. STACS ‘87, LNCS 247, Springer Verlag, 1987Google Scholar
  10. |CCITT|.
    CCITT, Recommendation Z 100 1988 (preliminary version)Google Scholar
  11. |CDM|.
    C. Cavenaghi, M. De Zanet, G. Mauri, MC-Ohj• a C interpreter for OBJ accepted for pubblication in “Experiences with OBJ” (R. Gallimore ed.), to appearGoogle Scholar
  12. |CHJ|.
    B. Cohen, W.T. Harwood, M.I. Jackson, The specification of complex systems Addison Wesley, 1986Google Scholar
  13. |DDPS|.
    F. De Cindio, G. De Michelis, L. Pomello, C. Simone, Superposed Automata Nets in “Application and Theory of Petri Nets” (C. Girault and W. Reisig eds.), 1FB 52, Springer Verlag, 1982Google Scholar
  14. |DDS|.
    F.De Cindio, G. De Michelis, C. Simone Gameru: a language for the ana ysis and design of human communication pragmatics, in “Advances in Petri Nets 87”, (G. Rozemberg ed.), LNCS 266, Springer Verlag, 1987Google Scholar
  15. |DLT|.
    F. De Cindio, G.A. Lanzarone, A. Torgano, A Petri Net Model of SDL, Proc. 5th European Workshop on Petri nets, Aarhus (Dk), 1984Google Scholar
  16. |EM|.
    H. Ehrig, B. Mahr Fundamentals of algebraic specification 1, Springer Verlag, 1985Google Scholar
  17. |FGJM|.
    K. Futatsugi, J.A. Goguen, J.P. Jouannaud, J. Meseguer Principles of OBJ2, Proc. ACM Symp. on Principles of Programming Languages, 1985Google Scholar
  18. |Gen|.
    H. Genrich, Predicate/Transition nets in “Petri Nets: Central Models and Their Properties”, (W. Brauer, W. Resig, G. Rozemberg eds.), LNCS 254, Springer Verlag, 1987Google Scholar
  19. |GGM|.
    V. Giarratana, F. Gimona, U. Montanan, Observability Concepts in Abstract Data Type Specific •tions, Proc. 5th Symp. Math. Found. of Comp. Science 1976, LNCS 45, Springer Varlag 1976, 576–587Google Scholar
  20. |GH|.
    A. Geser, H. Hussmann, experiences with the RAP system - a snecification intemreter combining term rewriting and resolution Proc. ESOP 86, LNCS 213, 1986, 339–350Google Scholar
  21. |GL1|.
    H. Genrich, K. Lautenbach, System Modelling with High-level Petri nets, TCS 13, North-Holland 1981Google Scholar
  22. |GL2|.
    H. Genrich, K. Lautenbach, 5-invariance in Predicate-Transition Nets, in “Application and Theory of Petri Nets” (A. Pagnoni and G. Rozenberg eds.), IFB 66, Springer Verlag, 1983Google Scholar
  23. |Gog|.
    J.A. Goguen, Parameterized programming, IEEE Trans. on Soft. Eng., SE-10(5), 528–543, 1984CrossRefGoogle Scholar
  24. |GTW|.
    J.A. Goguen, J.W. Thatcher, E.G. Wagner An initial algebra approach to the specification. correctness and implementation of abstract data tees in “Current trends in programming methodology IV: Data structuring, (R. Yeh, Ed.), Prentice Hall, 1978, 80–144Google Scholar
  25. |Hac|.
    M. Hack, Extended State-Machine Allocatable Nets, an extension of Free Choice Petri Nets results, MIT Project MAC, MAC-TR 78–1, Cambridge (Ma, Usa), 1974Google Scholar
  26. |Hoa|.
    C.A.R. Hoare, Communicating sequential processes, CACM 21, 666–677, 1978MATHGoogle Scholar
  27. |ISO|.
    ISO,Information Processing Systems - Open Systems Interconnection - The definition of the specification language LOTOS. Draft proposal ISO/TC 97/SC 16/WGIN157, August 1983Google Scholar
  28. |Jen|.
    K. Jensen, Coloured Petri nets and the invariant method, TCS 14, 1981, 317–336CrossRefMATHGoogle Scholar
  29. |Kra|.
    B. Kraemer, Stepwise construction of non-sequential software.ystems using a net-based specification language in “Advances in Petri nets 1984” (G. Rozenberg ed.), LNCS 188, Springer Verlag, 1985Google Scholar
  30. |Les|.
    P. Lescanne Computer experiments with the REVE term rewriting system generator. Proc. 10th ACM Symp. on Principles of Programming Languages, 1983, 99–108Google Scholar
  31. |LP|.
    K. Lautenbach, A. Pagnoni, Invariance and Duality in Predicate/Transition Nets and Coloured Nets, GMD Report n.132, 1985Google Scholar
  32. |LTS|.
    P.E. Lauer, P.R. Torrigiani, M.W. Shields COSY - A System Specification Language Based on Paths and Processes, Acta Informatica, 12, 1979, 109–158CrossRefMATHGoogle Scholar
  33. |LZ|.
    B. Liskov, S. Zilles, An introduction to Formal Specifications of Data Abstractions, in ‘Current Trends in Programming Methodology’ (R. Yeh ed.), Prentice-Hall, 1978Google Scholar
  34. |Mil|.
    R. Milner,:. Sif i r’ 1’:It, LNCS 92, Springer Verlag, 1980Google Scholar
  35. |Obe|.
    H. Oberquelle, Some concepts for studiyng flow and modification of actors and objects in high level nets Proc. 3rd European Workshop on Petri nets, Varenna (Italy), 1982Google Scholar
  36. |PFI|.
    Languages and Tools for Concurrent and Distributed System, proposal submitted to Italian National Research Council, Progetto Finallizzato Informatica, area 4.2.1, nov. 1987Google Scholar
  37. |Pom|.
    L. Pomello, Some equivalence notions for concurrent systems. An overview, in “Advances in Petri Nets 1985” (G. Rozenberg ed.), LNCS 222, 1986, 381–400CrossRefGoogle Scholar
  38. |Rei1|.
    W. Reisig, Petri Nets with Individual Tokens, TCS 41, North Holland, 1985Google Scholar
  39. |Rei2|.
    W. Reisig, Petri Nets in Software Engineering, in ‘Petri Nets: Applications and Relationships to Other Models of Concurrency“, (W. Brauer, W. Resig, G. Rozemberg eds.), LNCS 254, Springer Verlag, 1987Google Scholar
  40. |Reic|.
    H. Reichel, Behavioural Equivalence - A unifying concept for initial and final specification methods, Proc. 3rd Hungarian Comp. Sci. Conf., Budapest, 1981, 27–39Google Scholar
  41. |ST|.
    D. Sannella, A. Tarlecki, Toward formal development of programs from algebraic specifications: implementations revisited (extended abstract) Proc. TAPSOFT’87, LNCS 249, Springer Verlag,1987, 96–110Google Scholar
  42. |Vau|.
    J. Vautherin, Parallel systems specifications with colored Petri nets and algebraic abstract data types, in “Advances in Petri Nets 87”, (G. Rozemberg ed.), LNCS 266, Springer Verlag, 1987Google Scholar
  43. |Zil|.
    S.N. Zilles, Algebraic specification of data types, Project MAC Progress Report 11, MIT, Cambridge, Mass., 1974,28–52Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1991

Authors and Affiliations

  • E. Battiston
  • F. De Cindio
  • G. Mauri

There are no affiliations available

Personalised recommendations