Strong splitting bisimulation equivalence
| Authors | |
|---|---|
| Publication date | 2005 |
| Host editors |
|
| Book title | Algebra and Coalgebra in Computer Science |
| Book subtitle | First International Conference, CALCO 2005, Swansea, UK, September 3-6, 2005. Proceedings |
| ISBN |
|
| ISBN (electronic) |
|
| Series | Lecture Notes in Computer Science |
| Pages (from-to) | 85-99 |
| Publisher | Berlin: Springer |
| Organisations |
|
| Abstract |
We present ACP c , a
process algebra with conditional expressions in which the conditions are
taken from a Boolean algebra, and extensions of this process algebra
with mechanisms for condition evaluation. We confine ourselves to
finitely branching processes. This restriction makes it possible to
present c in a concise
and intuitively clear way, and to bring the notion of splitting
bisimulation equivalence and the issue of condition evaluation in
process algebras with conditional expressions to the forefront.
|
| Document type | Conference contribution |
| Language | English |
| Published at | https://doi.org/10.1007/11548133_6 |
| Permalink to this page | |
