Testing equivalence as a bisimulation equivalence (Q2366163)

From MaRDI portal
Revision as of 17:08, 17 May 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Testing equivalence as a bisimulation equivalence
scientific article

    Statements

    Testing equivalence as a bisimulation equivalence (English)
    0 references
    0 references
    0 references
    29 June 1993
    0 references
    Algorithms for checking the various testing preorders and equivalences for finite-state processes are presented. It is shown that (pre)bisimulation-based characterization of these relations relies on the use of appropriate process transformations; the testing relations on the original systems correspond to (pre)bisimulation relations on the altered systems. As a consequence of approach presented, any implementation of a (pre)bisimulation checker can be easily adapted to check for the testing relations. An extended example illustrating these concepts is given.
    0 references
    process algebras
    0 references
    finite-state systems
    0 references
    automated verification
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references