Pages that link to "Item:Q1903079"
From MaRDI portal
The following pages link to Compositional failure-based semantic models for basic LOTOS (Q1903079):
Displayed 12 items.
- Contexts, refinement and determinism (Q541213) (← links)
- The weakest deadlock-preserving congruence (Q673911) (← links)
- Stepwise development of process-algebraic specifications in decorated trace semantics (Q816202) (← links)
- Fair testing (Q865623) (← links)
- Relational concurrent refinement. II: Internal operations and outputs (Q1019018) (← links)
- All congruences below stability-preserving fair testing or CFFD (Q2182664) (← links)
- On constructibility and unconstructibility of LTS operators from other LTS operators (Q2340256) (← links)
- Compositional Failure-based Equivalence of Constraint Automata (Q2810975) (← links)
- A Logical Process Calculus (Q2842601) (← links)
- Failure-based equivalence of constraint automata (Q3056378) (← links)
- Compositionality in state space verification methods (Q4633153) (← links)
- General Refinement, Part One: Interfaces, Determinism and Special Refinement (Q5403470) (← links)