Sciweavers

732 search results - page 85 / 147
» Axiomatising timed automata
Sort
View
SERA
2007
Springer
14 years 1 months ago
A Formal Approach to Test the Robustness of Embedded Systems using Behaviour Analysis
Robustness is an important feature required for embedded systems. This paper presents a methodology to test robustness of such systems. We investigate system behaviour aspects. We...
Antoine Rollet, Fares Saad-Khorchef
FATES
2004
Springer
14 years 1 months ago
Online Testing of Real-time Systems Using Uppaal
We present the development of T-UPPAAL — a new tool for online black-box testing of real-time embedded systems from non-deterministic timed automata specifications. It is based ...
Kim Guldstrand Larsen, Marius Mikucionis, Brian Ni...
TCS
2008
13 years 7 months ago
Temporal constraints in the logical analysis of regulatory networks
Starting from the logical description of gene regulatory networks developed by R. Thomas, we introduce an enhanced modelling approach based on timed automata. We obtain a refined ...
Heike Siebert, Alexander Bockmayr
ICS
2010
Tsinghua U.
14 years 5 months ago
Cryptography by Cellular Automata or How Fast Can Complexity Emerge in Nature?
Computation in the physical world is restricted by the following spatial locality constraint: In a single unit of time, information can only travel a bounded distance in space. A ...
Benny Applebaum, Yuval Ishai, Eyal Kushilevitz
JCSS
2008
90views more  JCSS 2008»
13 years 7 months ago
Fault tolerance in cellular automata at high fault rates
A commonly used model for fault-tolerant computation is that of cellular automata. The essential difficulty of fault-tolerant computation is present in the special case of simply ...
Mark McCann, Nicholas Pippenger