Conjunction on processes: Full abstraction via ready-tree semantics

DOI10.1016/J.TCS.2006.10.022zbMath1111.68085OpenAlexW1971435295MaRDI QIDQ875513

Walter Vogler, Gerald Lüttgen

Publication date: 13 April 2007

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

Full work available at URL: https://doi.org/10.1016/j.tcs.2006.10.022

zbMATH Keywords

full abstractionlabelled transition systemconjunctionconsistency preorderready-tree preorderready-tree semantics

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Specification and verification (program logics, model checking, etc.) (68Q60) Abstract data types; algebraic specification (68Q65) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Temporal logic (03B44)

Related Items (9)

ACTL for modal interface automata ⋮ An algebraic theory of interface automata ⋮ Axiomatizing Lüttgen \& Vogler's ready simulation for finite processes in \(\mathrm{CLL}_{R}\) ⋮ On recursive operations over logic LTS ⋮ Safe reasoning with logic LTS ⋮ Safe Reasoning with Logic LTS ⋮ Ready simulation for concurrency: it's logical! ⋮ Encoding safety in \(\mathrm{CLL}_R\) ⋮ On the greatest solution of equations in \(\mathrm{CLL}_R\)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Graphical versus logical specifications
• A logical view of composition
• A refinement calculus for specifications in Hennessy-Milner logic with recursion
• Bisimulation through probabilistic testing
• Automatic verification methods for finite state systems. International workshop, Grenoble, France, June 12-14, 1989. Proceedings
• Testing equivalences for processes
• A Logical Process Calculus
• A logic for the description of non-deterministic programs and their properties
• Ready-Trace Semantics for Concrete Process Algebra with the Priority Operator
• A Theory of Communicating Sequential Processes
• Nets, Terms and Formulas
• Process-Algebraic Interpretations of Positive Linear and Relevant Logics
• Bisimulation can't be traced

This page was built for publication: Conjunction on processes: Full abstraction via ready-tree semantics