Pages that link to "Item:Q1348526"
From MaRDI portal
The following pages link to Testing equivalences for processes (Q1348526):
Displayed 34 items.
- 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 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)
- 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)
- Bisimulation on speed: Lower time bounds (Q5313721) (← links)
- Performance-Oriented Comparison of Web Services Via Client-Specific Testing Preorders (Q5428916) (← links)
- A survey of modal logics characterising behavioural equivalences for non-deterministic and stochastic systems (Q5458058) (← links)
- CONFLICTS AND FAIR TESTING (Q5484903) (← links)
- A TIMED FAILURE EQUIVALENCE PRESERVING ABSTRACTION FOR PARAMETRIC TIME-INTERVAL AUTOMATA (Q5484905) (← links)
- Applying a testing approach to the Calculus of Fair Ambients (Q5850754) (← links)
- Quantales, finite observations and strong bisimulation (Q5940918) (← links)
- Algebraic characterizations of trace and decorated trace equivalences over tree-like structures (Q5940926) (← links)
- Fast asynchronous systems in dense time (Q5940928) (← links)
- From rewrite rules to bisimulation congruences (Q5958468) (← links)
- Divergence in testing and readiness semantics (Q5958758) (← links)