BIROn - Birkbeck Institutional Research Online

    Equivalence checking for infinite systems using parameterized boolean equation systems

    Chen, Taolue and Ploeger, B. and van de Pol, J. and Willemse, Tim A.C. (2007) Equivalence checking for infinite systems using parameterized boolean equation systems. In: Caires, L. and Vasconcelos, V.T. (eds.) CONCUR 2007: Concurrency Theory. Lecture Notes in Computer Science 4703. Springer, pp. 120-135. ISBN 9783540744061.

    Full text not available from this repository.

    Abstract

    In this paper, we provide a transformation from the branching bisimulation problem for infinite, concurrent, data-intensive systems in linear process format, into solving Parameterized Boolean Equation Systems. We prove correctness, and illustrate the approach with an unbounded queue example. We also provide some adaptations to obtain similar transformations for weak bisimulation and simulation equivalence.

    Metadata

    Item Type: Book Section
    School: School of Business, Economics & Informatics > Computer Science and Information Systems
    Depositing User: Sarah Hall
    Date Deposited: 09 Feb 2021 17:21
    Last Modified: 09 Feb 2021 17:21
    URI: https://eprints.bbk.ac.uk/id/eprint/42951

    Statistics

    Downloads
    Activity Overview
    0Downloads
    36Hits

    Additional statistics are available via IRStats2.

    Archive Staff Only (login required)

    Edit/View Item Edit/View Item