84 search results - page 4 / 17 » The Computational Power of Benenson Automata |
CAV
2006
Springer
14 years 1 months ago
2006
Springer
This paper addresses the problem of computing symbolically the set of reachable configurations of a linear hybrid automaton. A solution proposed in earlier work consists in explori...
CONCUR
2001
Springer
14 years 2 months ago
2001
Springer
A key issue in the design of a model-checking tool is the choice of the formal language with which properties are specified. It is now recognized that a good language should exten...
CONCUR
2009
Springer
14 years 4 months ago
2009
Springer
FCT
2005
Springer
14 years 3 months ago
2005
Springer
We show that a slightly extended version of asynchronous cellular automata, relative to any class of pomsets and dags without autoconcurrency, has the same expressive power as the ...
SOFSEM
2010
Springer
14 years 6 months ago
2010
Springer
We introduce a model of automaton for picture language recognition which is based on tiles and is called Wang automaton, since its description relies on the notation of Wang system...