Safe reasoning with logic LTS
From MaRDI portal
Publication:549200
DOI10.1016/j.tcs.2011.03.015zbMath1216.68193MaRDI QIDQ549200
Publication date: 7 July 2011
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2011.03.015
temporal logic; safety properties; labelled transition systems; heterogeneous specification; modal refinement; ready simulation
68Q85: Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.)
03B44: Temporal logic
Related Items
On recursive operations over logic LTS, Processes with infinite liveness requirements, Axiomatizing Lüttgen \& Vogler's ready simulation for finite processes in \(\mathrm{CLL}_{R}\), Encoding safety in \(\mathrm{CLL}_R\), On the greatest solution of equations in \(\mathrm{CLL}_R\), ACTL for modal interface automata, Safe Reasoning with Logic LTS
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A logical view of composition
- On determinism in modal transition systems
- Conjunction on processes: Full abstraction via ready-tree semantics
- Ready simulation for concurrency: it's logical!
- Processes with local and global liveness requirements
- Statecharts: a visual formalism for complex systems
- Automatic verification methods for finite state systems. International workshop, Grenoble, France, June 12-14, 1989. Proceedings
- Process algebra and conditional composition
- Refusal Simulation and Interactive Games
- Finite Abstract Models for Deterministic Transition Systems: Fair Parallel Composition and Refinement-Preserving Logic
- On Modal Refinement and Consistency
- A Theory of Communicating Sequential Processes
- Nets, Terms and Formulas
- Modal I/O Automata for Interface and Product Line Theories