Extensional equivalences for transition systems

DOI10.1007/BF00264365zbMath0636.68069MaRDI QIDQ1098303

Rocco De Nicola

Publication date: 1987

Published in: Acta Informatica (Search for Journal in Brave)

zbMATH Keywords

labelled transition systemstesting equivalencemodels of computationconcurrent and nondeterministic systemsequivalences of systems

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Theory of operating systems (68N25)

Related Items (50)

Testability of a communicating system through an environment ⋮ Abstraction and Abstraction Refinement ⋮ On the operational semantics of nondeterminism and divergence ⋮ Compositional refinements in multiple blackboard systems ⋮ Global Protocol Implementations via Attribute-Based Communication ⋮ On simulation, subtyping and substitutability in sequential object systems ⋮ Stable families of behavioural equivalences ⋮ Quiescence, fairness, testing, and the notion of implementation ⋮ Concurrency and atomicity ⋮ A uniform framework for modeling nondeterministic, probabilistic, stochastic, or mixed processes and their behavioral equivalences ⋮ An algebraic framework for developing and maintaining real-time systems ⋮ Faster asynchronous systems. ⋮ Temporal-logic property preservation under Z refinement ⋮ Probabilistic may/must testing: retaining probabilities by restricted schedulers ⋮ Equivalences of Statecharts ⋮ A trace-based service semantics guaranteeing deadlock freedom ⋮ Component-aware input-output conformance ⋮ Model-Based Testing of Environmental Conformance of Components ⋮ Testing equivalences of time Petri nets ⋮ Extended transition systems for parametric bisimulation ⋮ The equivalence in the DCP model ⋮ Specification styles in distributed systems design and verification ⋮ Minimizing the number of transitions with respect to observation equivalence ⋮ A process algebraic view of input/output automata ⋮ The chemical abstract machine ⋮ More Relational Concurrent Refinement: Traces and Partial Relations ⋮ Divergence and fair testing ⋮ Complete sets of axioms for finite basic LOTOS behavioural equivalences ⋮ Relating strong behavioral equivalences for processes with nondeterminism and probabilities ⋮ Unnamed Item ⋮ Enriched categorical semantics for distributed calculi ⋮ Partial order semantics for use case and task models ⋮ Failure-equivalent transformation of transition systems to avoid internal actions ⋮ A hierarchy of failures-based models: theory and application ⋮ Model-Based Testing ⋮ Relating fair testing and accordance for service replaceability ⋮ Algebraic characterizations of trace and decorated trace equivalences over tree-like structures ⋮ On testing UML statecharts ⋮ Processes as formal power series: a coinductive approach to denotational semantics ⋮ Modelling Divergence in Relational Concurrent Refinement ⋮ Testing preorders for probabilistic processes ⋮ A dynamic evolution for the specifications of distributed systems ⋮ Relational concurrent refinement. III: Traces, partial relations and automata ⋮ (Bi)simulations up-to characterise process semantics ⋮ Logical Dynamics of Evidence ⋮ REASONING WITH PROTOCOLS UNDER IMPERFECT INFORMATION ⋮ Reasoning about nondeterministic and concurrent actions: A process algebra approach ⋮ Basic observables for processes ⋮ Finite axiom systems for testing preorder and De Simone process languages ⋮ Simulations Up-to and Canonical Preorders

This page was built for publication: Extensional equivalences for transition systems