Observational trees as models for concurrency

Given an automaton, its behaviour can be modelled as the sets of strings over an alphabet A that can be accepted from any of its states. When considering concurrent systems, we can see a concurrent agent as an automaton, where non-determinism derives from the fact that its states can offer a different behaviour at different moments in time. Non-deterministic computations between a pair of states can then no longer be described as a ‘set’ of strings in a free monoid. Consequently, between two states we will have a labelled structured set of computations, where the structure describes the possibility of two computations parting from each other while maintaining the same observable steps. In this paper, we shall consider different kinds of observation domains and related structured sets of computations. Structured sets of computations will be organised as a category of generalised trees built over a meet-semilattice monoid formalizing the observation domain. Theorems allowing us to introduce the usual concurrency operators in the models and relating different models will then be obtained by first considering ordinary functors (on and between the observation domains), and then lifting them to the categories of structured sets of computations.

[1]  Jan A. Bergstra,et al.  Algebra of Communicating Processes with Abstraction , 1985, Theor. Comput. Sci..

[2]  Dexter Kozen.  A Completeness Theorem for Kleene Algebras and the Algebra of Regular Events , 1994, Inf. Comput..

[3]  J. Benabou.  Introduction to bicategories , 1967 .

[4]  Glynn Winskel,et al.  Petri Nets, Event Structures and Domains , 1979, Semantics of Concurrent Computation.

[5]  Joseph A. Goguen,et al.  On Homomorphisms, Correctness, Termination, Unfoldments, and Equivalence of Flow Diagram Programs , 1974, J. Comput. Syst. Sci..

[6]  Anna Labella,et al.  Process synchronisation as fusion , 1996, Appl. Categorical Struct..

[7]  J.J.M.M. Rutten.  Explicit canonical representatives for weak bisimulation equivalence and congruence , 1990 .

[8]  Jan A. Bergstra,et al.  Failures without chaos: a new process semantics for fair abstraction , 1987, Formal Description of Programming Concepts.

[9]  Anna Labella,et al.  Enriched categorial semantics for distributed calculi , 1992 .

[10]  Antoni W. Mazurkiewicz,et al.  Trace Theory , 1986, Advances in Petri Nets.

[11]  Robin Milner,et al.  A Calculus of Communicating Systems , 1980, Lecture Notes in Computer Science.

[12]  Rocco De Nicola,et al.  A Completeness Theorem fro Nondeterministic Kleene Algebras , 1994, MFCS.

[13]  Luca Aceto,et al.  Termination, deadlock, and divergence , 1992, JACM.

[14]  Rocco De Nicola,et al.  Tree Morphisms and Bisimulations , 1998, Electron. Notes Theor. Comput. Sci..

[15]  Gordon D. Plotkin,et al.  The category-theoretic solution of recursive domain equations , 1977, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977).

[16]  David Park,et al.  Concurrency and Automata on Infinite Sequences , 1981, Theoretical Computer Science.

[17]  Anna Labella,et al.  On Continuous Time Agents , 1991, MFPS.

[18]  Glynn Winskel,et al.  Event Structures , 1986, Advances in Petri Nets.

[19]  Ugo Montanari,et al.  Concurrent Histories: A Basis for Observing Distributed Systems , 1987, J. Comput. Syst. Sci..

[20]  Marek Antoni Bednarczyk,et al.  Categories of asynchronous systems , 1987 .

[21]  Ugo Montanari,et al.  Labeled Event Structures: A Model for Observable Concurrency , 1982, Formal Description of Programming Concepts.

[22]  Ross Street,et al.  Variation through enrichment , 1983 .

[23]  Robin Milner,et al.  Calculi for Synchrony and Asynchrony , 1983, Theor. Comput. Sci..

[24]  Alberto Pettorossi,et al.  Enriched Categories for Local and Interaction Calculi , 1987, Category Theory and Computer Science.

[25]  Mogens Nielsen,et al.  Models for Concurrency , 1992 .

[26]  F. William Lawvere,et al.  Metric spaces, generalized logic, and closed categories , 1973 .

[27]  Wolfgang Reisig.  Petri Nets: An Introduction , 1985, EATCS Monographs on Theoretical Computer Science.

[28]  Jan A. Bergstra,et al.  Process theory based on bisimulation semantics , 1988, REX Workshop.

[29]  Rocco De Nicola,et al.  Fully Abstract Models for Nondeterministic Regular Expressions , 1995, CONCUR.

[30]  Rocco De Nicola,et al.  Observation Trees , 1992, NAPAW.

[31]  Luca Cardelli,et al.  Real Time Agents , 1982, International Colloquium on Automata, Languages and Programming.

[32]  J. Gray.  Fibred and Cofibred Categories , 1966 .

[33]  Jerzy Tiuryn,et al.  Fixed Points in Free Process Algebras, Part II , 1990, Theor. Comput. Sci..