665 search results - page 23 / 133 » The Theory of Hybrid Automata |
BIRTHDAY
2008
Springer
13 years 10 months ago
2008
Springer
Abstract. Church's Problem, stated fifty years ago, asks for a finitestate machine that realizes the transformation of an infinite sequence into an infinite sequence such tha...
HYBRID
2003
Springer
14 years 1 months ago
2003
Springer
Abstract. The use of algorithmic verification and synthesis tools for hybrid systems is currently limited to systems exhibiting simple continuous dynamics such as timed automata o...
FSTTCS
2001
Springer
14 years 1 months ago
2001
Springer
Abstract. Regular Model-Checking (RMC) is a technique for the formal verification of infinite state systems based on the theory of regular languages. In the paper “Beyond Regul...
CONEXT
2007
ACM
14 years 18 days ago
2007
ACM
Deterministic finite automata (DFAs) are widely used to perform regular expression matching in linear time. Several techniques have been proposed to compress DFAs in order to redu...
ACL
1997
13 years 10 months ago
1997
In this paper we describe an approach to constraint based syntactic theories in terms of finite tree automata. The solutions to constraints expressed in weak monadic second order ...