Results 1  10
of
11
Temporal and modal logic
 HANDBOOK OF THEORETICAL COMPUTER SCIENCE
, 1995
"... We give a comprehensive and unifying survey of the theoretical aspects of Temporal and modal logic. ..."
Abstract

Cited by 1300 (17 self)
 Add to MetaCart
(Show Context)
We give a comprehensive and unifying survey of the theoretical aspects of Temporal and modal logic.
Fairness and Hyperfairness
, 2000
"... The notion of fairness in tracebased formalisms is examined. It is argued that, in general, fairness means machine closure. The notion of hyperfairness introduced by Attie, Francez, and Grumberg is generalized to arbitrary action systems. Also examined are the fairness criteria proposed by Apt, Fra ..."
Abstract

Cited by 27 (0 self)
 Add to MetaCart
(Show Context)
The notion of fairness in tracebased formalisms is examined. It is argued that, in general, fairness means machine closure. The notion of hyperfairness introduced by Attie, Francez, and Grumberg is generalized to arbitrary action systems. Also examined are the fairness criteria proposed by Apt, Francez, and Katz.
An Improved Lower Bound for the Complementation of Rabin Automata
"... Automata on infinite words (ωautomata) have wide applications in formal language theory as well as in modeling and verifying reactive systems. Complementation ofωautomata is a crucial instrument in many these applications, and hence there have been great interests in determining the state complexit ..."
Abstract

Cited by 9 (3 self)
 Add to MetaCart
Automata on infinite words (ωautomata) have wide applications in formal language theory as well as in modeling and verifying reactive systems. Complementation ofωautomata is a crucial instrument in many these applications, and hence there have been great interests in determining the state complexity of the complementation problem. However, obtaining nontrivial lower bounds has been difficult. For the complementation of Rabin automata, a significant gap exists between the stateoftheart lower bound 2Ω(N lg N) and upper bound 2Ω(kN lg N) , where k, the number of Rabin pairs, can be as large as 2N. In this paper we introduce multidimensional rankings to the full automata technique. Using the improved technique we establish an almost tight lower bound for the complementation of Rabin automata. We also
A Tight Lower Bound for Streett Complementation
, 2011
"... Finite automata on infinite words (ωautomata) proved to be a powerful weapon for modeling and reasoning infinite behaviors of reactive systems. Complementation of ωautomata is crucial in many of these applications. But the problem is nontrivial; even after extensive study during the past 50 years ..."
Abstract

Cited by 6 (2 self)
 Add to MetaCart
Finite automata on infinite words (ωautomata) proved to be a powerful weapon for modeling and reasoning infinite behaviors of reactive systems. Complementation of ωautomata is crucial in many of these applications. But the problem is nontrivial; even after extensive study during the past 50 years, a handful of interesting problems remain unanswered, one of which is the complexity of Streett complementation (complementation of Streett automata). The best construction for complementing a Streett automaton with n states and k Streett pairs, is 2 O(nklgnk) , which is significantly higher than the best lower bound 2 Ω(nlgnk). In this paper we improve the lower bound to 2 Ω(nlgn+nklgk) for k = O(n) and to 2 Ω(n2 lgn) for k = ω(n), which exactly matches the upper bound obtained in [4]. 1
Tight upper bounds for Streett and parity complementation
 In Proc
"... Complementation of finite automata on infinite words is not only a fundamental problem in automata theory, but also serves as a cornerstone for solving numerous decision problems in mathematical logic, modelchecking, program analysis and verification. For Streett complementation, a significant gap ..."
Abstract

Cited by 6 (2 self)
 Add to MetaCart
Complementation of finite automata on infinite words is not only a fundamental problem in automata theory, but also serves as a cornerstone for solving numerous decision problems in mathematical logic, modelchecking, program analysis and verification. For Streett complementation, a significant gap exists between the current lower bound 2Ω(n lgnk) and upper bound 2O(nk lgnk), where n is the state size, k is the number of Streett pairs, and k can be as large as 2n. Determining the complexity of Streett complementation has been an open question since the late 80’s. In this paper we show a complementation construction with upper bound 2O(n lgn+nk lg k) for k = O(n) and 2O(n2 lgn) for k = ω(n), which matches well the lower bound obtained in [3]. We also obtain a tight upper bound 2O(n lgn) for parity complementation.
The Limit View of Infinite Computations
, 1994
"... We show how to view computations involving very general liveness properties as limits of finite approximations. This computational model does not require introduction of infinite nondeterminism as with most traditional approaches. Our results allow us directly to relate finite computations in or ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
(Show Context)
We show how to view computations involving very general liveness properties as limits of finite approximations. This computational model does not require introduction of infinite nondeterminism as with most traditional approaches. Our results allow us directly to relate finite computations in order to infer properties about infinite computations.
1 Enhancing ABC for LTL Stabilization Verification of SystemVerilog/VHDL Models
"... Abstract—We describe a tool which combines a commercial frontend with a version of the model checker, ABC, enhanced to handle a subset of LTL properties. Our tool, VeriABC, provides a solution at the RTL level and produces models for synthesis and formal verification purposes. We use Verific (a com ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
(Show Context)
Abstract—We describe a tool which combines a commercial frontend with a version of the model checker, ABC, enhanced to handle a subset of LTL properties. Our tool, VeriABC, provides a solution at the RTL level and produces models for synthesis and formal verification purposes. We use Verific (a commercial software) as the generic parser platform for SystemVerilog and VHDL designs. VeriABC traverses the Verific netlist database structure and produces a formal model in the AIGER format. LTL can be specified using SVA 2009 constructs that are processed by Verific. VeriABC traverses the resulting SVA parse trees and produces equivalent LTL formulae using the F,G, Until and X operators. The model checker in ABC has been enhanced to handles LTL stabilization properties, an important subset of LTL. The paper presents VeriABC’s implementation strategy, software architecture, tool flow, environment setup for formal verification, use model, the specification of properties in SVA and translation into LTL. Finally the properties are translated into safety properties that can be verified by the ABC model checker. I.
Abstract
"... Valiant’s theory of holographic algorithms is a novel methodology to achieve exponential speedups in computation. A fundamental parameter in holographic algorithms is the dimension of the linear basis vectors. We completely resolve the problem of the power of higher dimensional bases. We prove that ..."
Abstract
 Add to MetaCart
Valiant’s theory of holographic algorithms is a novel methodology to achieve exponential speedups in computation. A fundamental parameter in holographic algorithms is the dimension of the linear basis vectors. We completely resolve the problem of the power of higher dimensional bases. We prove that 2dimensional bases are universal for holographic algorithms. 1
Determinization Complexities of ω AutomataI
"... Complementation and determinization are two fundamental notions in automata theory. The close relationship between the two has been well observed in the literature. In the case of nondeterministic finite automata on finite words (NFA), complementation and determinization have the same state comple ..."
Abstract
 Add to MetaCart
Complementation and determinization are two fundamental notions in automata theory. The close relationship between the two has been well observed in the literature. In the case of nondeterministic finite automata on finite words (NFA), complementation and determinization have the same state complexity, namely Θ(2n) where n is the state size. The same similarity between determinization and complementation was found for Büchi automata, where both operations were shown to have 2Θ(n lgn) state complexity. An intriguing question is whether there exists a type of ωautomata whose determinization is considerably harder than its complementation. In this paper, we show that for all common types of ωautomata, the determinization problem has the same state complexity as the corresponding complementation problem at the granularity of 2Θ(·).