Filters








101 Hits in 1.1 sec

Quantified Computation Tree Logic

A.C. Patthak, I. Bhattacharya, A. Dasgupta, Pallab Dasgupta, P.P. Chakrabarti
2002 Information Processing Letters  
The extended logic, QCTL, preserves the syntactic elegance of CTL while enhancing its expressive power significantly.  ...  Computation Tree Logic (CTL) is one of the most syntactically elegant and computationally attractive temporal logics for branching time model checking.  ...  Chakrabarti acknowledge the support of Sun Microsystems, USA, for this work. P.P. Chakrabarti further acknowledges the Department of Science & Technology, Government of India for partial support.  ... 
doi:10.1016/s0020-0190(01)00260-5 fatcat:sspkspfszzalvi3fkhqoy65ahe

Quantified CTL with imperfect information [article]

Raphaël Berthon, Bastien Maubert, Aniello Murano
2018 arXiv   pre-print
We study the expressiveness of our logic, and show that it coincides with MSO for the first semantics and with MSO with equal level for the second one.  ...  We consider two different semantics, one related to the notion of no memory, the other to perfect recall.  ...  We study the expressive power of QCTL * i . By using the same argument as for QCTL * [30] , we first show that QCTL * i and QCTL i are equally expressive for both semantics.  ... 
arXiv:1611.03524v4 fatcat:t2jns6wwmrfobj3jfqh5v5fx2m

Quantified CTL: Expressiveness and Model Checking [chapter]

Arnaud Da Costa, François Laroussinie, Nicolas Markey
2012 Lecture Notes in Computer Science  
coincides with Monadic Second-Order Logic for both semantics) and characterize the complexity of its model-checking problem, depending on the number of nested propositional quantifiers (showing that the  ...  Considering two different semantics (depending whether propositional quantification refers to the Kripke structure or to its unwinding tree), we study its expressiveness (showing in particular that QCTL  ...  We thank Thomas Colcombet and Olivier Serre for helpful comments during the redaction of this paper.  ... 
doi:10.1007/978-3-642-32940-1_14 fatcat:btuinm4k2nesvolcbsnyx5pb74

A logic with revocable and refinable strategies

Christophe Chareton, Julien Brunel, David Chemouil
2015 Information and Computation  
These logics allow to express the capabilities of agents to ensure the satisfaction of temporal properties. USL mainly differs from SL, in two ways.  ...  We show that USL allows to express a notion of sustainable control for an agent, i.e., a capability to always decide the satisfaction of a property, that still holds even after the said capability has  ...  We will also study further the expressiveness of USL.  ... 
doi:10.1016/j.ic.2015.03.015 fatcat:dufga2mft5gzzh7hxtp6vusgaq

Decidability of Propositionally Quantified Logics of Knowledge [chapter]

Tim French
2003 Lecture Notes in Computer Science  
, QCTL.  ...  This problem has been addressed in several ways, including by weakening the properties of knowledge and by enforcing various semantic structures on the knowledge of agents.  ...  We will find that QCTL has the expressive power to interpret formulas on this tree with respect to the original structure.  ... 
doi:10.1007/978-3-540-24581-0_30 fatcat:kd2tcz7ilzb47lfcxidiqoo3le

Why Does Propositional Quantification Make Modal and Temporal Logics on Trees Robustly Hard? [article]

Bartosz Bednarczyk, Stéphane Demri
2022 arXiv   pre-print
a semantics based on classes of trees.  ...  We investigate the complexity of strict fragments of tQCTL as well as of the modal logic K with propositional quantification under the tree semantics.  ...  Acknowledgements We would like to thank the reviewers for the numerous suggestions that help us to improve the quality of the document.  ... 
arXiv:2104.13122v6 fatcat:zzmov4ihznetzj2jepuvmxy5le

Strategy logic with imperfect information

Raphael Berthon, Bastien Maubert, Aniello Murano, Sasha Rubin, Moshe Y. Vardi
2017 2017 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)  
The simple syntax of QCTL* ii allows us to provide a conceptually neat reduction of SLii to QCTL*ii that separates concerns, allowing one to forget about strategies and players and focus solely on second-order  ...  The decidability result for SLii follows since the reduction maps hierarchical instances of SLii to hierarchical formulas of QCTL*ii .  ...  Then one translates QCTL * ii into SL ii by a simple adaptation of the translation of QCTL * into ATL * sc [24] . III.  ... 
doi:10.1109/lics.2017.8005136 dblp:conf/lics/BerthonMMRV17 fatcat:fx66qvynl5b6to2lqdfirjbp5y

QCTL model-checking with QBF solvers [article]

A. Hossain, F. Laroussinie
2020 arXiv   pre-print
This extension is known to be very expressive: QCTL allows us to express complex properties over Kripke structures (it is as expressive as MSO).  ...  We propose a new model-checking algorithm for QCTL based on a reduction to QBF.  ...  Acknowledgement We would like to strongly thank Mikolás Janota for his help and advice about the QBF solvers, as well as Yann Regis-Gianas who helped us with the experiments part, and the anonymous reviewers  ... 
arXiv:2010.03185v1 fatcat:rju2mux22fcjjarlmrdk5gv4fe

From Quantified CTL to QBF

Akash Hossain, François Laroussinie, Michael Wagner
2019 International Symposium/Workshop on Temporal Representation and Reasoning  
This extension is known to be very expressive: QCTL allows us to express complex properties over Kripke structures (it is as expressive as MSO).  ...  We propose a model-checking algorithm for QCTL based on a reduction to QBF.  ...  Nevertheless, in both semantics, QCTL and QCTL * (the extension of CTL * with quantifications) are equally expressive, and are as expressive 1 as the Monadic Second-Order Logic over the finite structure  ... 
doi:10.4230/lipics.time.2019.11 dblp:conf/time/HossainL19 fatcat:qb3eklhmtbh7jhplchzuiqfrgy

Quantified CTL: Expressiveness and Complexity

François Laroussinie, Nicolas Markey, Orna Kupferman
2014 Logical Methods in Computer Science  
coincides with Monadic Second-Order Logic for both semantics) and characterise the complexity of its model-checking and satisfiability problems, depending on the number of nested propositional quantifiers  ...  Considering two different semantics (depending whether propositional quantification refers to the Kripke structure or to its unwinding tree), we study its expressiveness (showing in particular that QCTL  ...  We thank Thomas Colcombet, Olivier Serre and Sylvain Schmitz for helpful comments during the redaction of this paper. We also thank the reviewers for their many valuable remarks.  ... 
doi:10.2168/lmcs-10(4:17)2014 fatcat:vo2dvygxdncstierkzx3fenx2u

First-order logics of branching time

Е.А. Котикова, М.Н. Рыбаков
2013 Logical Investigations  
We consider the logic QCTL, a first-order exten- sion of CTL defined as a logic of Kripke frames for CTL.  ...  We study the question about recursive enumerability of its fragments specified by a set of temporal modalities we use.  ...  Let us call a set M of modalities quite expressive if the modalities in at least one of the sets {AX, AG}, {EU }, {AF } can be expressed via the ones in M (maybe with use of the connectives).  ... 
doi:10.21146/2074-1472-2013-19-0-68-99 fatcat:4dnov46rrbfwvhp64ub2vmzvq4

LOVER: Light-Weight fOrmal Verification of adaptivE Systems at Run Time [chapter]

Amir Molzam Sharifloo, Paola Spoletini
2013 Lecture Notes in Computer Science  
In many cases, run-time adaptation is simply replacing a piece of system with a new one without interrupting the system operation.  ...  In this paper, we present a methodology, called LOVER, for the lightweight verification of component-based adaptive systems.  ...  Acknowledgments We would like to thank Carlo Ghezzi for the fruitful discussions on this work.  ... 
doi:10.1007/978-3-642-35861-6_11 fatcat:kgdmjjqc3za73b67xbjar62ymq

Kripke Incompleteness of First-order Calculi with Temporal Modalities of CTL and Near Logics

Е. А. Котикова, М. Н. Рыбаков
2015 Logical Investigations  
We study an expressive power of temporal operators used in such logics of branching time as computational tree logic or alternating-time temporal logic.  ...  To do this we investigate calculi in the first-order language enriched with the temporal operators used in such logics.  ...  We are also grateful to anonymous reviewer for remarks and advises; in fact, section 9.2 was added because of one of the remarks.  ... 
doi:10.21146/2074-1472-2015-21-1-86-99 fatcat:5d6zfzt5kfdqpammiuxzxkktqi

Model Checking Temporal Aspects of Inconsistent Concurrent Systems Based on Paraconsistent Logic

Donghuo Chen, Jinzhao Wu
2006 Electronical Notes in Theoretical Computer Science  
Furthermore, we explore the methodology of model checking over QCTL, and describe the detailed algorithm of implementing QCTL model checker.  ...  We introduce a novel notion of paraKripke models, which grasps the paraconsistent character of the entailment relation of QCTL.  ...  Hence, the following work focuses our efforts on studying the method of performing model checking over QCTL.  ... 
doi:10.1016/j.entcs.2006.01.021 fatcat:knv5friyxrdlvgmlr64pkgot7a

Model Checking Quantified Computation Tree Logic [chapter]

Arend Rensink
2006 Lecture Notes in Computer Science  
The semantics of QCTL is expressed on algebra automata, which are automata enriched with abstract algebras at each state, and with reallocations at each transition that express an injective renaming of  ...  Propositional temporal logic is not suitable for expressing properties on the evolution of dynamically allocated entities over time.  ...  Semantics of QCTL We now express the semantics of QCTL in terms of algebra automata. For this purpose we first need the notion of a run of such an automaton.  ... 
doi:10.1007/11817949_8 fatcat:mmescynvvrdalgtiebsl2w7aui
« Previous Showing results 1 — 15 out of 101 results