42 search results - page 2 / 9 » Widening Arithmetic Automata |
HYBRID
2000
Springer
13 years 8 months ago
2000
Springer
Abstract. We define a new class of hybrid automata for which reachability is decidable--a proper superclass of the initialized rectangular hybrid automata--by taking parallel compo...
ECAL
1999
Springer
13 years 9 months ago
1999
Springer
In this paper, we present a possible implementation of arithmetic functions (notably, addition and multiplication) using self-replicating cellular automata. The operations are per...
ENTCS
2008
13 years 4 months ago
2008
Team automata are a formalism for the component-based specification of reactive, distributed systems. Their main feature is a flexible technique for specifying coordination patter...
WIA
2004
Springer
13 years 10 months ago
2004
Springer
In this paper we propose a new data structure, called shared automata, for representing deterministic finite automata (DFA). Shared automata admit a strong canonical form for DFA ...
FSTTCS
2006
Springer
13 years 8 months ago
2006
Springer
Abstract Decision procedures underlie many program analysis problems. Traditional program analysis algorithms attempt to prove some property about a single, statically-defined prog...