3229 search results - page 25 / 646 » The Theory of Timed Automata |
CAV
2003
Springer
14 years 1 months ago
2003
Springer
Many verification problems reduce to proving the validity of formulas involving both propositional connectives and domain-specific functions and predicates. This paper presents ...
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...
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...
FUIN
2008
13 years 8 months ago
2008
Abstract. Communicating Hierarchical Transaction-based Timed Automata have been introduced to model systems performing long
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 ...