Stable families of behavioural equivalences (Q1119013)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Stable families of behavioural equivalences |
scientific article; zbMATH DE number 4096764
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Stable families of behavioural equivalences |
scientific article; zbMATH DE number 4096764 |
Statements
Stable families of behavioural equivalences (English)
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
bisimulation
0 references
preorders
0 references
behavioural equivalence
0 references
transition systems
0 references
regular trace logic
0 references
0 references
0.8541863
0 references
0.85268486
0 references
0.84197366
0 references
0.8376319
0 references
0.8318698
0 references
0 references
0.8289267
0 references
0.82800084
0 references