512 search results - page 27 / 103 » Automata as Abstractions |
TACAS
2009
Springer
14 years 3 months ago
2009
Springer
Abstract. In this paper we prove that the transitive closure of a nondeterministic octagonal relation using integer counters can be expressed in Presburger arithmetic. The direct c...
CORR
2010
Springer
13 years 8 months ago
2010
Springer
ir end-to-end deadlines. Real-time Creol can be useful for analyzing, for instance, abstract models of multi-core embedded systems. We show how analysis can be done in UPPAAL.
FOSSACS
2012
Springer
12 years 4 months ago
2012
Springer
Coalgebra offers a unified theory of state based systems, including infinite streams, labelled transition systems and deterministic automata. In this paper, we use the coalgebrai...
CONCUR
1999
Springer
14 years 27 days ago
1999
Springer
Abstract. The paper presents a partial order reduction method applicable to networks of timed automata. The advantage of the method is that it reduces both the number of explored c...
APN
2005
Springer
13 years 10 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 ...