Sciweavers

512 search results - page 33 / 103
» Automata as Abstractions
Sort
View
STACS
1997
Springer
14 years 23 days ago
Intrinsic Universality of a 1-Dimensional Reversible Cellular Automaton
Abstract. This paper deals with simulation and reversibility in the context of Cellular Automata (ca). We recall the de nitions of ca and of the Block (bca) and Partitioned (pca) s...
Jérôme Olivier Durand-Lose
FM
1999
Springer
161views Formal Methods» more  FM 1999»
14 years 27 days ago
Formal Modeling and Analysis of Hybrid Systems: A Case Study in Multi-robot Coordination
Abstract. The design of controllers for hybridsystemsi.e. mixeddiscretecontinuous systems in a systematic manner remains a challenging task. In this case study, we apply formal m...
Rajeev Alur, Joel M. Esposito, M. Kim, Vijay Kumar...
HYBRID
1999
Springer
14 years 27 days 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...
ACNS
2009
Springer
113views Cryptology» more  ACNS 2009»
14 years 19 days ago
Fast Packet Classification Using Condition Factorization
Abstract. Rule-based packet classification plays a central role in network intrusion detection systems such as Snort. To enhance performance, these rules are typically compiled int...
Alok Tongaonkar, R. Sekar, Sreenaath Vasudevan
SBBD
2007
126views Database» more  SBBD 2007»
13 years 10 months ago
Constraint-based Tree Pattern Mining
Abstract. A lot of recent applications dealing with complex data require sophisticated data structures (trees or graphs) for their specification. Recently, several techniques for ...
Sandra de Amo, Nyara A. Silva, Ronaldo P. Silva, F...