The complementation problem for Bu¨chi automata with applications to temporal logic
Theoretical Computer Science
The temporal analysis of Chisholm's paradox
AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
Decidability of Quantifed Propositional Branching Time Logics
AI '01 Proceedings of the 14th Australian Joint Conference on Artificial Intelligence: Advances in Artificial Intelligence
Augmenting Branching Temporal Logics with Existential Quantification over Atomic Propositions
Proceedings of the 7th International Conference on Computer Aided Verification
Design and Synthesis of Synchronization Skeletons Using Branching-Time Temporal Logic
Logic of Programs, Workshop
STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing
Games for synthesis of controllers with partial observation
Theoretical Computer Science - Logic and complexity in computer science
Deciding Full Branching Time Logic
Deciding Full Branching Time Logic
Normative pragmatics for agent communication languages
ER'05 Proceedings of the 24th international conference on Perspectives in Conceptual Modeling
Designing normative behaviour via landmarks
AAMAS'05 Proceedings of the 2005 international conference on Agents, Norms and Institutions for Regulated Multi-Agent Systems
JELIA '08 Proceedings of the 11th European conference on Logics in Artificial Intelligence
Axioms for obligation and robustness with temporal logic
DEON'10 Proceedings of the 10th international conference on Deontic logic in computer science
dCTL: a branching time temporal logic for fault-tolerant system verification
SEFM'11 Proceedings of the 9th international conference on Software engineering and formal methods
Model checking propositional deontic temporal logic via a μ-calculus characterization
SBMF'12 Proceedings of the 15th Brazilian conference on Formal Methods: foundations and applications
CATS '11 Proceedings of the Seventeenth Computing: The Australasian Theory Symposium - Volume 119
CATS 2011 Proceedings of the Seventeenth Computing on The Australasian Theory Symposium - Volume 119
A resolution calculus for the branching-time temporal logic CTL
ACM Transactions on Computational Logic (TOCL)
Hi-index | 0.00 |
It can be desirable to specify polices that require a system to achieve some outcome even if a certain number of failures occur. This paper proposes a logic, RoCTL*, which extends CTL* with operators from Deontic logic, and a novel operator referred to as "Robustly". This novel operator acts as variety of path quantifier allowing us to consider paths which deviate from the desired behaviour of the system. Unlike most path quantifiers, the Robustly operator must be evaluated over a path rather than just a state; the Robustly operator quantifies over paths produced from the current path by altering a single step. The Robustly operator roughly represents the phrase "even if an additional failure occurs now or in the future". This paper examines the expressivity of this new logic, motivates its use and shows that it is decidable.