Sciweavers

79 search results - page 1 / 16
» On the Average Number of States of Partial Derivative Automa...
Sort
View
DLT
2010
13 years 5 months ago
On the Average Number of States of Partial Derivative Automata
The partial derivative automaton (Apd) is usually smaller than other non-deterministic finite automata constructed from a regular expression, and it can be seen as a quotient of th...
Sabine Broda, António Machiavelo, Nelma Mor...
FORMATS
2008
Springer
13 years 5 months ago
Average-Price and Reachability-Price Games on Hybrid Automata with Strong Resets
Abstract. We introduce and study hybrid automata with strong resets. They generalize o-minimal hybrid automata, a class of hybrid automata which allows modeling of complex continuo...
Patricia Bouyer, Thomas Brihaye, Marcin Jurdzinski...
LATA
2009
Springer
13 years 11 months ago
On the Average Size of Glushkov's Automata
Abstract. Glushkov’s algorithm builds an ε-free nondeterministic automaton from a given regular expression. In the worst case, its number of states is linear and its number of t...
Cyril Nicaud
PTS
2007
99views Hardware» more  PTS 2007»
13 years 5 months ago
Testing Input/Output Partial Order Automata
Abstract. We propose an extension of the Finite State Machine framework in distributed systems, using input/output partial order automata (IOPOA). In this model, transitions can be...
Stefan Haar, Claude Jard, Guy-Vincent Jourdan
CONCUR
1999
Springer
13 years 8 months ago
Partial Order Reduction for Model Checking of Timed Automata
Abstract. The paper presents a partial order reduction method applicable to networks of timed automata. The advantage of the method is that it reduces both the number of explored c...
Marius Minea