Authors
Abstract
This paper compares the recently proposed Robust Full Computational Tree Logic to model robustness in concurrent systems with other computational tree logic -based logics. RoCTL* extends CTL* with the addition of the operators Obligatory and Robustly, which quantify over failure-free paths and paths with one more failure respectively. This paper focuses on examining the succinctness and expressiveness of RoCTL* by presenting translations to and from RoCTL*. The core result of this paper is to show that RoCTL* is expressively equivalent to CTL* but is non-elementarily more succinct. That is, RoCTL* does not add any expressive power over CTL*, but can represent some properties using vastly reduced formulae. We present a translation from RoCTL* into CTL* that preserves truth but may result in non-elementary growth in the length of the translated formula, as each nested Robustly operator may result in an extra exponential blowup. However, we show that this translation is optimal in the sense th..
Keywords No keywords specified (fix it)
Categories (categorize this paper)
ISBN(s)
DOI 10.1080/11663081.2015.1050907
Options
Edit this record
Mark as duplicate
Export citation
Find it on Scholar
Request removal from index
Revision history

Download options

PhilArchive copy


Upload a copy of this paper     Check publisher's policy     Papers currently archived: 71,436
External links

Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
Through your library

References found in this work BETA

Deontic Logic.G. H. von Wright - 1951 - Mind 60 (237):1-15.
I. Deontic Logic.G. H. von Wright - 1951 - Mind 60 (237):1-15.
Gentle Murder, or the Adverbial Samaritan.James William Forrester - 1984 - Journal of Philosophy 81 (4):193-197.
Bisimulation Quantified Modal Logics: Decidability.Tim French - 2006 - In Guido Governatori, Ian Hodkinson & Yde Venema (eds.), Advances in Modal Logic, Volume 6. CSLI Publications. pp. 147-166.

View all 7 references / Add more references

Citations of this work BETA

No citations found.

Add more citations

Similar books and articles

Complexity and Nicety of Fluted Logic.William C. Purdy - 2002 - Studia Logica 71 (2):177 - 198.
Relating Word and Tree Automata.Orna Kupferman, Shmuel Safra & Moshe Y. Vardi - 2006 - Annals of Pure and Applied Logic 138 (1):126-146.
Some Varieties of Robustness.James Woodward - 2006 - Journal of Economic Methodology 13 (2):219-240.
Expressive Completeness of Temporal Logic of Trees.Bernd-Holger Schlingloff - 1992 - Journal of Applied Non-Classical Logics 2 (2):157-180.
Three-Valued Logics in Modal Logic.Barteld Kooi & Allard Tamminga - 2013 - Studia Logica 101 (5):1061-1072.
Truth as Translation – Part A.Hannes Leitgeb - 2001 - Journal of Philosophical Logic 30 (4):281-307.
Expressive Logics for Coalgebras Via Terminal Sequence Induction.Dirk Pattinson - 2004 - Notre Dame Journal of Formal Logic 45 (1):19-33.
Robustness and Sensitivity of Biological Models.Jani Raerinne - 2013 - Philosophical Studies 166 (2):285-303.
On Minimal Models.Francicleber Ferreira & Ana Teresa Martins - 2007 - Logic Journal of the IGPL 15 (5-6):503-526.
Being Wrong: Logics for False Belief.Christopher Steinsvold - 2011 - Notre Dame Journal of Formal Logic 52 (3):245-253.

Analytics

Added to PP index
2015-07-16

Total views
13 ( #772,591 of 2,519,861 )

Recent downloads (6 months)
1 ( #406,012 of 2,519,861 )

How can I increase my downloads?

Downloads

My notes