Sciweavers

585 search results - page 24 / 117
» Better Abstractions for Timed Automata
Sort
View
CSR
2007
Springer
15 years 1 months ago
A Padding Technique on Cellular Automata to Transfer Inclusions of Complexity Classes
Abstract. We will show how padding techniques can be applied on onedimensional cellular automata by proving a transfer theorem on complexity classes (how one inclusion of classes i...
Victor Poupet
FLAIRS
2004
14 years 11 months ago
Cellular Automata Approach to Aircraft Corrosion Pit Growth
Corrosion is one of the degrading mechanisms that greatly affect the structural integrity of aerospace components. Corrosion begins with small imperfections in the given material ...
Ramana Pidaparti, Mathew J. Palakal, Long Fong
WIA
2004
Springer
15 years 2 months ago
On the Complexity of Hopcroft's State Minimization Algorithm
Abstract. Hopcroft’s algorithm for minimizing a deterministic automaton has complexity O(n log n). We show that this complexity bound is tight. More precisely, we provide a famil...
Jean Berstel, Olivier Carton
71
Voted
CSR
2010
Springer
15 years 2 months ago
Realizability of Dynamic MSC Languages
Abstract. We introduce dynamic communicating automata (DCA), an extension of communicating finite-state machines that allows for dynamic creation of processes. Their behavior can ...
Benedikt Bollig, Loïc Hélouët
HYBRID
1999
Springer
15 years 1 months ago
A New Class of Decidable Hybrid Systems
Abstract. One of the most important analysis problems of hybrid systems is the reachability problem. State of the art computational tools perform reachability computation for timed...
Gerardo Lafferriere, George J. Pappas, Sergio Yovi...