233 search results - page 26 / 47 » Equivalent Transformations of Automata by Using Behavioural ... |
SIGCSE
2004
ACM
15 years 5 months ago
2004
ACM
We describe the instructional software JFLAP 4.0 and how it can be used to provide a hands-on formal languages and automata theory course. JFLAP 4.0 doubles the number of chapters...
ASPDAC
2007
ACM
15 years 3 months ago
2007
ACM
In this paper, we present a method for generating checker circuits from sequential-extended regular expressions (SEREs). Such sequences form the core of increasingly-used Assertion...
JAIR
2006
14 years 11 months ago
2006
In this paper we present pddl+, a planning domain description language for modelling mixed discrete-continuous planning domains. We describe the syntax and modelling style of pddl...
CAV
2006
Springer
15 years 3 months ago
2006
Springer
We describe a formal verification of a recent concurrent list-based set algorithm due to Heller et al. The algorithm is optimistic: the add and remove operations traverse the list ...
QSIC
2005
IEEE
15 years 5 months ago
2005
IEEE
In component software, the independence of components is achieved by separating their interfaces from implementations. The interface definition of a component serves as the contr...