Minimal refinements of specifications in modal and temporal logics

DOI10.1007/s00165-006-0014-3zbMath1192.68448OpenAlexW4246611021MaRDI QIDQ5899160

Nikos Gorogiannis, Mark D. Ryan

Publication date: 19 April 2007

Published in: Formal Aspects of Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00165-006-0014-3

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45) Logic in computer science (03B70) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Temporal logic (03B44)

Uses Software

• Graphviz

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The existence of refinement mappings
• Two modellings for theory change
• Nonmonotonic reasoning, preferential models and cumulative logics
• Propositional knowledge base revision and minimal change
• The effect of bounding the number of primitive propositions and the depth of nesting on the complexity of modal logic
• Automatic verification of finite-state concurrent systems using temporal logic specifications
• Algebraic laws for nondeterminism and concurrency
• Beyond rational monotony: some strong non-horn rules for nonmonotonic inference relations
• Logic in Computer Science
• Requirements, specifications, and minimal refinement

This page was built for publication: Minimal refinements of specifications in modal and temporal logics