Università di Pisa
Sistema bibliotecario di ateneo

Minimization Algorithm for Symbolic Bisimilarity

Bonchi, Filippo and Montanari, Ugo (2008) Minimization Algorithm for Symbolic Bisimilarity. Technical Report del Dipartimento di Informatica . Università di Pisa, Pisa, IT.

[img] Other (GZip)
Available under License Creative Commons Attribution No Derivatives.

Download (379Kb)


    The operational semantics of interactive systems is usually decsribed by labeled transition systems. Abstract semantics is defined in terms of bisimilarity, that in the finite case, can be computed via the well-known partition refinement algorithm. However, the behavoiur of interactive systems is in many case infinite and thus checking bisimilarity in this way is unfeasible. Symbolic semantics allows to define smaller, possibly finite, transition systems, by employing symbolic actions and avoiding some source of infiniteness. Unfortunately, the standard partition refinement algorithm does not work with symbolic bisimilarity. In a previous paper, we have introduced an abstract theory of symbolic semantics. In this paper, we introduce a partition refinement algorithm for symbolic bisimilarity.

    Item Type: Book
    Uncontrolled Keywords: Symbolic Semantics, Bisimilarity, Partition Refinement
    Subjects: Area01 - Scienze matematiche e informatiche > INF/01 - Informatica
    Divisions: Dipartimenti (until 2012) > DIPARTIMENTO DI INFORMATICA
    Depositing User: dott.ssa Sandra Faita
    Date Deposited: 04 Dec 2014 14:31
    Last Modified: 04 Dec 2014 14:31
    URI: http://eprints.adm.unipi.it/id/eprint/2220

    Repository staff only actions

    View Item