Pages that link to "Item:Q1348526"

The following pages link to Testing equivalences for processes (Q1348526):

Displaying 50 items.

• Strategies as concurrent processes (Q283745) (← links)
• Name-passing calculi: from fusions to preorders and types (Q342734) (← links)
• Conflict-preserving abstraction of discrete event systems using annotated automata (Q351736) (← links)
• Behavioural equivalences of a probabilistic pi-calculus (Q362281) (← links)
• A uniform framework for modeling nondeterministic, probabilistic, stochastic, or mixed processes and their behavioral equivalences (Q384933) (← links)
• A process algebra framework for multi-scale modelling of biological systems (Q388145) (← links)
• Deciding equivalence-based properties using constraint solving (Q391121) (← links)
• On real reward testing (Q407446) (← links)
• Connectors as designs: modeling, refinement and test case generation (Q433336) (← links)
• First-order reasoning for higher-order concurrency (Q456466) (← links)
• Model-checking process equivalences (Q477208) (← links)
• A ground-complete axiomatization of stateless bisimilarity over Linda (Q477631) (← links)
• Test selection for traces refinement (Q481094) (← links)
• An algebraic theory for web service contracts (Q493534) (← links)
• Contexts, refinement and determinism (Q541213) (← links)
• A randomized encoding of the \(\pi\)-calculus with mixed choice (Q555750) (← links)
• Measuring the confinement of probabilistic systems (Q557887) (← links)
• Modal logics for communicating systems (Q578896) (← links)
• Refusal testing (Q580961) (← links)
• Step failures semantics and a complete proof system (Q582133) (← links)
• Bisimulation on speed: Worst-case efficiency (Q598200) (← links)
• A taxonomy of process calculi for distribution and mobility (Q660996) (← links)
• Modelling causality via action dependencies in branching time semantics (Q671596) (← links)
• Deciding observational congruence of finite-state CCS expressions by rewriting (Q673974) (← links)
• Model-based testing of probabilistic systems (Q682363) (← links)
• Universal axioms for bisimulations (Q685411) (← links)
• A logical view of composition (Q685416) (← links)
• A formal abstract framework for modelling and testing complex software systems (Q714878) (← links)
• The calculus of context-aware ambients (Q716296) (← links)
• Testing for refinement in \textsf{Circus} (Q766162) (← links)
• Priorities in process algebras (Q802881) (← links)
• Model independent approach to probabilistic models (Q831149) (← links)
• Performance of pipelined asynchronous systems (Q864507) (← links)
• Fair testing (Q865623) (← links)
• Conjunction on processes: Full abstraction via ready-tree semantics (Q875513) (← links)
• SOS formats and meta-theory: 20 years after (Q877025) (← links)
• Synthesising correct concurrent runtime monitors (Q888412) (← links)
• Theory of interaction (Q896903) (← links)
• A partial ordering semantics for CCS (Q914400) (← links)
• CCS expressions, finite state processes, and three problems of equivalence (Q918211) (← links)
• Formalization of test experiments (Q927449) (← links)
• Bisimulations in calculi modelling membranes (Q939161) (← links)
• Automatic verification of distributed systems: the process algebra approach. (Q960505) (← links)
• On the expressiveness of interaction (Q960859) (← links)
• Relating fair testing and accordance for service replaceability (Q974133) (← links)
• A precongruence format for should testing preorder (Q974134) (← links)
• Ready to preorder: the case of weak process semantics (Q975539) (← links)
• Making random choices invisible to the scheduler (Q979081) (← links)
• Contract-based discovery of Web services modulo simple orchestrators (Q987977) (← links)
• Revivals, stuckness and the hierarchy of CSP models (Q1007236) (← links)