Stable families of behavioural equivalences (Q1119013): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
RedirectionBot (talk | contribs)
Removed claim: reviewed by (P1447): Item:Q795512
Property / reviewed by
 
Property / reviewed by: Matthias Jantzen / rank
Normal rank
 

Revision as of 05:27, 21 February 2024

scientific article
Language Label Description Also known as
English
Stable families of behavioural equivalences
scientific article

    Statements

    Stable families of behavioural equivalences (English)
    0 references
    0 references
    1989
    0 references
    Notions of behavioural equivalence, as defined for general transition systems, are compared and studied with an emphasis on relations between transition systems and quotient systems. The notion of stable relations is introduced and it is shown that regular trace logic, propositional dynamic logic, Hennessey-Milner logic, and full trace logic are stable families.
    0 references
    0 references
    0 references
    0 references
    0 references
    bisimulation
    0 references
    preorders
    0 references
    behavioural equivalence
    0 references
    transition systems
    0 references
    regular trace logic
    0 references