Sciweavers

512 search results - page 50 / 103
» Automata as Abstractions
Sort
View
CBSE
2008
Springer
13 years 10 months ago
State Space Reduction Techniques for Component Interfaces
Abstract. Automata-based interface and protocol specifications provide an elegant framework to capture and automatically verify the interactive behavior of component-based software...
Markus Lumpe, Lars Grunske, Jean-Guy Schneider
TACAS
2007
Springer
131views Algorithms» more  TACAS 2007»
14 years 2 months ago
From Time Petri Nets to Timed Automata: An Untimed Approach
Abstract. Time Petri Nets (TPN) and Timed Automata (TA) are widely-used formalisms for the modeling and analysis of timed systems. A recently-developed approach for the analysis of...
Davide D'Aprile, Susanna Donatelli, Arnaud Sangnie...
FORMATS
2010
Springer
13 years 6 months ago
Layered Composition for Timed Automata
Abstract. We investigate layered composition for real-time systems modelled as (networks of) timed automata (TA). We first formulate the principles of layering and transition indep...
Ernst-Rüdiger Olderog, Mani Swaminathan
MFCS
2004
Springer
14 years 2 months ago
Captive Cellular Automata
Abstract. We introduce a natural class of cellular automata characterised by a property of the local transition law without any assumption on the states set. We investigate some al...
Guillaume Theyssier
CORR
2008
Springer
126views Education» more  CORR 2008»
13 years 10 months ago
Intrinsically Universal Cellular Automata
Abstract. We introduce a natural class of cellular automata characterised by a property of the local transition law without any assumption on the states set. We investigate some al...
Nicolas Ollinger