Paper Info
Title
Splitting bisimulations and retrospective conditions
Abstract
We investigate conditional expressions in the setting of ACP, an algebraic theory about processes. We introduce ACPc, an extension of ACP with conditional expressions in which the conditions are taken from a free Boolean algebra over a set of generators, and also its main models, called full splitting bisimilation models. We add two simple mechanisms for condition evaluation to ACPc; and we show their connection with state operators and signal emission, mechanisms from other extensions of ACP usable for condition evaluation. To allow for looking back on conditions under which preceding actions have been performed, we add a retrospection operator on conditions to ACPc. The choice of conditions forces us to introduce a new variant of bisimulation. However, without the generality implied by that choice, it would not have been possible to extend ACPc with retrospection. The addition of retrospection is a basic way to increase expressiveness.
Year
DOI
Venue
2006
10.1016/j.ic.2006.03.003
Inf. Comput.
Keywords
Field
DocType
process algebra,main model,splitting bisimulation,conditions force,boolean algebras.,signal emission,algebraic theory,acp usable,full splitting bisimilation model,retrospection operator,state operators,conditional expression,free boolean algebra,retrospective conditions,condition evaluation,splitting bisimulations,guarded commands,state opera- tors,boolean algebras,new variant,conditional transition systems,retrospective condition,parallel processing,operating system,boolean algebra
Discrete mathematics,Algebra,Expression (mathematics),Computer science,Bisimulation,Operator (computer programming),Boolean algebra,Algebraic theory,Process calculus,Generality,Free Boolean algebra
Journal
Volume
Issue
ISSN
204
7
Information and Computation
Citations 
PageRank 
References 
16
0.83
20
Authors
2
Name
Order
Citations
PageRank
Jan A. Bergstra11445140.42
Cornelis A. Middelburg248749.21