1246 search results - page 102 / 250 » Recursive Timed Automata |
154
click to vote
LICS
2007
IEEE
15 years 11 months ago
2007
IEEE
d abstract) Marcin Jurdzi´nski and Ranko Lazi´c∗ Department of Computer Science, University of Warwick, UK An alternation-free modal µ-calculus over data trees is introduced ...
141
click to vote
COLT
2006
Springer
15 years 8 months ago
2006
Springer
Given a finite set of words w1, . . . , wn independently drawn according to a fixed unknown distribution law P called a stochastic language, an usual goal in Grammatical Inference ...
143
Voted
ESOP
2004
Springer
15 years 10 months ago
2004
Springer
Abstract. We introduce an approach to designing filtering algorithms by derivation from finite automata operating on constraint signatures. We illustrate this approach in two cas...
171
click to vote
FORMATS
2004
Springer
15 years 10 months ago
2004
Springer
For successful software verification, model checkers must be capable of handling a large number of program variables. Traditional, BDD-based model checking is deficient in this reg...
192
click to vote
ESOP
2012
Springer
14 years 19 days ago
2012
Springer
Communicating finite state machines (CFSMs) represent processes which communicate by asynchronous exchanges of messages via FIFO channels. Their major impact has been in character...