High Level Distributed Transition Systems

  • Nisse Husberg
Conference paper
Part of the Workshops in Computing book series (WORKSHOPS COMP.)


A high level distributed transition system is defined as a diagram which is the basis of a heterogeneous algebraic theory seen as a category. The support structure can be defined as another heterogeneous algebraic theory. The behaviour is a diagram in the same category. This approach is close to both Petri net theory and the initial algebra semantics of programming languages.


Transition System Proper Operator Category Theory Algebraic Theory Extended Operator 
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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Bednarczyk MA. Categories of Asynchronous Systems. PhD thesis, University of Sussex, October 1987Google Scholar
  2. 2.
    Billington J. Many-Sorted High Level Nets. In: Proc. 3rd Workshop on Petri Nets and Performance Models, Kyoto 11–13 December 1989. IEEE CS Press, Washington, 1989, pp 166–179Google Scholar
  3. 3.
    Bloom SL, Wagner EG. Many-Sorted Theories and their Algebras with Some Applications to Data Types. In: Nivat M, Reynolds JC (eds) Algebraic Methods in Semantics. Cambridge University Press, 1985, pp 133–168Google Scholar
  4. 4.
    Genrich HJ. Predicate/Transition Nets. In: Brauer W, Reisig W, Rozenberg G (eds) Advances in Petri Nets 1986, Part I, Bad Honnef. Springer-Verlag, Berlin, 1986, pp 207–247 (Lecture notes in computer science vol. 254)Google Scholar
  5. 5.
    Goguen JA. Correctness and Equivalence of Data Types. In: Int. Symp. of Mathematical Systems Theory, Udine 1975. Springer-Verlag, Berlin, 1976, pp 352–358 (Lecture notes in economics and mathematical systems vol. 131)Google Scholar
  6. 6.
    Goguen JA. Abstract Errors for Abstract Data Types. In: Neuhold EJ (ed) Formal Descriptions of Programming Concepts. North-Holland, 1978, pp 491–522Google Scholar
  7. 7.
    Goguen JA, Burstall R. Some Fundamental Properties of Algebraic Theories: A Tool for Semantics of Computation. D.A.I. Research Report No. 53, July 1978Google Scholar
  8. 8.
    Goguen JA, Thatcher JW, Wagner EG, Wright JB. An Introduction to Categories, Algebraic Theories and Algebras. IBM Report RC-5369, Yorktown Heights, New York, 1975Google Scholar
  9. 9.
    Goguen JA, Thatcher JW, Wagner EG, Wright JB. Initial Algebra Semantics and Continous Algebras. J. Assoc. Comput. Mach. 1977; 24: 68–95MATHCrossRefGoogle Scholar
  10. 10.
    Goltz U. Considering Nets as Distributed Transition Systems. Petri Net Newsletter June 1985; 21: 10–19Google Scholar
  11. 11.
    Husberg N. Categorial Heterogeneous Algebraic Models of Programming Languages. DAIMI PB-163, Computer Science Department, Aarhus University, 1983Google Scholar
  12. 12.
    Husberg N. Petri Nets in Algebraic Theories - a Category Theory Approach. Technical Report No. B5, Digital Systems Laboratory, Helsinki University of Technology, June 1988Google Scholar
  13. 13.
    Husberg N. A Category of Distributed Transition Systems. Research Report No. A10, Digital Systems Laboratory, Helsinki University of Technology, May 1989Google Scholar
  14. 14.
    Keller RM. Formal Verification of Parallel Programs. Comm. Assoc. Comput. Mach. July 1976; 19: 371–384MATHGoogle Scholar
  15. 15.
    Lawvere FW. Functional semantics of algebraic theories. Proc. Nat. Acad. Sci. 1963; 50: 869–872MathSciNetMATHCrossRefGoogle Scholar
  16. 16.
    Lien YE. A Note on Transition Systems. Information Sciences 1976; 10: 347–362MathSciNetMATHCrossRefGoogle Scholar
  17. 17.
    Meseguer J, Montanari U. Petri Nets Are Monoids: A New Algebraic Foundation for Net Theory. In: Proc. Symp. on Logic in Computer Science, Edinburgh 5–8 July 1988. IEEE CS Press, Washington, 1988, pp 155–164Google Scholar
  18. 18.
    Monro GP. The Concept of Multiset. Zeitschr. f. math. Logik und Grundlagen d. Math. 1987; 33: 171–178MathSciNetMATHGoogle Scholar
  19. 19.
    Pareigis B. Categories and Functors. Academic Press, New York, 1970MATHGoogle Scholar
  20. 20.
    Reisig W. Das Verhalten verteilter Systeme. GMD-Bericht Nr. 170, Bonn, 1987Google Scholar
  21. 21.
    Reisig W, Vautherin J. An Algebraic Approach to High Level Petri Nets. In: Proc. 8th Workshop on Application and Theory of Petri Nets, Zaragoza, Spain 24–26 June 1987. 1987, pp 51–72Google Scholar
  22. 22.
    Wagner EG. Algebraic theories, Data Types, and Control Constructs. Fundamenta Informaticae 1986; IX: 343–370Google Scholar
  23. 23.
    Winskel G. Petri Nets, Algebras and Morphisms. Technical Report 79, Computer Laboratory, University of Cambridge, 1985Google Scholar
  24. 24.
    Winskel G. A Category of Labelled Petri Nets and Compositional Proof System. In: Proc. Symp. on Logic in Computer Science, Edinburgh 5–8 July 1988. IEEE CS Press, Washington, 1988, pp 142–154Google Scholar
  25. 25.
    Zamfir-Bleyberg M. Petri Nets: An Initial Semantics Approach (part I). Report TR-CS-88–1, Kansas State University, 1988Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1990

Authors and Affiliations

  • Nisse Husberg
    • 1
  1. 1.Digital Systems Laboratory, Department of Computer ScienceHelsinki University of TechnologyEsboFinland

Personalised recommendations