Acceptance trees

DOI10.1145/4221.4249zbMath0633.68074OpenAlexW2294826973MaRDI QIDQ3771649

Matthew C. B. Hennessy

Publication date: 1985

Published in: Journal of the ACM (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/4221.4249

zbMATH Keywords

treessemanticsaxiomsnondeterministic machines

Mathematics Subject Classification ID

Trees (05C05) Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60)

Related Items (31)

Termination, deadlock and divergence ⋮ Testing equivalence as a bisimulation equivalence ⋮ Testing for a conformance relation based on acceptance ⋮ An algebraic theory of fair asynchronous communicating processes ⋮ Algebraic solutions to recursion schemes ⋮ Type theory and concurrency ⋮ A uniform framework for modeling nondeterministic, probabilistic, stochastic, or mixed processes and their behavioral equivalences ⋮ Semantics for finite delay ⋮ Algebraic theory of probabilistic processes. ⋮ CCS expressions, finite state processes, and three problems of equivalence ⋮ Unnamed Item ⋮ The equivalence in the DCP model ⋮ A proof system for communicating processes with value-passing ⋮ Compositionality in state space verification methods ⋮ A fully abstract denotational model for observational precongruence ⋮ Communicating processes with value-passing and assignments ⋮ A fully abstract denotational model for observational precongruence ⋮ Algebraic characterizations of trace and decorated trace equivalences over tree-like structures ⋮ On the Unification of Process Semantics: Observational Semantics ⋮ Contract-based discovery of Web services modulo simple orchestrators ⋮ A dynamic evolution for the specifications of distributed systems ⋮ Compositionality for quantitative specifications ⋮ A survey of modal logics characterising behavioural equivalences for non-deterministic and stochastic systems ⋮ A complete axiomatisation for observational congruence of finite-state behaviours ⋮ Logical vs. behavioural specifications ⋮ An invitation to friendly testing ⋮ Linda-based applicative and imperative process algebras ⋮ Strong fairness and full abstraction for communicating processes ⋮ Specification-oriented semantics for communicating processes ⋮ Denotational fixed-point semantics for constructive scheduling of synchronous concurrency ⋮ Stepwise development of process-algebraic specifications in decorated trace semantics

This page was built for publication: Acceptance trees