732 search results - page 1 / 147 » Axiomatising timed automata |
ACTA
2002
13 years 5 months ago
2002
TIME
2005
IEEE
13 years 11 months ago
2005
IEEE
We investigate properties of a spatio-temporal logic based on an n-dimensional Duration Calculus tailored for the specification and verification of mobile real-time systems. Aft...
TCS
1998
13 years 5 months ago
1998
Incomplete relations are relations which contain null values, whose meaning is \value is at present unknown". Such relations give rise to two types of functional dependency (...
CORR
2010
Springer
13 years 2 months ago
2010
Springer
We define a new transfinite time model of computation, infinite time cellular automata. The model is shown to be as powerful than infinite time Turing machines, both on finite and ...
HYBRID
2003
Springer
13 years 10 months ago
2003
Springer
The algorithmic analysis of timed automata is fundamentally limited by the undecidability of the universality problem. For this reason and others, there has been considerable inter...