644 search results - page 40 / 129 » Precedence Automata and Languages |
DLT
2007
15 years 1 months ago
2007
Abstract. Inapproximability results concerning minimization of nondeterministic finite automata relative to given deterministic finite automata were obtained only recently, modul...
117
Voted
SDL
2001
15 years 27 days ago
2001
Abstract. We describe an approach for the verification of quantitative temporal properties of SDL specifications, which adapts techniques developed for timed automata [2]. With res...
112
click to vote
NFM
2011
14 years 6 months ago
2011
Abstract. We present a new open source model checker, opaal, for automatic verification of models using lattice automata. Lattice automata allow the users to incorporate abstracti...
CPAIOR
2004
Springer
15 years 5 months ago
2004
Springer
ng Abstractions for Local Search Pascal Van Hentenryck1 and Laurent Michel2 1 Brown University, Box 1910, Providence, RI 02912 2 University of Connecticut, Storrs, CT 06269-3155 Ab...
FORMATS
2006
Springer
15 years 3 months ago
2006
Springer
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 ...