Sciweavers

3229 search results - page 48 / 646
» The Theory of Timed Automata
Sort
View
ENTCS
2007
117views more  ENTCS 2007»
13 years 8 months ago
Relating Hybrid Chi to Other Formalisms
The hybrid χ (Chi) formalism is suited to modeling, simulation and verification of hybrid systems. It integrates concepts from dynamics and control theory with concepts from com...
D. A. van Beek, J. E. Rooda, Ramon R. H. Schiffele...
COLT
1999
Springer
14 years 1 months ago
On Theory Revision with Queries
Abstract. A brief overview is given of recent results on theory revision with queries for propositional formulas, such as monotone and unate DNF, Horn formulas, read-once formulas,...
Robert H. Sloan, György Turán
FORMATS
2006
Springer
14 years 12 days ago
Undecidable Problems About Timed Automata
We solve some decision problems for timed automata which were raised by S. Tripakis in [Tri04] and by E. Asarin in [Asa04]. In particular, we show that one cannot decide whether a ...
Olivier Finkel
MST
2011
206views Hardware» more  MST 2011»
13 years 3 months ago
Weighted Logics for Unranked Tree Automata
: We define a weighted monadic second order logic for unranked trees and the concept of weighted unranked tree automata, and we investigate the expressive power of these two conce...
Manfred Droste, Heiko Vogler
LATA
2009
Springer
14 years 3 months ago
Decision Problems for Convex Languages
We examine decision problems for various classes of convex languages, previously studied by Ang and Brzozowski under the name “continuous languages”. We can decide whether a la...
Janusz A. Brzozowski, Jeffrey Shallit, Zhi Xu