Sciweavers

221 search results - page 5 / 45
» From MITL to Timed Automata
Sort
View
NFM
2011
223views Formal Methods» more  NFM 2011»
13 years 2 months ago
opaal: A Lattice Model Checker
Abstract. We present a new open source model checker, opaal, for automatic verification of models using lattice automata. Lattice automata allow the users to incorporate abstracti...
Andreas Engelbredt Dalsgaard, René Rydhof H...
IANDC
2008
139views more  IANDC 2008»
13 years 7 months ago
Computational complexity of dynamical systems: The case of cellular automata
Abstract. Cellular Automata can be considered discrete dynamical systems and at the same time a model of parallel computation. In this paper we investigate the connections between ...
Pietro di Lena, Luciano Margara
CAV
1994
Springer
113views Hardware» more  CAV 1994»
13 years 11 months ago
A Determinizable Class of Timed Automata
We introduce event-recording automata. An event-recording automaton is a timed automaton that contains, for every event a, a clock that records the time of the last occurrence of a...
Rajeev Alur, Limor Fix, Thomas A. Henzinger
FSEN
2007
Springer
14 years 1 months ago
Zone-Based Universality Analysis for Single-Clock Timed Automata
Abstract. During the last years, timed automata have become a popular model for describing the behaviour of real-time systems. In particular, there has been much research on proble...
Parosh Aziz Abdulla, Joël Ouaknine, Karin Qua...
FOSSACS
2011
Springer
12 years 10 months ago
Minimizing Deterministic Lattice Automata
Traditional automata accept or reject their input, and are therefore Boolean. In contrast, weighted automata map each word to a value from a semiring over a large domain. The speci...
Shulamit Halamish, Orna Kupferman