42 search results - page 3 / 9 » Widening Arithmetic Automata |
69
Voted
CPM
2008
Springer
15 years 2 months ago
2008
Springer
56
Voted
TOCL
2008
15 years 9 days ago
2008
78
Voted
FMSD
2008
15 years 14 days 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
15 years 7 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—...
122
Voted
ATVA
2011
Springer
14 years 12 days 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...