A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Filters
Games, Automata, Logics and Formal Verification (GandALF 2014) – Preface
2017
Information and Computation
Preserved Fulltext
logic on graphs), and automata theory (Parametric Timed Automata, Automata for unordered unranked trees,Tree trasducers). ...
This issue contains a collection of 8 papers that were selected among the 3 invited contributions and the 19 papers accepted for presentation at the Fifth International Symposium on Games, Automata, Logic ...
the problem is 2Exptime-complete, and it remains 2Exptime-hard even for simple fragments of these logics. ...
doi:10.1016/j.ic.2016.07.005
fatcat:4oiouzxwcfh2vfuktawrvodnmu
Graded Computation Tree Logic
[chapter]
2013
Logics in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
To develop a decision procedure for a logic with the tree model property, one first develops an appropriate notion of tree automata and studies their emptiness problem. ...
Extended Abstract Temporal logic is a suitable framework for reasoning about the correctness of concurrent programs. ...
To develop a decision procedure for a logic with the tree model property, one first develops an appropriate notion of tree automata and studies their emptiness problem. ...
doi:10.2991/978-94-91216-95-4_1
fatcat:ip7uqjm5ffe2hpcxger63dw2iu
Graded Computation Tree Logic
2009
2009 24th Annual IEEE Symposium on Logic In Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
To develop a decision procedure for a logic with the tree model property, one first develops an appropriate notion of tree automata and studies their emptiness problem. ...
Extended Abstract Temporal logic is a suitable framework for reasoning about the correctness of concurrent programs. ...
To develop a decision procedure for a logic with the tree model property, one first develops an appropriate notion of tree automata and studies their emptiness problem. ...
doi:10.1109/lics.2009.28
dblp:conf/lics/BiancoMM09
fatcat:5dj7hqhrojbllmauzvaipwn2te
Graded computation tree logic
2012
ACM Transactions on Computational Logic
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
To develop a decision procedure for a logic with the tree model property, one first develops an appropriate notion of tree automata and studies their emptiness problem. ...
Extended Abstract Temporal logic is a suitable framework for reasoning about the correctness of concurrent programs. ...
To develop a decision procedure for a logic with the tree model property, one first develops an appropriate notion of tree automata and studies their emptiness problem. ...
doi:10.1145/2287718.2287725
fatcat:2h62k6brdje2zkxgjgdd36f7na
Reasoning about the past with two-way automata
[chapter]
1998
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
To get this result we develop a theory of two-way alternating automata on in nite trees. ...
Our main result in this paper is an exponential time upper bound for the satis ability problem of the -calculus with both forward and backward modalities. ...
It remains then to solve the emptiness problem for two-way alternating tree automata. Alternating tree automata can be viewed as in nite games 29]; this holds for both one-way and two-ways automata. ...
doi:10.1007/bfb0055090
fatcat:6ce6jqcjzbehjdk5gh4xstnn5y
Page 8134 of Mathematical Reviews Vol. , Issue 2000k
[page]
2000
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
With respect to the operations provided, tree automata as well as sorted unification are used to devise an emptiness test, whereas in the context of tree automata Boolean combinations are studied and in ...
Our results improve on earlier results and strictly extend the known decidable cases. More- over, we show that some of the sort theories considered are closely related to certain tree automata. ...
The Complexity of Enriched μ-Calculi
[chapter]
2006
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2006; you can also visit the original URL.
The file type is application/pdf.
Our results are obtained by introducing two new automata models, showing that their emptiness problems are EXPTIME-complete, and then reducing satisfiability in the relevant logics to this problem. ...
The fully enriched µ-calculus is the extension of the propositional µ-calculus with inverse programs, graded modalities, and nominals. ...
Graded nondeterministic parity tree automata To decide the emptiness problem of 2GAPTs, we use a reduction to the emptiness problem of graded nondeterministic parity tree automata as introduced in [KSV02 ...
doi:10.1007/11787006_46
fatcat:6s5ksezv4ncx7nexvwhzjepn34
The Complexity of the Graded μ-Calculus
[chapter]
2002
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
A natural question that arises is how the generalization of the existential and universal modalities affects the satisfiability problem for the logic and its computational complexity, especially when the ...
We prove that the satisfiability problem for graded -calculus is EXPTIME-complete -not harder than the satisfiability problem for -calculus, even when the numbers in the graded modalities are coded in ...
tree automata and studies their emptiness problem. ...
doi:10.1007/3-540-45620-1_34
fatcat:5nnxd2yym5cx3heewhzupe42zy
Complexity results on branching-time pushdown model checking
2007
Theoretical Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Finally, we prove that the program complexity of the PMC problem against CTL (i.e., the complexity of the problem in terms of the size of the system) is EXPTIME-complete. ...
Moreover, we give a new optimal algorithm to solve this problem based on automata theoretic techniques. ...
The problem remains EXPTIME-complete also for the logic CTL [25] , which corresponds to a fragment of the alternation-free modal µ-calculus. ...
doi:10.1016/j.tcs.2007.03.049
fatcat:hyec3kfvjfei3fajhluavfnzje
Complexity Results on Branching-Time Pushdown Model Checking
[chapter]
2005
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Finally, we prove that the program complexity of the PMC problem against CTL (i.e., the complexity of the problem in terms of the size of the system) is EXPTIME-complete. ...
Moreover, we give a new optimal algorithm to solve this problem based on automata theoretic techniques. ...
The problem remains EXPTIME-complete also for the logic CTL [25] , which corresponds to a fragment of the alternation-free modal µ-calculus. ...
doi:10.1007/11609773_5
fatcat:xztm377znve7blksomhfnd7ctu
Extended Computation Tree Logic
[chapter]
2010
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Other Versions
In addition, we analyse the complexity of satisfiability and compare the expressive power of these logics to CTL* and extensions of PDL. ...
We introduce a generic extension of the popular branching-time logic CTL which refines the temporal until and release operators with formal languages. ...
Introduction Computation Tree Logic (CTL) is one of the main logical formalisms for program specification and verification. ...
doi:10.1007/978-3-642-16242-8_6
fatcat:4pvdbae6fbdkpmtiha4mnlrzyy
PDL with negation of atomic programs
2005
Journal of Applied Non-Classical Logics
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2012; you can also visit the original URL.
The file type is application/pdf.
We argue that this logic is still useful, e.g. in the context of description logics, and prove that satisfiability is decidable and ExpTime-complete using an approach based on Büchi tree automata. ...
Propositional dynamic logic (PDL) is one of the most successful variants of modal logic. To make it even more useful for applications, many extensions of PDL have been considered in the literature. ...
We start with introducing Büchi tree automata. Given a Büchi automaton B, the problem whether its language is empty, i.e., whether it holds that L(B) = ∅, is called the emptiness problem. ...
doi:10.3166/jancl.15.189-213
fatcat:7yhetwfn2bgj5iopwisey2apm4
PDL with Negation of Atomic Programs
[chapter]
2004
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2012; you can also visit the original URL.
The file type is application/pdf.
We argue that this logic is still useful, e.g. in the context of description logics, and prove that satisfiability is decidable and ExpTime-complete using an approach based on Büchi tree automata. ...
Propositional dynamic logic (PDL) is one of the most successful variants of modal logic. To make it even more useful for applications, many extensions of PDL have been considered in the literature. ...
We start with introducing Büchi tree automata. Given a Büchi automaton B, the problem whether its language is empty, i.e., whether it holds that L(B) = ∅, is called the emptiness problem. ...
doi:10.1007/978-3-540-25984-8_18
fatcat:a4axkpousze7bke7vado37c4y4
Automatic Abstraction Using Generalized Model Checking
[chapter]
2002
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
We study the cost needed to improve precision by presenting new upper and lower bounds for the complexity of generalized model checking in the size of the abstraction. ...
In the context of automatic abstraction, generalized model checking means checking whether there exists a concretization of an abstraction that satisfies a temporal logic formula. ...
The problem of checking emptiness of nondeterministic Büchi tree automata is reducible in linear time and logarithmic space to the generalized model-checking problem for LTL properties represented by nondeterministic ...
doi:10.1007/3-540-45657-0_11
fatcat:pq2p3k4hgjcvbef35ziwvs3kta
The mu-calculus and Model Checking
[chapter]
2018
Handbook of Model Checking
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Finally, the chapter discusses the relations of the mu-calculus to monadic second-order logic as well as to some program and temporal logics. ...
The mu-calculus is one of the most important logics in model-checking. It is a logic with an exceptional balance between expressiveness and algorithmic properties. ...
As stated in Theorem 8, the model-checking problem is equivalent to checking emptiness of nondeterministic parity automata on infinite trees. ...
doi:10.1007/978-3-319-10575-8_26
fatcat:7adhegoggvcjthaa5x5uhfpt24
« Previous
Showing results 1 — 15 out of 2,149 results