Pages that link to "Item:Q1348526"
From MaRDI portal
The following pages link to Testing equivalences for processes (Q1348526):
Displayed 50 items.
- 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)
- Models for CSP with availability information (Q2971074) (← 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)
- (Q3384913) (← links)
- Compliance in Behavioural Contracts: A Brief Survey (Q3460865) (← 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)
- Basic observables for processes (Q4571979) (← links)
- Efficiency of asynchronous systems and read arcs in petri nets (Q4571984) (← links)
- Order algebras: a quantitative model of interaction (Q4577983) (← links)
- Timed testing of concurrent systems (Q4630289) (← links)
- Divergence and fair testing (Q4645218) (← links)
- Emergence in Context-Free Parallel Communicating Grammar Systems: What Does and Does not Make a Grammar System More Expressive Than Its Parts (Q4686650) (← 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)
- (Q4989406) (← links)
- (Q5019694) (← links)
- (Q5028468) (← links)
- Soundness Conditions for Big-Step Semantics (Q5041092) (← links)
- Inference Systems with Corules for Combined Safety and Liveness Properties of Binary Session Types (Q5043586) (← links)
- From π-calculus to higher-order π-calculus — and back (Q5044732) (← links)
- Testability of a communicating system through an environment (Q5044760) (← links)
- Multiparty testing preorders (Q5060196) (← links)
- (Q5089269) (← links)
- (Q5094151) (← links)
- Deciding bisimulation equivalences for a class of non-finite-state programs (Q5096175) (← links)
- Towards a complete hierarchy of compositional dataflow models (Q5096218) (← links)
- An algebraic framework for developing and maintaining real-time systems (Q5096395) (← links)
- Fully abstract semantics for higher order communicating systems (Q5096859) (← links)
- Generating diagnostic information for behavioral preorders (Q5137006) (← links)
- COMPOSITIONAL VERIFICATION OF THE GENERALIZED NONBLOCKING PROPERTY USING ABSTRACTION AND CANONICAL AUTOMATA (Q5168410) (← links)
- Toward formal development of programs from algebraic specifications: Model-theoretic foundations (Q5204355) (← links)
- Testing preorders for probabilistic processes (Q5204359) (← links)