Pages that link to "Item:Q1348526"
From MaRDI portal
The following pages link to Testing equivalences for processes (Q1348526):
Displayed 50 items.
- 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)
- Process languages with discrete relative time based on the ordered SOS format and rooted eager bisimulation (Q1878718) (← links)
- Tau laws for pi calculus (Q1884877) (← links)
- Asynchronous communication model based on linear logic (Q1898813) (← links)
- Concurrent testing of processes (Q1902297) (← links)
- Compositional failure-based semantic models for basic LOTOS (Q1903079) (← links)
- Composition methods for constructing characteristic formulas for dense-time models (Q1938922) (← links)
- Temporal-logic property preservation under Z refinement (Q1941860) (← links)
- Characterisations of testing preorders for a finite probabilistic \(\pi\)-calculus (Q1941882) (← links)
- Probabilistic may/must testing: retaining probabilities by restricted schedulers (Q1941883) (← links)
- Towards a unified approach to encodability and separation results for process calculi (Q1959439) (← links)
- Deciding bisimilarity and similarity for probabilistic processes. (Q1975973) (← links)
- Process calculi as a tool for studying coordination, contracts and session types (Q1987732) (← links)
- The metric linear-time branching-time spectrum on nondeterministic probabilistic processes (Q1989321) (← links)
- Ensuring liveness properties of distributed systems: open problems (Q2011206) (← links)
- A fixed-points based framework for compliance of behavioural contracts (Q2035654) (← links)
- A theory of monitors (Q2051767) (← links)
- Processes against tests: on defining contextual equivalences (Q2079681) (← links)
- A linear-time branching-time perspective on interface automata (Q2182669) (← links)
- On the computation of counterexamples in compositional nonblocking verification (Q2197583) (← links)
- Contextual equivalence for signal flow graphs (Q2200814) (← links)
- Distributability of mobile ambients (Q2216122) (← links)
- Testing equivalences of time Petri nets (Q2217206) (← links)
- Fair refinement for asynchronous session types (Q2233400) (← links)
- An abstract framework for choreographic testing (Q2239278) (← links)
- Relating strong behavioral equivalences for processes with nondeterminism and probabilities (Q2253178) (← links)
- A calculus of branching processes (Q2286743) (← links)
- Observational program calculi and the correctness of translations (Q2339472) (← links)
- Hierarchical modelling of manufacturing systems using discrete event systems and the conflict preorder (Q2348366) (← links)
- Refinement-oriented probability for CSP (Q2365393) (← links)
- Testing equivalence as a bisimulation equivalence (Q2366163) (← links)
- Specification, testing and implementation relations for symbolic-probabilistic systems (Q2368993) (← links)