644 search results - page 19 / 129 » Precedence Automata and Languages |
TACAS
2001
Springer
13 years 12 months ago
2001
Springer
Abstract. Checking for language containment between nondeterministic ω-automata is a central task in automata-based hierarchical verification. We present a symbolic procedure for...
CORR
2009
Springer
13 years 5 months ago
2009
Springer
The minimal deterministic finite automaton is generally used to determine regular languages equality. Using Brzozowski's notion of derivative, Antimirov and Mosses proposed a...
LICS
2009
IEEE
14 years 2 months ago
2009
IEEE
Several dynamical systems, such as deterministic automata and labelled transition systems, can be described as coalgebras of so-called Kripke polynomial functors, built up from co...
EUROMICRO
2007
IEEE
13 years 9 months ago
2007
IEEE
BPEL is a de-facto standard language for web service orchestration. It is a challenge to test BPEL processes automatically because of the complex features of the language. The cur...
ENTCS
2008
13 years 7 months ago
2008
This paper describes an extension to Lustre to support the analysis of globally asynchronous, locally synchronous (GALS) architectures. This extension consists of constructs for d...