Testing equivalence as a bisimulation equivalence (Q2366163): Difference between revisions
From MaRDI portal
Changed an Item |
Set profile property. |
||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank |
Revision as of 06:52, 5 March 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
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