Testing equivalences for processes

DOI10.1016/0304-3975(84)90113-0zbMath0985.68518MaRDI 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

68Q10: Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.)

68Q55: Semantics in the theory of computing

Related Items

A randomized encoding of the \(\pi\)-calculus with mixed choice, Measuring the confinement of probabilistic systems, Modal logics for communicating systems, Step failures semantics and a complete proof system, Bisimulation on speed: Worst-case efficiency, Modelling causality via action dependencies in branching time semantics, Deciding observational congruence of finite-state CCS expressions by rewriting, Universal axioms for bisimulations, A logical view of composition, Priorities in process algebras, Performance of pipelined asynchronous systems, Fair testing, Conjunction on processes: Full abstraction via ready-tree semantics, SOS formats and meta-theory: 20 years after, A partial ordering semantics for CCS, CCS expressions, finite state processes, and three problems of equivalence, Formalization of test experiments, Bisimulations in calculi modelling membranes, Automatic verification of distributed systems: the process algebra approach., Revivals, stuckness and the hierarchy of CSP models, Specification-oriented semantics for communicating processes, 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, An introduction to the regular theory of fairness, A distributed operational semantics of CCS based on condition/event systems, Concurrent transition systems, Type theory and concurrency, Concurrency and atomicity, A process algebraic view of Linda coordination primitives, Bisimulation through probabilistic testing, Correctness of concurrent processes, The equivalence in the DCP model, Specification styles in distributed systems design and verification, The chemical abstract machine, Observational structures and their logic, Proof systems for infinite behaviours, Experimenting with process equivalence, Structured operational semantics and bisimulation as a congruence, Complete sets of axioms for finite basic LOTOS behavioural equivalences, Enriched categorical semantics for distributed calculi, Unique decomposition of processes, TIC: a tImed calculus, LOTOS extended with probabilistic behaviours, Liveness in timed and untimed systems, An invitation to friendly testing, On performance congruences for process algebras, On the expressiveness of internal mobility in name-passing calculi, A calculus for cryptographic protocols: The spi calculus, Exact performance equivalence: An equivalence relation for stochastic automata, A behavioural theory of first-order CML, Basic observables for processes, On deciding trace equivalences for processes, 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?, On reduction-based process semantics, On the operational semantics of nondeterminism and divergence, Quiescence, fairness, testing, and the notion of implementation, Essential concepts of algebraic specification and program development, Composition and behaviors of probabilistic I/O automata, Semantics for finite delay, The power of reachability testing for timed automata, Algebraic theory of probabilistic and nondeterministic processes., Algebraic theory of probabilistic processes., Faster asynchronous systems., Linda-based applicative and imperative process algebras, Finite axiom systems for testing preorder and De Simone process languages, Analysis of equivalence relations of event structures with continuous time, Testing congruence for mobile processes, Testing preorders for probabilistic processes can be characterized by simulations, A fully abstract denotational semantics for the \(\pi\)-calculus, Truly concurrent constraint programming, Impossible futures and determinism, Additive models of probabilistic processes, Efficiency of asynchronous systems, read arcs, and the MUTEX-problem, A hierarchy of failures-based models: theory and application, The security pi-calculus and non-interference, A hierarchy of equivalences for asynchronous calculi, A framework for specifying and verifying the behaviour of open systems, Measuring the performance of asynchronous systems with PAFAS, Observational congruences for dynamically reconfigurable tile systems, Modular specification of process algebras, Performance measure sensitive congruences for Markovian process algebras, A comparison of three authentication properties., Testing preorders for probabilistic processes., Vertical implementation, Trace and testing equivalence on asynchronous processes, Secure implementation of channel abstractions, Process languages with discrete relative time based on the ordered SOS format and rooted eager bisimulation, Tau laws for pi calculus, Asynchronous communication model based on linear logic, Concurrent testing of processes, Compositional failure-based semantic models for basic LOTOS, Deciding bisimilarity and similarity for probabilistic processes., Refinement-oriented probability for CSP, Testing equivalence as a bisimulation equivalence, Specification, testing and implementation relations for symbolic-probabilistic systems, On deciding some equivalences for concurrent processes, Une critique de la notion de test de processus fondée sur la non séparabilité de certaines classes de langages, Bisimulation on speed: Lower time bounds, Performance-Oriented Comparison of Web Services Via Client-Specific Testing Preorders, A survey of modal logics characterising behavioural equivalences for non-deterministic and stochastic systems, CONFLICTS AND FAIR TESTING, A TIMED FAILURE EQUIVALENCE PRESERVING ABSTRACTION FOR PARAMETRIC TIME-INTERVAL AUTOMATA, Quantales, finite observations and strong bisimulation, Algebraic characterizations of trace and decorated trace equivalences over tree-like structures, Fast asynchronous systems in dense time, From rewrite rules to bisimulation congruences, Divergence in testing and readiness semantics, Non-bisimulation-based Markovian behavioral equivalences, Priority and abstraction in process algebra, Basic observables for a calculus for global computing, A framework for analyzing probabilistic protocols and its application to the partial secrets exchange, Separation of synchronous and asynchronous communication via testing, Compositional synthesis of maximally permissive supervisors using supervision equivalence, A process algebraic view of shared dataspace coordination, Fairness of actions in system computations, Bisimulation on speed: a unified approach, Processes as formal power series: a coinductive approach to denotational semantics, Probabilistic temporal logics via the modal mu-calculus, Twenty Years on: Reflections on the CEDISYS Project. Combining True Concurrency with Process Algebra, Branching vs. Linear Time: Semantical Perspective, Towards a Unified Approach to Encodability and Separation Results for Process Calculi, On Finite Bases for Weak Semantics: Failures Versus Impossible Futures, Formal Analysis of Dynamic, Distributed File-System Access Controls, Derivation of a Suitable Finite Test Suite for Customized Probabilistic Systems, Unnamed Item

Uses Software

Ada95

Cites Work