Axiomatizing Lüttgen \& Vogler's ready simulation for finite processes in \(\mathrm{CLL}_{R}\)

DOI10.1016/j.jal.2015.06.005zbMath1457.68196arXiv1502.03636OpenAlexW1589611972MaRDI QIDQ893593

N. E. Zubov

Publication date: 19 November 2015

Published in: Journal of Applied Logic (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1502.03636

zbMATH Keywords

axiomatizationprocess calculuslogic labelled transition systemweak ready simulation

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Temporal logic (03B44)

Related Items (1)

Encoding safety in \(\mathrm{CLL}_R\)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Safe reasoning with logic LTS
• Conjunction on processes: Full abstraction via ready-tree semantics
• Ready simulation for concurrency: it's logical!
• Bisimulation through probabilistic testing
• A complete axiomatisation for observational congruence of finite-state behaviours
• Complete inference systems for weak bisimulation equivalences in the \(\pi\)-calculus.
• Axiomatizing weak simulation semantics over BCCSP
• A Logical Process Calculus
• A ground-complete axiomatisation of finite-state processes in a generic process algebra
• A logic for the description of non-deterministic programs and their properties
• Nets, Terms and Formulas
• Bisimulation can't be traced
• The meaning of negative premises in transition system specifications
• On recursive operations over logic LTS
• Software reliability methods. Foreword by Edmund M. Clarke

This page was built for publication: Axiomatizing Lüttgen \& Vogler's ready simulation for finite processes in \(\mathrm{CLL}_{R}\)