Filters








628 Hits in 6.7 sec

Page 1442 of Mathematical Reviews Vol. , Issue 2000b [page]

2000 Mathematical Reviews  
In this paper we consider the extension of branching temporal log- ics with existential quantification over atomic propositions.  ...  equivalences is undecidable.” 2000b:68152 68Q60 03B44 03B70 Kupferman, Orna (1-CA-C; Berkeley, CA) Augmenting branching temporal logics with existential quantification over atomic propositions.  ... 

Once and for all

Orna Kupferman, Amir Pnueli, Moshe Y. Vardi
2012 Journal of computer and system sciences (Print)  
It has long been known that past-time operators add no expressive power to linear temporal logics. In this paper, we consider the extension of branching temporal logics with past-time operators.  ...  Two possible views regarding the nature of past in a branching-time model induce two different such extensions.  ...  A logic PCTL , which augments the branching temporal logic CTL with past-time connectives, is introduced in [17] . Formulas of PCTL are interpreted over computation trees.  ... 
doi:10.1016/j.jcss.2011.08.006 fatcat:tk3kr3kx3veyhezicrixui226i

Quantified CTL: Expressiveness and Complexity

François Laroussinie, Nicolas Markey, Orna Kupferman
2014 Logical Methods in Computer Science  
While it was defined long ago, the extension of CTL with quantification over atomic propositions has never been studied extensively.  ...  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  ...  (Propositional) quantification was first used in temporal logics by Sistla and others, both for linear-time [Sis83, SVW87] and branching-time temporal logics [ES84] , mainly with the aim of augmenting  ... 
doi:10.2168/lmcs-10(4:17)2014 fatcat:vo2dvygxdncstierkzx3fenx2u

Reasoning about Quality and Fuzziness of Strategic Behaviours

Patricia Bouyer, Orna Kupferman, Nicolas Markey, Bastien Maubert, Aniello Murano, Giuseppe Perelli
2019 Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence  
logics.  ...  We introduce and study SL[F], a quantitative extension of SL (Strategy Logic), one of the most natural and expressive logics describing strategic behaviours.  ...  The logic LTL[F] is a multi-valued logic that augments LTL with quality operators [Almagor et al., 2016] .  ... 
doi:10.24963/ijcai.2019/220 dblp:conf/ijcai/BouyerKMMMP19 fatcat:unspqc26hrcd3kkslmrpzget5u

Extended Temporal Logic Revisited [chapter]

Orna Kupferman, Nir Piterman, Moshe Y. Vardi
2001 Lecture Notes in Computer Science  
This includes augmenting LTL with quantification over atomic propositions, resulting in QLTL [LPZ85,SVW87,MP92], and augmenting LTL with fixed-point operators, resulting in the linear b -calculus [BB87  ...  Early extensions of linear temporal logic with automata use nondeterministic Büchi automata.  ...  Temporal logics augment propositional logics with temporal modalities, making it possible to describe a sequence of events in time.  ... 
doi:10.1007/3-540-44685-0_35 fatcat:nrex2uqzpvbq5fq3ejmtcbptoa

Results on Alternating-Time Temporal Logics with Linear Past

Laura Bozzelli, Aniello Murano, Loredana Sorrentino, Michael Wagner
2018 International Symposium/Workshop on Temporal Representation and Reasoning  
Moreover, we prove that both satisfiability and model-checking for the logic ATL lp are Exptime-complete.  ...  We show that ATL lp is strictly more expressive than ATL, and interestingly, it can be exponentially more succinct than the more expressive logic ATL * .  ...  Intuitively an n-word is obtained from ν = a 1 , . . . , a 2 n • {#} by augmenting some T I M E 2 0 1 8 6:8 Results on Alternating-Time Temporal Logics with Linear Past non-last symbols in ν with proposition  ... 
doi:10.4230/lipics.time.2018.6 dblp:conf/time/BozzelliMS18 fatcat:byb46ikrprbpzbjeazxfmnr57i

Verification of gap-order constraint abstractions of counter systems

Laura Bozzelli, Sophie Pinchinat
2014 Theoretical Computer Science  
Next, we consider a constrained branching-time logic, GCCTL * , obtained by enriching CTL * with GC, thus enabling expressive properties and subsuming the setting of [12] .  ...  We investigate verification problems for gap-order constraint systems (GCS), an (infinitely-branching) abstract model of counter machines, in which constraints (over Z) between the variables of the source  ...  In order to specify behavioral properties of counter systems, standard propositional linear-time temporal logics (like LTL) and propositional branching-time temporal logics (like CTL * ) can be extended  ... 
doi:10.1016/j.tcs.2013.12.002 fatcat:dgb36zt3xvdtdokegedzrfnhfm

Flow Logic

Orna Kupferman, Gal Vardi, Marc Herbstritt
2017 International Conference on Concurrency Theory  
The syntax of our logic BFL (Branching Flow Logic) is similar to the syntax of the temporal logic CTL , except that atomic assertions may be flow propositions, like > γ or ≥ γ, for γ ∈ IN, which refer  ...  Our extensions include flow quantifications that range over non-integral flow functions or over maximal flow functions, path quantification that ranges over paths along which non-zero flow travels, past  ...  The syntax of our logic BFL (Branching Flow Logic) is similar to the syntax of the temporal logic CTL , except that atomic assertions are built from both atomic propositions and flow propositions, like  ... 
doi:10.4230/lipics.concur.2017.9 dblp:conf/concur/KupfermanV17 fatcat:fs5afwn5cbdrbmytlob3g5zqle

What Makes Atl* Decidable? A Decidable Fragment of Strategy Logic [chapter]

Fabio Mogavero, Aniello Murano, Giuseppe Perelli, Moshe Y. Vardi
2012 Lecture Notes in Computer Science  
We focus, in this work, on the limitation of ATL * to allow only one temporal goal for each strategic assertion and study the fragment of SL with the same restriction.  ...  strategy quantification of agents.  ...  Formally, it is obtained as a generalization of the branching-time temporal logic CTL * [6] , where the path quantifiers there exists "E" and for all "A" are replaced with strategic modalities of the  ... 
doi:10.1007/978-3-642-32940-1_15 fatcat:d3rdgrnatrda3iansx6lrvxr7q

Little Engines of Proof [chapter]

Natarajan Shankar
2002 Lecture Notes in Computer Science  
procedures for integers and reals, and abstraction methods for finitely approximating problems over infinite domains.  ...  In recent years, several high quality inference engines have been developed, including propositional satisfiability solvers, ground decision procedures for equality and arithmetic, quantifier elimination  ...  In a propositional logic formula, all variables are implicitly universally quantified. One obvious extension is the introduction of Boolean existential and universal quantification.  ... 
doi:10.1007/3-540-45614-7_1 fatcat:6my3fmm6xjb4vfj6sxly46xbxa

Flow Logic

Orna Kupferman, Gal Vardi
2018 Logical Methods in Computer Science  
The syntax of our logic BFL (Branching Flow Logic) is similar to the syntax of the temporal logic CTL , except that atomic assertions are built from both atomic propositions and flow propositions, like  ...  The syntax of our logic BFL (Branching Flow Logic) is similar to the syntax of the temporal logic CTL , except that atomic assertions may be flow propositions, like > γ or ≥ γ, for γ ∈ IN, which refer  ...  For example, real-time temporal logics include clocks with a real-time domain [AH94] , epistemic temporal logics include knowledge operators [HM90] , and alternating temporal logics include game modalities  ... 
doi:10.23638/lmcs-15(4:9)2019 fatcat:xypfxbz3hrhffcl3rsdfgu4pxu

Memory Event Clocks [chapter]

James Jerson Ortiz, Axel Legay, Pierre-Yves Schobbens
2010 Lecture Notes in Computer Science  
It turns out to have the same expressiveness as the Temporal Logic with Counting (TLC) of Hirshfeld and Rabinovich. We then examine automata with recursive memory event clocks (RMECA).  ...  When we introduce these clocks in the linear temporal logic of the reals, we create Recursive Memory Event Clocks Temporal Logic (RMECTL).  ...  Temporal Logic with Counting The Temporal Logic with Counting [13] is an extension of the Temporal Logic of the Reals with Past by counting modalities.  ... 
doi:10.1007/978-3-642-15297-9_16 fatcat:yum7ozvfq5aajhvlszs6bqante

Flow Logic [article]

Orna Kupferman, Gal Vardi
2019 arXiv   pre-print
The syntax of our logic BFL* (Branching Flow Logic) is similar to the syntax of the temporal logic CTL*, except that atomic assertions may be flow propositions, like > γ or ≥γ, for γ∈N, which refer to  ...  Our extensions include flow quantifications that range over non-integral flow functions or over maximal flow functions, path quantification that ranges over paths along which non-zero flow travels, past  ...  For example, real-time temporal logics include clocks with a real-time domain [AH94] , epistemic temporal logics include knowledge operators [HM90] , and alternating temporal logics include game modalities  ... 
arXiv:1806.05956v3 fatcat:llfeuan56jaojbkusqqpm3pw7e

Automated deduction for verification

Natarajan Shankar
2009 ACM Computing Surveys  
Various modal and temporal logics extend propositional logic to reason about modalities like time, necessity, knowledge, and belief over propositions.  ...  Higher-order logic allows quantification over functions and predicates and is suitable for modeling computation at varying levels of abstraction and for formalizing much of classical mathematics.  ...  Bill Mc-Cune and Matt Kaufmann responded with clarifications on specific points.  ... 
doi:10.1145/1592434.1592437 fatcat:satgicglyneqvl2nw5pjnr3d3a

Sometimes and not never re-revisited: on branching versus linear time [chapter]

Moshe Y. Vardi
1998 Lecture Notes in Computer Science  
In the first approach we associate with each LTL formula ~/, a CTL formula ~Pa that is obtained from ~/, by preceding each temporal operator by the universal path quantifier A.  ...  In particular, the computational advantage of CTL model checking over LTL model checking makes CTL a popular choice, leading to efficient model-cbecking tools for this logic.  ...  Finally, the branching temporal logic VCTL is a fragment of CTL in which only universal path quantification is allowed.  ... 
doi:10.1007/bfb0055612 fatcat:72bzf54arjdyvdizcbjbm7inwa
« Previous Showing results 1 — 15 out of 628 results