Minimal refinements of specifications in modal and temporal logics

DOI10.1007/S00165-006-0014-3MaRDI QIDQ5899160zbMATH OpenOpenAlexFDO

Authors Nikos Gorogiannis, M. 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

Temporal logic (03B44) 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)

Cites work

• Algebraic laws for nondeterminism and concurrency
• Automatic verification of finite-state concurrent systems using temporal logic specifications
• Beyond rational monotony: some strong non-horn rules for nonmonotonic inference relations
• scientific article; zbMATH DE number 3670430 (Why is no real title available?)
• scientific article; zbMATH DE number 176726 (Why is no real title available?)
• scientific article; zbMATH DE number 1487867 (Why is no real title available?)
• scientific article; zbMATH DE number 910719 (Why is no real title available?)
• scientific article; zbMATH DE number 4187148 (Why is no real title available?)
• Logic in Computer Science
• Modal logic
• Nonmonotonic reasoning, preferential models and cumulative logics
• Propositional knowledge base revision and minimal change
• Requirements, specifications, and minimal refinement
• The effect of bounding the number of primitive propositions and the depth of nesting on the complexity of modal logic
• The existence of refinement mappings
• Two modellings for theory change

Cited in

(1)

• Termination of derivations for minimal tense logic

Describes a project that uses

Uses Software

• Graphviz

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5899160)