Sciweavers

32 search results - page 4 / 7
» Symbolic Robustness Analysis of Timed Automata
Sort
View
FUIN
2006
85views more  FUIN 2006»
13 years 7 months ago
Decidability and Universality in Symbolic Dynamical Systems
Many different definitions of computational universality for various types of dynamical systems have flourished since Turing's work. We propose a general definition of univers...
Jean-Charles Delvenne, Petr Kurka, Vincent D. Blon...
ICDAR
2011
IEEE
12 years 7 months ago
Symbol Spotting in Line Drawings through Graph Paths Hashing
—In this paper we propose a symbol spotting technique through hashing the shape descriptors of graph paths (Hamiltonian paths). Complex graphical structures in line drawings can ...
Anjan Dutta, Josep Lladós, Umapada Pal
ENTCS
2002
139views more  ENTCS 2002»
13 years 7 months ago
Automatic Verification of the IEEE-1394 Root Contention Protocol with KRONOS and PRISM
We report on the automatic verification of timed probabilistic properties of the IEEE 1394 root contention protocol combining two existing tools: the real-time modelchecker Kronos...
Conrado Daws, Marta Z. Kwiatkowska, Gethin Norman
FMICS
2010
Springer
13 years 8 months ago
Model Checking the FlexRay Physical Layer Protocol
Abstract. The FlexRay standard, developed by a cooperation of leading companies in the automotive industry, is a robust communication protocol for distributed components in modern ...
Michael Gerke 0002, Rüdiger Ehlers, Bernd Fin...
ICFEM
2010
Springer
13 years 6 months ago
Making the Right Cut in Model Checking Data-Intensive Timed Systems
Abstract. The success of industrial-scale model checkers such as Uppaal [3] or NuSMV [12] relies on the efficiency of their respective symbolic state space representations. While d...
Rüdiger Ehlers, Michael Gerke 0002, Hans-J&ou...