Acceptance trees

DOI10.1145/4221.4249MaRDI QIDQ3771649zbMATH OpenOpenAlexFDO

Authors Matthew 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

axiomsnondeterministic machinessemanticstrees

Mathematics Subject Classification ID

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

Recommendations

• Trees and semantics
• Nondeterministic Tree Automata
• scientific article; zbMATH DE number 3982544
• Topological characterizations of infinite tree languages
• scientific article; zbMATH DE number 3876608

Cited in

(34)

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

This page was built for publication: Acceptance trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3771649)