### Abstract

This paper gives an equational axiomatization of probabilistic bisimulation equivalence for a class of finite-state agents previously studied by Stark and Smolka ((2000) Proof, Language, and Interaction: Essays in Honour of Robin Milner, pp. 571–595). The axiomatization is obtained by extending the general axioms of iteration theories (or iteration algebras), which characterize, among others, the equational properties of the fixed point operator on (ω-)continuous or monotonic functions, with three axiom schemas that express laws that are specific to probabilistic bisimilarity. Hence probabilistic bisimilarity (over finite-state agents) has an equational axiomatization relative to iteration algebras.

Original language | English |
---|---|

Title of host publication | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |

Publisher | Springer Verlag |

Pages | 239-254 |

Number of pages | 16 |

Volume | 2422 |

ISBN (Print) | 9783540441441 |

Publication status | Published - 2002 |

Event | 9th International Conference on Algebraic Methodology and SoftwareTechnology, AMAST 2002 - Reunion Island, Saint-Gilles-les-Bains, France Duration: Sep 9 2002 → Sep 13 2002 |

### Publication series

Name | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
---|---|

Volume | 2422 |

ISSN (Print) | 03029743 |

ISSN (Electronic) | 16113349 |

### Other

Other | 9th International Conference on Algebraic Methodology and SoftwareTechnology, AMAST 2002 |
---|---|

Country | France |

City | Reunion Island, Saint-Gilles-les-Bains |

Period | 9/9/02 → 9/13/02 |

### Fingerprint

### ASJC Scopus subject areas

- Computer Science(all)
- Theoretical Computer Science

### Cite this

*Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)*(Vol. 2422, pp. 239-254). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 2422). Springer Verlag.

**Equational axioms for probabilistic bisimilarity.** / Aceto, Luca; Ésik, Z.; Ingólfsdóttir, Anna.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

*Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics).*vol. 2422, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 2422, Springer Verlag, pp. 239-254, 9th International Conference on Algebraic Methodology and SoftwareTechnology, AMAST 2002, Reunion Island, Saint-Gilles-les-Bains, France, 9/9/02.

}

TY - GEN

T1 - Equational axioms for probabilistic bisimilarity

AU - Aceto, Luca

AU - Ésik, Z.

AU - Ingólfsdóttir, Anna

PY - 2002

Y1 - 2002

N2 - This paper gives an equational axiomatization of probabilistic bisimulation equivalence for a class of finite-state agents previously studied by Stark and Smolka ((2000) Proof, Language, and Interaction: Essays in Honour of Robin Milner, pp. 571–595). The axiomatization is obtained by extending the general axioms of iteration theories (or iteration algebras), which characterize, among others, the equational properties of the fixed point operator on (ω-)continuous or monotonic functions, with three axiom schemas that express laws that are specific to probabilistic bisimilarity. Hence probabilistic bisimilarity (over finite-state agents) has an equational axiomatization relative to iteration algebras.

AB - This paper gives an equational axiomatization of probabilistic bisimulation equivalence for a class of finite-state agents previously studied by Stark and Smolka ((2000) Proof, Language, and Interaction: Essays in Honour of Robin Milner, pp. 571–595). The axiomatization is obtained by extending the general axioms of iteration theories (or iteration algebras), which characterize, among others, the equational properties of the fixed point operator on (ω-)continuous or monotonic functions, with three axiom schemas that express laws that are specific to probabilistic bisimilarity. Hence probabilistic bisimilarity (over finite-state agents) has an equational axiomatization relative to iteration algebras.

UR - http://www.scopus.com/inward/record.url?scp=84944074568&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84944074568&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:84944074568

SN - 9783540441441

VL - 2422

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 239

EP - 254

BT - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

PB - Springer Verlag

ER -