Sciweavers

3229 search results - page 83 / 646
» The Theory of Timed Automata
Sort
View
CPM
2005
Springer
105views Combinatorics» more  CPM 2005»
14 years 3 months ago
Reducing the Size of NFAs by Using Equivalences and Preorders
Abstract. The efficiency of regular expression matching algorithms depends very much on the size of the nondeterministic finite automata (NFA) obtained from regular expressions. R...
Lucian Ilie, Roberto Solis-Oba, Sheng Yu
ACSD
2006
IEEE
109views Hardware» more  ACSD 2006»
13 years 11 months ago
Synthesis of Synchronous Interfaces
Reuse of IP blocks has been advocated as a means to conquer the complexity of today's system-on-chip (SoC) designs. Component integration and verification in such systems is ...
Purandar Bhaduri, S. Ramesh
NFM
2011
223views Formal Methods» more  NFM 2011»
13 years 4 months ago
opaal: A Lattice Model Checker
Abstract. We present a new open source model checker, opaal, for automatic verification of models using lattice automata. Lattice automata allow the users to incorporate abstracti...
Andreas Engelbredt Dalsgaard, René Rydhof H...
CONCUR
2007
Springer
14 years 3 months ago
Timed Concurrent Game Structures
Abstract. We propose a new model for timed games, based on concurrent game structures (CGSs). Compared to the classical timed game automata of Asarin et al. [8], our timed CGSs are...
Thomas Brihaye, François Laroussinie, Nicol...
FATES
2004
Springer
14 years 3 months ago
Testing Deadlock-Freeness in Real-Time Systems: A Formal Approach
A Time Action Lock is a state of a Real-time system at which neither time can progress nor an action can occur. Time Action Locks are often seen as signs of errors in the model or ...
Behzad Bordbar, Kozo Okano