135 search results - page 1 / 27 » Relating timed and register automata |
CORR
2010
Springer
13 years 5 months ago
2010
Springer
FOSSACS
2008
Springer
13 years 6 months ago
2008
Springer
We study complexity issues related to the model-checking problem for LTL with registers (a.k.a. freeze LTL) over one-counter automata. We consider several classes of one-counter au...
WDAG
2005
Springer
13 years 10 months ago
2005
Springer
Atomicity (or linearizability) is a commonly used consistency criterion for distributed services and objects. Although atomic object implementations are abundant, proving that algo...
FORMATS
2006
Springer
13 years 9 months ago
2006
Springer
Timed and weak timed simulation relations are often used to show that operations on hybrid systems result in equivalent behavior or in conservative overapproximations. Given that s...
FORMATS
2010
Springer
13 years 3 months ago
2010
Springer
Abstract. Probabilistic timed automata are an extension of timed automata with discrete probability distributions. Simulation and bisimulation relations are widely-studied in the c...