Pages that link to "Item:Q1098303"
From MaRDI portal
The following pages link to Extensional equivalences for transition systems (Q1098303):
Displaying 45 items.
- A uniform framework for modeling nondeterministic, probabilistic, stochastic, or mixed processes and their behavioral equivalences (Q384933) (← links)
- Partial order semantics for use case and task models (Q539426) (← links)
- A process algebraic view of input/output automata (Q674195) (← links)
- Relational concurrent refinement. III: Traces, partial relations and automata (Q736917) (← links)
- Relating fair testing and accordance for service replaceability (Q974133) (← links)
- (Bi)simulations up-to characterise process semantics (Q1012122) (← links)
- Stable families of behavioural equivalences (Q1119013) (← links)
- Concurrency and atomicity (Q1124366) (← links)
- The equivalence in the DCP model (Q1177152) (← links)
- Specification styles in distributed systems design and verification (Q1177943) (← links)
- Minimizing the number of transitions with respect to observation equivalence (Q1182610) (← links)
- The chemical abstract machine (Q1190491) (← links)
- Complete sets of axioms for finite basic LOTOS behavioural equivalences (Q1199556) (← links)
- Enriched categorical semantics for distributed calculi (Q1208210) (← links)
- Failure-equivalent transformation of transition systems to avoid internal actions (Q1209375) (← links)
- Reasoning about nondeterministic and concurrent actions: A process algebra approach (Q1277769) (← links)
- Basic observables for processes (Q1286368) (← links)
- On the operational semantics of nondeterminism and divergence (Q1350504) (← links)
- Quiescence, fairness, testing, and the notion of implementation (Q1376423) (← links)
- Faster asynchronous systems. (Q1401952) (← links)
- Finite axiom systems for testing preorder and De Simone process languages (Q1575273) (← links)
- A hierarchy of failures-based models: theory and application (Q1763727) (← links)
- Compositional refinements in multiple blackboard systems (Q1899098) (← links)
- On simulation, subtyping and substitutability in sequential object systems (Q1906038) (← links)
- Temporal-logic property preservation under Z refinement (Q1941860) (← links)
- Probabilistic may/must testing: retaining probabilities by restricted schedulers (Q1941883) (← links)
- Testing equivalences of time Petri nets (Q2217206) (← links)
- Relating strong behavioral equivalences for processes with nondeterminism and probabilities (Q2253178) (← links)
- A trace-based service semantics guaranteeing deadlock freedom (Q2428498) (← links)
- On testing UML statecharts (Q2500697) (← links)
- Processes as formal power series: a coinductive approach to denotational semantics (Q2503337) (← links)
- Simulations Up-to and Canonical Preorders (Q2871827) (← links)
- Logical Dynamics of Evidence (Q3093993) (← links)
- REASONING WITH PROTOCOLS UNDER IMPERFECT INFORMATION (Q3096821) (← links)
- Abstraction and Abstraction Refinement (Q3176371) (← links)
- Global Protocol Implementations via Attribute-Based Communication (Q3460871) (← links)
- Model-Based Testing of Environmental Conformance of Components (Q3525108) (← links)
- Modelling Divergence in Relational Concurrent Refinement (Q3605466) (← links)
- Divergence and fair testing (Q4645218) (← links)
- Testability of a communicating system through an environment (Q5044760) (← links)
- An algebraic framework for developing and maintaining real-time systems (Q5096395) (← links)
- Model-Based Testing (Q5175779) (← links)
- Testing preorders for probabilistic processes (Q5204359) (← links)
- More Relational Concurrent Refinement: Traces and Partial Relations (Q5403469) (← links)
- Algebraic characterizations of trace and decorated trace equivalences over tree-like structures (Q5940926) (← links)
