620 search results - page 71 / 124 » Algorithms and computations on cellular automata |
106
click to vote
IPPS
2003
IEEE
15 years 5 months ago
2003
IEEE
We introduce VLADYMIR, a matrix library that permits the development of array-based code in C++. It is especially useful for numerical simulation tasks and parallelises automatical...
99
Voted
FUIN
2006
15 years 18 days ago
2006
Many different definitions of computational universality for various types of dynamical systems have flourished since Turing's work. We propose a general definition of univers...
104
Voted
ATVA
2005
Springer
15 years 6 months ago
2005
Springer
Abstract. This paper argues that flatness appears as a central notion in the verification of counter automata. A counter automaton is called flat when its control graph can be ...
115
Voted
QEST
2010
IEEE
14 years 10 months ago
2010
IEEE
We introduce Fortuna, the first tool for model checking priced probabilistic timed automata (PPTAs). Fortuna can handle the combination of real-time, probabilistic and cost feature...
138
click to vote
ATVA
2006
Springer
15 years 4 months ago
2006
Springer
Whereas partial order methods have proved their efficiency for the analysis of discrete-event systems, their application to timed systems remains a challenging research topic. Here...