Stable families of behavioural equivalences (Q1119013): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Q3321470 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Extensional equivalences for transition systems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Determinacy \(\to\) (observation equivalence \(=\) trace equivalence) / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A linear-history semantics for languages for distributed programming / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A Theory of Communicating Sequential Processes / 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 |
Latest revision as of 15:00, 19 June 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
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