Testing equivalences for processes

DOI10.1016/0304-3975(84)90113-0zbMath0985.68518OpenAlexW2157144873MaRDI QIDQ1348526

Rocco De Nicola, Matthew C. B. Hennessy

Publication date: 13 May 2002

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(84)90113-0

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Semantics in the theory of computing (68Q55)

Related Items (only showing first 100 items - show all)

Termination, deadlock and divergence ⋮ Soundness Conditions for Big-Step Semantics ⋮ Inference Systems with Corules for Combined Safety and Liveness Properties of Binary Session Types ⋮ From π-calculus to higher-order π-calculus — and back ⋮ Testability of a communicating system through an environment ⋮ Multiparty testing preorders ⋮ Timed testing of concurrent systems ⋮ Bisimulation on speed: Lower time bounds ⋮ Efficiency of asynchronous systems and read arcs in petri nets ⋮ Order algebras: a quantitative model of interaction ⋮ Towards a complete hierarchy of compositional dataflow models ⋮ An algebraic framework for developing and maintaining real-time systems ⋮ Fully abstract semantics for higher order communicating systems ⋮ Unnamed Item ⋮ Reasoning about cryptographic protocols in the spi calculus ⋮ An algebraic theory of multiple clocks ⋮ On implementations and semantics of a concurrent programming language ⋮ A survey on compositional algorithms for verification and synthesis in supervisory control ⋮ Just testing ⋮ Testing probabilistic automata ⋮ Trade-offs in true concurrency: Pomsets and mazurkiewicz traces ⋮ On relating concurrency and nondeterminism ⋮ Equivalence checking 40 years after: a review of bisimulation tools ⋮ Fair must testing for I/O automata ⋮ Smooth coalgebra: testing vector analysis ⋮ Component-aware input-output conformance ⋮ Unnamed Item ⋮ Observing Success in the Pi-Calculus ⋮ Unnamed Item ⋮ Generating diagnostic information for behavioral preorders ⋮ Unnamed Item ⋮ On deciding some equivalences for concurrent processes ⋮ Divergence and fair testing ⋮ Truly concurrent constraint programming ⋮ COMPOSITIONAL VERIFICATION OF THE GENERALIZED NONBLOCKING PROPERTY USING ABSTRACTION AND CANONICAL AUTOMATA ⋮ First–order Semantics for Higher–order Processes ⋮ Attribute-based transactions in service oriented computing ⋮ Modelling session types using contracts ⋮ Full abstraction for expressiveness: history, myths and facts ⋮ Performance-Oriented Comparison of Web Services Via Client-Specific Testing Preorders ⋮ Quantales, finite observations and strong bisimulation ⋮ Algebraic characterizations of trace and decorated trace equivalences over tree-like structures ⋮ Fast asynchronous systems in dense time ⋮ On Finite Bases for Weak Semantics: Failures Versus Impossible Futures ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Emergence in Context-Free Parallel Communicating Grammar Systems: What Does and Does not Make a Grammar System More Expressive Than Its Parts ⋮ From rewrite rules to bisimulation congruences ⋮ Divergence in testing and readiness semantics ⋮ Formal Analysis of Dynamic, Distributed File-System Access Controls ⋮ Derivation of a Suitable Finite Test Suite for Customized Probabilistic Systems ⋮ Toward formal development of programs from algebraic specifications: Model-theoretic foundations ⋮ Testing preorders for probabilistic processes ⋮ A survey of modal logics characterising behavioural equivalences for non-deterministic and stochastic systems ⋮ Equations, Contractions, and Unique Solutions ⋮ Unnamed Item ⋮ A theory of contracts for strong service compliance ⋮ Deciding bisimulation equivalences for a class of non-finite-state programs ⋮ CONFLICTS AND FAIR TESTING ⋮ A TIMED FAILURE EQUIVALENCE PRESERVING ABSTRACTION FOR PARAMETRIC TIME-INTERVAL AUTOMATA ⋮ Basic observables for processes ⋮ Une critique de la notion de test de processus fondée sur la non séparabilité de certaines classes de langages ⋮ Applying a testing approach to the Calculus of Fair Ambients ⋮ Markovian Testing and Trace Equivalences Exactly Lump More Than Markovian Bisimilarity ⋮ Confluence Thanks to Extensional Determinism ⋮ An exercise in the automatic verification of asynchronous designs ⋮ A fully abstract trace model for dataflow and asynchronous networks ⋮ When is partial trace equivalence adequate? ⋮ Strategies as concurrent processes ⋮ Model independent approach to probabilistic models ⋮ An algebraic theory of fair asynchronous communicating processes ⋮ A context dependent equivalence between processes ⋮ On observational equivalence and algebraic specification ⋮ Toward formal development of programs from algebraic specifications: Implementations revisited ⋮ Infinite streams and finite observations in the semantics of uniform concurrency ⋮ On reduction-based process semantics ⋮ On the operational semantics of nondeterminism and divergence ⋮ An introduction to the regular theory of fairness ⋮ Name-passing calculi: from fusions to preorders and types ⋮ A distributed operational semantics of CCS based on condition/event systems ⋮ Performance of pipelined asynchronous systems ⋮ Conflict-preserving abstraction of discrete event systems using annotated automata ⋮ Fair testing ⋮ Behavioural equivalences of a probabilistic pi-calculus ⋮ Concurrent transition systems ⋮ Bisimulation on speed: Worst-case efficiency ⋮ Quiescence, fairness, testing, and the notion of implementation ⋮ Essential concepts of algebraic specification and program development ⋮ Conjunction on processes: Full abstraction via ready-tree semantics ⋮ SOS formats and meta-theory: 20 years after ⋮ Type theory and concurrency ⋮ Concurrency and atomicity ⋮ A process algebraic view of Linda coordination primitives ⋮ A uniform framework for modeling nondeterministic, probabilistic, stochastic, or mixed processes and their behavioral equivalences ⋮ A process algebra framework for multi-scale modelling of biological systems ⋮ Deciding equivalence-based properties using constraint solving ⋮ Synthesising correct concurrent runtime monitors ⋮ Composition and behaviors of probabilistic I/O automata ⋮ Semantics for finite delay ⋮ On real reward testing

Uses Software

Ada95

Cites Work

This page was built for publication: Testing equivalences for processes