Weak Sequential Composition in Process Algebras

In this paper we study a special operator for sequential composition, which is defined relative to a dependency relation over the actions of a given system. The idea is that actions which are not dependent (intuitively because they share no common resources) do not have to wait for one another to proceed, even if they are composed sequentially. Such a notion has been studied before in a linear-time setting, but until recently there has been no systematic investigation in the context of process algebras.

[1]  Frits W. Vaandrager,et al.  Turning SOS Rules into Equations , 1994, Inf. Comput..

[2]  Heike Wehrheim.  Parametric Action Refinement , 1994, PROCOMET.

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

[4]  Arend Rensink.  Models and Methods for Action Refinement , 1993 .

[5]  Albert R. Meyer,et al.  Bisimulation can't be traced , 1988, POPL '88.

[6]  Job Zwiers.  Layering and Action Refinement for Timed Systems , 1991, REX Workshop.

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

[8]  M. W. Shields.  Concurrent Machines , 1985, Comput. J..

[9]  Frits W. Vaandrager,et al.  Expressiveness results for process algebras , 1993 .

[10]  Luca Aceto,et al.  Towards Action-Refinement in Process Algebras , 1993, Inf. Comput..

[11]  Mannes Poel,et al.  Action Systems and Action Refinement in the Development of Parallel Systems - An Algebraic Approach , 1991, CONCUR.

[12]  Grzegorz Rozenberg,et al.  Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency , 1988, Lecture Notes in Computer Science.

[13]  Antoni W. Mazurkiewicz,et al.  Basic notions of trace theory , 1988, REX Workshop.

[14]  Robin Milner,et al.  Communication and concurrency , 1989, PHI Series in computer science.

[15]  C. A. R. Hoare,et al.  Communicating sequential processes , 1978, CACM.

[16]  Eugene W. Stark,et al.  Concurrent Transition Systems , 1989, Theor. Comput. Sci..

[17]  Mannes Poel,et al.  Modular Completeness for Communication Closed Layers , 1993, CONCUR.