Sciweavers

2632 search results - page 74 / 527
» Alternating Timed Automata
Sort
View
FOSSACS
2011
Springer
14 years 5 months ago
Minimizing Deterministic Lattice Automata
Traditional automata accept or reject their input, and are therefore Boolean. In contrast, weighted automata map each word to a value from a semiring over a large domain. The speci...
Shulamit Halamish, Orna Kupferman
ACRI
2006
Springer
15 years 7 months ago
Interactive Terrain Simulation and Force Distribution Models in Sand Piles
This paper presents an application of Cellular Automata in the field of dry Granular Systems modelling. While the study of granular systems is not a recent field, no efficient mo...
Marta Pla-Castells, Ignacio García-Fern&aac...
CPM
2005
Springer
105views Combinatorics» more  CPM 2005»
15 years 7 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
132
Voted
ACSD
2006
IEEE
109views Hardware» more  ACSD 2006»
15 years 3 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»
14 years 8 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...