Filters








156 Hits in 3.7 sec

An automata-theoretic approach to branching-time model checking (Extended abstract) [chapter]

Orna Bernholtz, Moshe Y. Vardi, Pierre Wolper
1994 Lecture Notes in Computer Science  
In this paper we show that alternating tree automata are the key to a comprehensive automata-theoretic framework for branching temporal logics.  ...  Translating linear temporal logic formulas to automata has proven to be an effective approach for implementing linear-time model-checking, and for obtaining many extensions and improvements to this verification  ...  For branching temporal logics, the automata-theoretic counterpart are automata on infinite trees.  ... 
doi:10.1007/3-540-58179-0_50 fatcat:uwvhl43uvjht3ok7epblznjduy

Page 4291 of Mathematical Reviews Vol. , Issue 94h [page]

1994 Mathematical Reviews  
Summary: “An automata-theoretic framework for branching-time temporal logics is presented.  ...  Katalin Bimb6 (1-IN-Q; Bloomington, IN) 94h:03038 03B45 03B70 03D05 68Q70 Bernholtz, Orna (IL-TECH-C; Haifa); Griimberg, Orna (1-BELL; Murray Hill, NJ) Branching time temporal logic and amorphous tree  ... 

On Bounded Specifications [chapter]

Orna Kupferman, MosheY. Vardi
2001 Lecture Notes in Computer Science  
by tree automata or temporal logic formulas, even for trees with infinite branching degrees.  ...  There, we can identify a bound and translate clopen specifications to cycle-free automata and modal logic.  ...  Modal logic (ML) is a branching temporal logic in which the only temporal operators are and a set Ë is open if every element in Ë has a nonempty "neighborhood" contained in Ë, and a set Ë is closed if  ... 
doi:10.1007/3-540-45653-8_2 fatcat:p5oav4pnifa4jphksm5ufstt2q

An automata-theoretic approach to branching-time model checking

Orna Kupferman, Moshe Y. Vardi, Pierre Wolper
2000 Journal of the ACM  
In this paper we show that alternating tree automata are the key to a comprehensive automata-theoretic framework for branching temporal logics.  ...  Translating linear temporal logic formulas to automata has proven to be an effective approach for implementing linear-time model-checking, and for obtaining many extensions and improvements to this verification  ...  For branching temporal logics, the automata-theoretic counterpart are automata over infinite trees [Rab69, VW86b] .  ... 
doi:10.1145/333979.333987 fatcat:ae75n7kvkbgfzd7aiedmea6ypa

Page 4093 of Mathematical Reviews Vol. , Issue 94g [page]

1994 Mathematical Reviews  
Jeppesen and Kim Guldstrand Larsen, Model construction for implicit specifications in modal logic (247-261); Orna Bernholtz and Orna Griimberg, Branching time temporal logic and amorphous tree automata  ...  lin- ear temporal logic (207-221); Ursula Goltz, Ruurd Kuiper and Wojciech Penczek, Propositional temporal logics and equivalences (222-236); Eric Goubault and Thomas P.  ... 

Specifying Robustness [article]

John C. McCabe-Dansted, Tim French, Mark Reynolds, Sophie Pinchinat
2013 arXiv   pre-print
We also compare RoCTL* to Quantified CTL* (QCTL*) and hybrid logics.  ...  This paper proposes a new logic RoCTL* to model robustness in concurrent systems.  ...  INTRODUCTION We introduce the Robust Full Computation Tree Logic (RoCTL*) as an extension of the branching time temporal logic CTL* to represent issues relating to robustness and reliability in systems  ... 
arXiv:1309.4416v1 fatcat:nhyueevfhjf6bfqwlsg7ezlpwm

Model Checking Stochastic Branching Processes [chapter]

Taolue Chen, Klaus Dräger, Stefan Kiefer
2012 Lecture Notes in Computer Science  
In a second part, we suggest a tree extension of the logic PCTL, and develop a PSPACE algorithm for model checking a branching process against a formula of this logic.  ...  Given a branching process and a deterministic parity tree automaton, we are interested in computing the probability that the generated random tree is accepted by the automaton.  ...  Logic Specifications In this section, we propose a logic akin to PCTL, called probabilistic tree temporal logic, to specify the properties of random trees generated from a branching process.  ... 
doi:10.1007/978-3-642-32589-2_26 fatcat:idxbge3xezebzae4bbhvuk5j6u

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  ...  (showing that the structure semantics populates the polynomial hierarchy while the tree semantics populates the exponential hierarchy).  ...  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

Model Checking Stochastic Branching Processes [article]

Taolue Chen and Klaus Dräger and Stefan Kiefer
2012 arXiv   pre-print
In a second part, we suggest a tree extension of the logic PCTL, and develop a PSPACE algorithm for model checking a branching process against a formula of this logic.  ...  Given a branching process and a deterministic parity tree automaton, we are interested in computing the probability that the generated random tree is accepted by the automaton.  ...  Logic Specifications In this section, we propose a logic akin to PCTL, called probabilistic tree temporal logic, to specify the properties of random trees generated from a branching process.  ... 
arXiv:1206.1317v1 fatcat:kiof4qcefjae5pbvrr6hjxd4ni

Quantified CTL with imperfect information [article]

Raphaël Berthon, Bastien Maubert, Aniello Murano
2018 arXiv   pre-print
Quantified CTL (QCTL) is a well-studied temporal logic that extends CTL with quantification over atomic propositions.  ...  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.  ...  Conversely, in branching-time temporal logics such as CTL [8] and CTL * [16] , each moment in time may split into various possible futures; existential and universal quantifiers then allow expressing  ... 
arXiv:1611.03524v4 fatcat:t2jns6wwmrfobj3jfqh5v5fx2m

Decidability of Propositionally Quantified Logics of Knowledge [chapter]

Tim French
2003 Lecture Notes in Computer Science  
The new semantics interpret propositional (local and non-local) quantification with respect to bisimulations, and the satisfiability problem is shown to be solvable via an embedding into the temporal logic  ...  Logics of knowledge have important applications for reasoning about security protocols and multi-agent systems.  ...  The decidability process described above is particularly appropriate for QCTL since trees are a natural model for branching temporal logics.  ... 
doi:10.1007/978-3-540-24581-0_30 fatcat:kd2tcz7ilzb47lfcxidiqoo3le

Spatial Sorting Algorithms for Parallel Computing in Networks

Max OrHai, Christof Teuscher
2011 2011 Fifth IEEE Conference on Self-Adaptive and Self-Organizing Systems Workshops  
, using particle systems and asynchronous automata graphs.  ...  In both cases we are able to get significant speed-ups of these naïve O(n 2 ) algorithms, attaining linear time complexity or better given sufficient parallelism.  ...  Atoms' Reconfigurable Asynchronous Logic Automata [12] .  ... 
doi:10.1109/sasow.2011.10 dblp:conf/saso/OrHaiT11 fatcat:lrf36exvcrecdnkjohlydxq2pe

Robust Vacuity for Branching Temporal Logic

Arie Gurfinkel, Marsha Chechik
2012 ACM Transactions on Computational Logic  
We show that trace vacuity is not robust for branching time logic.  ...  We further refine the notion of vacuity so that it applies uniformly to linear and branching time logic and does not suffer from the common pitfalls of prior definitions.  ...  Temporal Logic Computation Tree Logic CTL * [Emerson and Halpern 1985] is a branching-time temporal logic constructed from propositional connectives, temporal operators X (next), U (until), F (future  ... 
doi:10.1145/2071368.2071369 fatcat:ie7fwooqqfeihay2rl3doo2qqe

Chapter 3 Description Logics [chapter]

Franz Baader, Ian Horrocks, Ulrike Sattler
2008 Foundations of Artificial Intelligence  
and automata based techniques; and the computational complexity of basic reasoning problems.  ...  Next, we will discuss the relationship between description logics and other formalisms, in particular first order and modal logics; the most commonly used reasoning techniques, in particular tableau, resolution  ...  Instead of considering automata working on trees of fixed arity, one could also consider so-called amorphous tree automata [31, 105] , which can deal with arbitrary branching.  ... 
doi:10.1016/s1574-6526(07)03003-9 fatcat:wa2lwv7ywrhvpnk3emfqv2pgyu

Robust Vacuity for Branching Temporal Logic [article]

Arie Gurfinkel, Marsha Chechik
2010 arXiv   pre-print
We show that trace vacuity is not robust for branching time logic. We refine it to apply uniformly to linear and branching time logic and to not suffer from the common pitfalls of prior definitions.  ...  There is a growing interest in techniques for detecting whether a logic specification is satisfied too easily, or vacuously.  ...  Temporal Logic Computation Tree Logic CTL * [Emerson and Halpern 1985] is a branching-time temporal logic constructed from propositional connectives, temporal operators X (next), U (until), F (future  ... 
arXiv:1002.4616v2 fatcat:xtcoi46vcff73awtof2i2vxh6i
« Previous Showing results 1 — 15 out of 156 results