Università di Pisa
Sistema bibliotecario di ateneo

Symbolic Equivalences for Open Systems

Baldan, Paolo and Bracciali, Andrea and Bruni, Roberto (2003) Symbolic Equivalences for Open Systems. Technical Report del Dipartimento di Informatica . Università di Pisa, Pisa, IT.

[img] Postscript (GZip) - Published Version
Available under License Creative Commons Attribution No Derivatives.

Download (164Kb)


    Behavioural equivalences on open systems are usually defined by comparing system behaviour in all environments. Here, we introduce a hierarchy of behavioural equivalences for open systems in the setting of process calculi, building on a symbolic approach proposed in a previous paper. The hierarchy comprises both branching, bisimulation-based, and non-branching, trace-based, equivalences. Symbolic equivalences are amenable to effective analysis techniques (e.g., the symbolic transition system is finitely branching under mild assumptions), which result to be correct, but often not complete due to redundant information. Two kinds of redundancy, syntactic and semantic, are discussed and one class of symbolic equivalences is identified that deals satisfactorily with syntactic redundant transitions, which are a primary source of incompleteness.

    Item Type: Book
    Uncontrolled Keywords: open systems, bisimilarity, trace semantics
    Subjects: Area01 - Scienze matematiche e informatiche > INF/01 - Informatica
    Divisions: Dipartimenti (until 2012) > DIPARTIMENTO DI INFORMATICA
    Depositing User: dott.ssa Sandra Faita
    Date Deposited: 17 Dec 2014 16:37
    Last Modified: 17 Dec 2014 16:37
    URI: http://eprints.adm.unipi.it/id/eprint/2103

    Repository staff only actions

    View Item