3750 search results - page 30 / 750 » Timed Automata Patterns |
JSS
2006
14 years 9 months ago
2006
DAC
2008
ACM
15 years 10 months ago
2008
ACM
Pattern matching relies on deterministic finite automata (DFA) to search for predefined patterns. While a bit-DFA method is recently proposed to exploit the parallelism in pattern...
ICALP
2009
Springer
15 years 10 months ago
2009
Springer
Alternating timed automata on infinite words are considered. The main result is a characterization of acceptance conditions for which the emptiness problem for the automata is deci...
IS
2010
14 years 8 months ago
2010
Most work on pattern mining focuses on simple data structures such as itemsets and sequences of itemsets. However, a lot of recent applications dealing with complex data like chem...
103
click to vote
ENTCS
2007
14 years 9 months ago
2007
Bounded Model Checking (BMC) is a successful refutation method to detect errors in not only circuits and other binary systems but also in systems with more complex domains like ti...