Pages that link to "Item:Q1348526"
From MaRDI portal
The following pages link to Testing equivalences for processes (Q1348526):
Displayed 50 items.
- 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)
- Algebraic theory of probabilistic and nondeterministic processes. (Q1400156) (← links)
- Algebraic theory of probabilistic processes. (Q1400293) (← links)
- Faster asynchronous systems. (Q1401952) (← links)
- Linda-based applicative and imperative process algebras (Q1575260) (← links)
- Finite axiom systems for testing preorder and De Simone process languages (Q1575273) (← links)
- Analysis of equivalence relations of event structures with continuous time (Q1592080) (← links)
- Testing congruence for mobile processes (Q1599646) (← links)
- Testing preorders for probabilistic processes can be characterized by simulations (Q1603706) (← links)
- A fully abstract denotational semantics for the \(\pi\)-calculus (Q1605174) (← links)
- Truly concurrent constraint programming (Q1605181) (← links)
- Impossible futures and determinism (Q1607117) (← links)
- Additive models of probabilistic processes (Q1607220) (← links)
- Efficiency of asynchronous systems, read arcs, and the MUTEX-problem (Q1607225) (← links)
- On the validity of encodings of the synchronous in the asynchronous \(\pi\)-calculus (Q1641151) (← links)
- Probabilistic bisimilarity as testing equivalence (Q1680507) (← links)
- Verification of asynchronous systems with an unspecified component (Q1731830) (← links)
- Unifying behavioral equivalences of timed transition systems (Q1758671) (← links)
- A hierarchy of failures-based models: theory and application (Q1763727) (← links)
- The security pi-calculus and non-interference (Q1772311) (← links)
- A hierarchy of equivalences for asynchronous calculi (Q1772314) (← links)
- A framework for specifying and verifying the behaviour of open systems (Q1779319) (← links)
- Measuring the performance of asynchronous systems with PAFAS (Q1781997) (← links)
- Observational congruences for dynamically reconfigurable tile systems (Q1782000) (← links)
- An axiomatic semantics for \(\mathsf{ioco} \underline{\mathsf{s}}\) conformance relation (Q1785863) (← links)
- Modular specification of process algebras (Q1802074) (← links)
- Performance measure sensitive congruences for Markovian process algebras (Q1853585) (← links)
- A comparison of three authentication properties. (Q1853750) (← links)
- Testing preorders for probabilistic processes. (Q1854314) (← links)
- Vertical implementation (Q1854462) (← links)
- Trace and testing equivalence on asynchronous processes (Q1854499) (← links)
- Secure implementation of channel abstractions (Q1854520) (← links)