An Algebra of Processes

Abstract A process concept is introduced similar to that of Staples and Nguyen (Theoret. Comp. Sci. 26 (1983), 343–353), but more general. Processes are represented by the sets of scenarios they areable to realize. They communicate via shared places. A partial order of processess and some operations of combining processes similar to those of Milner (Lecture Notes in Comp. Sci. 93 (1980)) are defined. The partially ordered set of processes is a complete lattice. The operations preserve least upper bounds.

[1]  Józef Winkowski,et al.  Behaviours of Concurrent Systems , 1980, Theor. Comput. Sci..

[2]  Antoni W. Mazurkiewicz.  Semantics of concurrent systems: a modular fixed-point trace approach , 1984, European Workshop on Applications and Theory in Petri Nets.

[3]  Andrea Maggiolo-Schettini,et al.  Processes of Transforming Structures , 1982, J. Comput. Syst. Sci..

[4]  Józef Winkowski.  An Algebraic Description of System Behaviours , 1982, Theor. Comput. Sci..

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

[6]  William B. Ackerman,et al.  Scenarios: A Model of Non-Determinate Computation , 1981, ICFPC.

[7]  Kurt Lautenbach,et al.  Elements of General Net Theory , 1979, Advanced Course: Net Theory and Applications.

[8]  César Fernández.  Non-sequential Processes , 1986, Advances in Petri Nets.

[9]  John Staples,et al.  Computing the Behaviour of Asynchronous Processes , 1983, Theor. Comput. Sci..

[10]  Glynn Winskel,et al.  Event Structure Semantics for CCS and Related Languages , 1982, ICALP.

[11]  Gilles Kahn,et al.  The Semantics of a Simple Language for Parallel Programming , 1974, IFIP Congress.

[12]  C. A. R. Hoare,et al.  Communicating Sequential Processes (Reprint) , 1983, Commun. ACM.