Pages that link to "Item:Q1348526"
From MaRDI portal
The following pages link to Testing equivalences for processes (Q1348526):
Displayed 50 items.
- A randomized encoding of the \(\pi\)-calculus with mixed choice (Q555750) (← links)
- Measuring the confinement of probabilistic systems (Q557887) (← links)
- Modal logics for communicating systems (Q578896) (← links)
- Step failures semantics and a complete proof system (Q582133) (← links)
- Bisimulation on speed: Worst-case efficiency (Q598200) (← links)
- Modelling causality via action dependencies in branching time semantics (Q671596) (← links)
- Deciding observational congruence of finite-state CCS expressions by rewriting (Q673974) (← links)
- Universal axioms for bisimulations (Q685411) (← links)
- A logical view of composition (Q685416) (← links)
- Priorities in process algebras (Q802881) (← links)
- Performance of pipelined asynchronous systems (Q864507) (← links)
- Fair testing (Q865623) (← links)
- Conjunction on processes: Full abstraction via ready-tree semantics (Q875513) (← links)
- SOS formats and meta-theory: 20 years after (Q877025) (← links)
- A partial ordering semantics for CCS (Q914400) (← links)
- CCS expressions, finite state processes, and three problems of equivalence (Q918211) (← links)
- Formalization of test experiments (Q927449) (← links)
- Bisimulations in calculi modelling membranes (Q939161) (← links)
- Automatic verification of distributed systems: the process algebra approach. (Q960505) (← links)
- Revivals, stuckness and the hierarchy of CSP models (Q1007236) (← links)
- Generating priority rewrite systems for OSOS process languages (Q1012121) (← links)
- Abstract interface behavior of object-oriented languages with monitors (Q1015384) (← links)
- Mutation testing in UTP (Q1019021) (← links)
- Quantifying information leakage in process calculi (Q1023286) (← links)
- Specification-oriented semantics for communicating processes (Q1060838) (← links)
- An algebraic theory of fair asynchronous communicating processes (Q1088403) (← links)
- A context dependent equivalence between processes (Q1088404) (← links)
- On observational equivalence and algebraic specification (Q1089796) (← links)
- Toward formal development of programs from algebraic specifications: Implementations revisited (Q1090100) (← links)
- Infinite streams and finite observations in the semantics of uniform concurrency (Q1091800) (← links)
- An introduction to the regular theory of fairness (Q1102102) (← links)
- A distributed operational semantics of CCS based on condition/event systems (Q1110338) (← links)
- Concurrent transition systems (Q1119395) (← links)
- Type theory and concurrency (Q1124322) (← links)
- Concurrency and atomicity (Q1124366) (← links)
- A process algebraic view of Linda coordination primitives (Q1127512) (← links)
- Bisimulation through probabilistic testing (Q1175940) (← links)
- Correctness of concurrent processes (Q1176236) (← links)
- The equivalence in the DCP model (Q1177152) (← links)
- Specification styles in distributed systems design and verification (Q1177943) (← links)
- The chemical abstract machine (Q1190491) (← links)
- Observational structures and their logic (Q1190494) (← links)
- Proof systems for infinite behaviours (Q1193598) (← links)
- Experimenting with process equivalence (Q1194327) (← links)
- Structured operational semantics and bisimulation as a congruence (Q1198952) (← links)
- Complete sets of axioms for finite basic LOTOS behavioural equivalences (Q1199556) (← links)
- Enriched categorical semantics for distributed calculi (Q1208210) (← links)
- Unique decomposition of processes (Q1208422) (← links)
- TIC: a tImed calculus (Q1261314) (← links)
- LOTOS extended with probabilistic behaviours (Q1261318) (← links)