42 search results - page 3 / 9 » Widening Arithmetic Automata |
CPM
2008
Springer
13 years 7 months ago
2008
Springer
TOCL
2008
13 years 5 months ago
2008
FMSD
2008
13 years 5 months ago
2008
Timed automata are governed by an idealized semantics that assumes a perfectly precise behavior of the clocks. The traditional semantics is not robust because the slightest perturb...
CONCUR
2009
Springer
13 years 12 months ago
2009
Springer
One-counter automata are a fundamental and widely-studied class of infinite-state systems. In this paper we consider one-counter automata with counter updates encoded in binary—...
ATVA
2011
Springer
12 years 5 months ago
2011
Springer
Abstract. In the traditional Boolean setting of formal verification, alternating automata are the key to many algorithms and tools. In this setting, the correspondence between dis...