Safe reasoning with logic LTS
DOI10.1016/J.TCS.2011.03.015zbMATH Open1216.68193OpenAlexW1997172052MaRDI QIDQ549200FDOQ549200
Authors: Gerald Lüttgen, Walter Vogler
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
Recommendations
temporal logicsafety propertieslabelled transition systemsheterogeneous specificationmodal refinementready simulation
Temporal logic (03B44) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Cites Work
- Statecharts: a visual formalism for complex systems
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Handbook of process algebra
- A Theory of Communicating Sequential Processes
- Title not available (Why is that?)
- Modal I/O Automata for Interface and Product Line Theories
- Processes with local and global liveness requirements
- Nets, Terms and Formulas
- On determinism in modal transition systems
- Conjunction on processes: Full abstraction via ready-tree semantics
- Ready simulation for concurrency: it's logical!
- 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
- Title not available (Why is that?)
- A logical view of composition
Cited In (10)
- Ready simulation for concurrency: it's logical!
- ACTL for modal interface automata
- Safe Reasoning with Logic LTS
- On recursive operations over logic LTS
- Encoding safety in \(\mathrm{CLL}_R\)
- Axiomatizing Lüttgen \& Vogler's ready simulation for finite processes in \(\mathrm{CLL}_{R}\)
- On the greatest solution of equations in \(\mathrm{CLL}_R\)
- A Modal Logic for Full LOTOS based on Symbolic Transition Systems
- Processes with infinite liveness requirements
- Title not available (Why is that?)
This page was built for publication: Safe reasoning with logic LTS
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q549200)