Testing equivalence as a bisimulation equivalence (Q2366163): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bisimulation can't be traced / rank
 
Normal rank
Property / cites work
 
Property / cites work: Testing equivalences for processes / rank
 
Normal rank
Property / cites work
 
Property / cites work: A term model for synchronous processes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Acceptance trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3997501 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algebraic laws for nondeterminism and concurrency / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3777424 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3862379 / rank
 
Normal rank
Property / cites work
 
Property / cites work: CCS expressions, finite state processes, and three problems of equivalence / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bisimulation through probabilistic testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: A calculus of communicating systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Calculi for synchrony and asynchrony / rank
 
Normal rank
Property / cites work
 
Property / cites work: Three Partition Refinement Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bisimulation and divergence / rank
 
Normal rank

Latest revision as of 17:08, 17 May 2024

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