Weak Sequential Composition in Process Algebras (1994)
| Venue: | CONCUR'94: Concurrency Theory, volume 836 of Lecture Notes in Computer Science |
BibTeX
@INPROCEEDINGS{And94weaksequential,
author = {Arend Rensink And and Arend Rensink and Heike Wehrheim},
title = {Weak Sequential Composition in Process Algebras},
booktitle = {CONCUR'94: Concurrency Theory, volume 836 of Lecture Notes in Computer Science},
year = {1994},
pages = {226--241},
publisher = {Springer-Verlag}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
. 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. We give a structural operational semantics for a process algebraic language containing such a sequential composition operator, which shows some interesting interplay with choice. We give a complete axiomatisation of strong bisimilarity and we show consistency of the operational semantics with an event-based denotational semantics developed recently by the second author. The axiom system allows to derive the communication closed layers law, which in the linear time setting has been sho...
Keyphrases
process algebra weak sequential composition strong bisimilarity layer law linear-time setting dependency relation process algebraic language operational semantics common resource special operator sequential composition operator linear time setting structural operational semantics event-based denotational semantics second author sequential composition interesting interplay complete axiomatisation systematic investigation axiom system
