396 search results - page 20 / 80 » Factor Automata of Automata and Applications |
191
click to vote
FOSSACS
2011
Springer
14 years 9 months ago
2011
Springer
The model checking of higher-order recursion schemes has been actively studied and is now becoming a basis of higher-order program verification. We propose a new algorithm for tri...
143
click to vote
TPHOL
2005
IEEE
15 years 11 months ago
2005
IEEE
Using the HOL theorem prover, we proved the correctness of a translation from a subset of Accellera’s property specification language PSL to linear temporal logic LTL. Moreover,...
144
click to vote
FM
2005
Springer
15 years 11 months ago
2005
Springer
Recently we have proposed the ”almost ASAP” semantics as an alternative semantics for timed automata. This semantics is useful when modeling real-time controllers : control str...
160
click to vote
IPPS
2000
IEEE
15 years 10 months ago
2000
IEEE
Cellular automata can be used to design high-performance natural solvers on parallel computers. This paper describes the development of applications using CARPET, a high-level prog...
176
click to vote
CSL
2007
Springer
15 years 9 months ago
2007
Springer
We give a new proof showing that it is not possible to define in monadic second-order logic (MSO) a choice function on the infinite binary tree. This result was first obtained by G...