1246 search results - page 65 / 250 » Recursive Timed Automata |
100
Voted
ANTS
2004
Springer
15 years 6 months ago
2004
Springer
The binary algorithm is a variant of the Euclidean algorithm that performs well in practice. We present a quasi-linear time recursive algorithm that computes the greatest common di...
103
Voted
ICFP
2004
ACM
16 years 21 days ago
2004
ACM
We study a type system equipped with universal types and equirecursive types, which we refer to as F?. We show that type equality may be decided in time O(n log n), an improvement...
CAV
2007
Springer
15 years 7 months ago
2007
Springer
In this paper we propose a complete chain for synthesizing controllers from high-level specifications. From real-time properties expressed in the logic MTL we generate, under boun...
TIME
2002
IEEE
15 years 5 months ago
2002
IEEE
Events employed in natural language semantics are characterized in terms of regular languages, each string in which can be regarded as a motion picture. The relevant finite autom...
101
Voted
APAL
2006
15 years 25 days ago
2006
We show that--unlike products of `transitive' modal logics which are usually undecidable-their `expanding domain' relativisations can be decidable, though not in primiti...