Pages that link to "Item:Q1348526"
From MaRDI portal
The following pages link to Testing equivalences for processes (Q1348526):
Displayed 50 items.
- 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)
- Non-bisimulation-based Markovian behavioral equivalences (Q2373649) (← links)
- Priority and abstraction in process algebra (Q2381506) (← links)
- Basic observables for a calculus for global computing (Q2384924) (← links)
- Depletable channels: dynamics, behaviour, and efficiency in network design (Q2422775) (← links)
- A trace-based service semantics guaranteeing deadlock freedom (Q2428498) (← links)
- Real-reward testing for probabilistic processes (Q2453107) (← links)
- Axiomatizing weak simulation semantics over BCCSP (Q2453533) (← links)
- A framework for analyzing probabilistic protocols and its application to the partial secrets exchange (Q2463563) (← links)
- Separation of synchronous and asynchronous communication via testing (Q2465029) (← links)
- Compositional synthesis of maximally permissive supervisors using supervision equivalence (Q2465421) (← links)
- A process algebraic view of shared dataspace coordination (Q2474048) (← links)
- Fairness of actions in system computations (Q2502272) (← links)
- Bisimulation on speed: a unified approach (Q2503326) (← links)
- Processes as formal power series: a coinductive approach to denotational semantics (Q2503337) (← links)
- Probabilistic temporal logics via the modal mu-calculus (Q2566296) (← links)
- Determining asynchronous test equivalence for probabilistic processes (Q2671816) (← links)
- Fairness and communication-based semantics for session-typed languages (Q2672270) (← links)
- Reactive bisimulation semantics for a process algebra with timeouts (Q2687033) (← links)
- On the Relative Expressive Power of Calculi for Mobility (Q2805161) (← links)
- A Theory of Monitors (Q2811337) (← links)
- Characterising Testing Preorders for Broadcasting Distributed Systems (Q2811926) (← links)
- Typed behavioural equivalences for processes in the presence of subtyping (Q2841263) (← links)
- A Logical Process Calculus (Q2842601) (← links)
- Modal Logics for Cryptographic Processes (Q2842609) (← links)