Encoding safety in \(\mathrm{CLL}_R\)
From MaRDI portal
Publication:2055960
DOI10.1016/j.tcs.2021.09.036zbMath1489.68173OpenAlexW3204857108MaRDI QIDQ2055960
Zhaohui Zhu, Yan Zhang, Jinjin Zhang
Publication date: 1 December 2021
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2021.09.036
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)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Model-checking process equivalences
- Safe reasoning with logic LTS
- Graphical versus logical specifications
- Conjunction on processes: Full abstraction via ready-tree semantics
- Axiomatizing Lüttgen \& Vogler's ready simulation for finite processes in \(\mathrm{CLL}_{R}\)
- Proof systems for satisfiability in Hennessy-Milner logic with recursion
- Ready simulation for concurrency: it's logical!
- A logic for the specification and proof of regular controllable processes of CCS
- Characteristic formulae for processes with divergence
- Logical vs. behavioural specifications
- On the greatest solution of equations in \(\mathrm{CLL}_R\)
- Unifying the Linear Time-Branching Time Spectrum of Process Semantics
- Characteristic formulae for fixed-point semantics: a general framework
- 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
- A modal characterization of observational congruence on finite terms of CCS
- The meaning of negative premises in transition system specifications
- Semantics of Probabilistic Processes
- On recursive operations over logic LTS
This page was built for publication: Encoding safety in \(\mathrm{CLL}_R\)
