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)
- Relating strong behavioral equivalences for processes with nondeterminism and probabilities (Q2253178) (← 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)
- 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)
- 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)
- (Q2851059) (← links)
- FROM COMPUTING TO INTERACTION: ON THE EXPRESSIVENESS OF ASYNCHRONOUS PI-CALCULUS (Q2856009) (← links)
- Remarks on Testing Probabilistic Processes (Q2864156) (← links)
- Linearity, Persistence and Testing Semantics in the Asynchronous Pi-Calculus (Q2864372) (← links)
- Matching Systems for Concurrent Calculi (Q2864374) (← links)
- Synchrony vs Asynchrony in Communication Primitives (Q2866346) (← links)
- On projecting processes into session types (Q2883119) (← links)
- A Testing Theory for a Higher-Order Cryptographic Language (Q3000588) (← links)
- Axiomatizing Weak Ready Simulation Semantics over BCCSP (Q3105742) (← links)
- Weighted Bisimulation in Linear Algebraic Form (Q3184672) (← links)
- Testing Finitary Probabilistic Processes (Q3184679) (← links)
- Twenty Years on: Reflections on the CEDISYS Project. Combining True Concurrency with Process Algebra (Q3507401) (← links)
- Branching vs. Linear Time: Semantical Perspective (Q3510781) (← links)
- Towards a Unified Approach to Encodability and Separation Results for Process Calculi (Q3541040) (← links)
- On Finite Bases for Weak Semantics: Failures Versus Impossible Futures (Q3599070) (← links)
- Formal Analysis of Dynamic, Distributed File-System Access Controls (Q3613061) (← links)
- Derivation of a Suitable Finite Test Suite for Customized Probabilistic Systems (Q3613092) (← links)
- A theory of contracts for strong service compliance (Q3636912) (← links)
- (Q4222750) (← links)
- On deciding some equivalences for concurrent processes (Q4362275) (← links)
- Une critique de la notion de test de processus fondée sur la non séparabilité de certaines classes de langages (Q4728280) (← links)
- First–order Semantics for Higher–order Processes (Q4921509) (← links)
- COMPOSITIONAL VERIFICATION OF THE GENERALIZED NONBLOCKING PROPERTY USING ABSTRACTION AND CANONICAL AUTOMATA (Q5168410) (← links)