655 search results - page 63 / 131 » Automata, Logic, and XML |
LANMR
2007
14 years 11 months ago
2007
Teaching engineering students courses such as computer science theory, automata theory and discrete mathematics took us to realize that introducing basic notions of logic, especial...
TCS
2008
14 years 9 months ago
2008
We introduce an LTL-like logic with atomic formulae built over a constraint language interpreting variables in Z. The constraint language includes periodicity constraints, comparis...
CADE
2008
Springer
15 years 10 months ago
2008
Springer
Tree automata completion is a technique for the verification of infinite state systems. It has already been used for the verification of cryptographic protocols and the prototyping...
CONCUR
2000
Springer
15 years 2 months ago
2000
Springer
Abstract. We consider the problem of automatically verifying realtime systems with continuously distributed random delays. We generalise probabilistic timed automata introduced in ...
FMSD
2006
14 years 9 months ago
2006
Two base algorithms are known for reachability verification over timed automata. They are called forward and backwards, and traverse the automata edges using either successors or p...