Ready simulation for concurrency: it's logical!

DOI10.1016/j.ic.2010.02.001zbMath1197.68053OpenAlexW2007928509MaRDI QIDQ988555

Gerald Lüttgen, Walter Vogler

Publication date: 18 August 2010

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://nbn-resolving.org/urn:nbn:de:bvb:384-opus4-3925

zbMATH Keywords

full abstractionconjunctionready simulationparallel compositionconsistency preorderlogic labelled transition system

Mathematics Subject Classification ID

Application models in control theory (93C95) Logic in computer science (03B70) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items

Concurrent weighted logic ⋮ An algebraic theory of interface automata ⋮ Axiomatizing Lüttgen \& Vogler's ready simulation for finite processes in \(\mathrm{CLL}_{R}\) ⋮ Axiomatizing weak simulation semantics over BCCSP ⋮ On recursive operations over logic LTS ⋮ Safe reasoning with logic LTS ⋮ An axiomatic semantics for \(\mathsf{ioco} \underline{\mathsf{s}}\) conformance relation ⋮ Encoding safety in \(\mathrm{CLL}_R\) ⋮ Axiomatizing Weak Ready Simulation Semantics over BCCSP ⋮ On the greatest solution of equations in \(\mathrm{CLL}_R\)

Uses Software

• LOTOS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• LOTOS
• A logical view of composition
• Conjunction on processes: Full abstraction via ready-tree semantics
• Specification-oriented semantics for communicating processes
• Refusal Simulation and Interactive Games
• A logic for the description of non-deterministic programs and their properties
• A Theory of Communicating Sequential Processes
• Nets, Terms and Formulas
• Bisimulation can't be traced
• Foundations of Software Science and Computation Structures