Sciweavers

223 search results - page 36 / 45
» Synchronization of Pushdown Automata
Sort
View
TACAS
2010
Springer
342views Algorithms» more  TACAS 2010»
14 years 2 months ago
SAT Based Bounded Model Checking with Partial Order Semantics for Timed Automata
We study the model checking problem of timed automata based on SAT solving. Our work investigates alternative possibilities for coding the SAT reductions that are based on parallel...
Janusz Malinowski, Peter Niebert
IPPS
2006
IEEE
14 years 1 months ago
On-chip and on-line self-reconfigurable adaptable platform: the non-uniform cellular automata case
In spite of the high parallelism exhibited by cellular automata architectures, most implementations are usually run in software. For increasing execution parallelism, hardware imp...
Andres Upegui, Eduardo Sanchez
FBT
1998
119views Formal Methods» more  FBT 1998»
13 years 8 months ago
Modeling a Production Cell as a Distributed Real-Time System with Cottbus Timed Automata
We build on work in designing modeling languages for hybrid systems in the development of CTA, the Cottbus Timed Automata. Our design features a facility to specify a hybrid system...
Dirk Beyer, Heinrich Rust
RTS
2008
131views more  RTS 2008»
13 years 7 months ago
Formal verification of multitasking applications based on timed automata model
The aim of this paper is to show, how a multitasking application running under a real-time operating system compliant with an OSEK/VDX standard can be modeled by timed automata. Th...
Libor Waszniowski, Zdenek Hanzálek
CORR
2010
Springer
79views Education» more  CORR 2010»
13 years 4 months ago
Probabilistic cellular automata, invariant measures, and perfect sampling
In a probabilistic cellular automaton (PCA), the cells are updated synchronously and independently, according to a distribution depending on a finite neighborhood. A PCA can be vi...
Ana Busic, Jean Mairesse, Irene Marcovici