Sciweavers

756 search results - page 126 / 152
» Can Abstract State Machines Be Useful in Language Theory
Sort
View
INTERACTIONS
2010
109views more  INTERACTIONS 2010»
13 years 6 months ago
The climate change habitability index
rate, the CCHI is defined abstractly as a metric that can be stated in ordinary language and diagrams that allows people to answer the following three questions related to sustaina...
Yue Pan, Chit Meng Cheong, Eli Blevis
ECAI
2008
Springer
13 years 10 months ago
Incremental Diagnosis of DES by Satisfiability
Abstract. We propose a SAT-based algorithm for incremental diagnosis of discrete-event systems. The monotonicity is ensured by a prediction window that uses the future observations...
Alban Grastien, Anbulagan
ISAAC
2007
Springer
135views Algorithms» more  ISAAC 2007»
14 years 2 months ago
Fast Evaluation of Union-Intersection Expressions
Abstract. We show how to represent sets in a linear space data structure such that expressions involving unions and intersections of sets can be computed in a worst-case efficient ...
Philip Bille, Anna Pagh, Rasmus Pagh
ATVA
2005
Springer
132views Hardware» more  ATVA 2005»
14 years 1 months ago
Flat Counter Automata Almost Everywhere!
Abstract. This paper argues that flatness appears as a central notion in the verification of counter automata. A counter automaton is called flat when its control graph can be ...
Jérôme Leroux, Grégoire Sutre
LICS
2009
IEEE
14 years 2 months ago
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 ...
Yang Cai, Ting Zhang, Haifeng Luo