Concept
Automaton
Related publications (16)
From Nondeterministic Buchi and Streett Automata to Deterministic Parity Automata
Determinisation and complementation are foundational notions in computer science. When considering finite automata on finite words nondeterminisation and complementation are one and the same. Given a nondeterministic finite automaton there exists an expone ...
2005Minimizing Generalized Buchi Automata
We consider the problem of minimization of generalized Buchi automata. We show how to extend fair simulation and delayed simulation to the case where the Buchi automaton has multiple acceptance conditions. For fair simulation, we show how to efficiently co ...
2005Dynamic load balancing of parallel cellular automata
We are interested in running in parallel cellular automata. We present an algorithm which explores the dynamic remapping of cells in order to balance the load between processing nodes. The parallel application runs on a cluster of PCs connected by Fast-Eth ...
SPIE-Int. Soc. Opt. Eng2000Visual Simulation of Crack Pattern Based on 3D Surface Cellular Automaton
This article describes a method for modeling the propagation of cracks on any 3D surface. Taking a previous cellular automata model as basis, this method allows any type of cracks on any type of triangulated 3D object. Our model's main advantage is that it ...
2000Run-time monitoring and on-line testing of middleware based communication services
With the present day's exponential growth of the (tele-)communications market, the explosion of the number of mobile communication customers, and the tremendous growth of the number of IP hosts, ensuring the reliability of communication services is one of ...
EPFL2000Compositional specification of timed systems
We present timed automata and timed Petri nets and argue that timed automata and their associated parallel composition operator are not well adapted for the compositional description of timed Petri nets. Timed automata with deadlines are presented. We pres ...
1996