14 search results - page 1 / 3 » The Power of Reachability Testing for Timed Automata |
FSTTCS
1998
Springer
13 years 9 months ago
1998
Springer
ACRI
2004
Springer
13 years 10 months ago
2004
Springer
Abstract. Cellular Automata are a powerful formal model for describing physical and computational processes. Qualitative analysis of Cellular Automata is in general a hard problem....
TACAS
1998
Springer
13 years 9 months ago
1998
Springer
CAV
2006
Springer
13 years 9 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...
APN
2005
Springer
13 years 7 months ago
2005
Springer
Abstract. We establish mutual translations between the classes of 1safe timed-arc Petri nets (and its extension with testing arcs) and networks of timed automata (and its subclass ...