Pages that link to "Item:Q1348526"
From MaRDI portal
The following pages link to Testing equivalences for processes (Q1348526):
Displaying 50 items.
- 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)
- Trace, failure and testing equivalences for communicating processes (Q1104076) (← 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)
- Liveness in timed and untimed systems (Q1271471) (← links)
- An invitation to friendly testing (Q1273070) (← links)
- On performance congruences for process algebras (Q1275822) (← links)
- On the expressiveness of internal mobility in name-passing calculi (Q1276243) (← links)
- A calculus for cryptographic protocols: The spi calculus (Q1283776) (← links)
- Exact performance equivalence: An equivalence relation for stochastic automata (Q1285589) (← links)
- A behavioural theory of first-order CML (Q1285654) (← links)
- Basic observables for processes (Q1286368) (← links)
- On deciding trace equivalences for processes (Q1310916) (← links)
- An exercise in the automatic verification of asynchronous designs (Q1329086) (← links)
- A fully abstract trace model for dataflow and asynchronous networks (Q1333374) (← links)
- When is partial trace equivalence adequate? (Q1333407) (← links)
- On reduction-based process semantics (Q1350347) (← links)
- On the operational semantics of nondeterminism and divergence (Q1350504) (← links)
- Quiescence, fairness, testing, and the notion of implementation (Q1376423) (← links)
- Essential concepts of algebraic specification and program development (Q1377322) (← links)
- Composition and behaviors of probabilistic I/O automata (Q1392272) (← links)
- Semantics for finite delay (Q1392281) (← links)
- The power of reachability testing for timed automata (Q1399974) (← links)
