732 search results - page 120 / 147 » Axiomatising timed automata |
CONIELECOMP
2005
IEEE
15 years 5 months ago
2005
IEEE
The approximate searching problem on compressed text tries to find all the matches of a pattern in a compressed text, without decompressing it and considering that the match of th...
113
click to vote
ACRI
2004
Springer
15 years 5 months ago
2004
Springer
Modeling free-form shapes in 3D spaces based on strict physical laws require a considerable amount of computation time. Previous experiences with Cellular Automata demonstrated sub...
WIA
2004
Springer
15 years 5 months ago
2004
Springer
Finite automata determinization is a critical operation for numerous practical applications such as regular expression search. Algorithms have to deal with the possible blow up of ...
CAV
2003
Springer
15 years 5 months ago
2003
Springer
Many verification problems reduce to proving the validity of formulas involving both propositional connectives and domain-specific functions and predicates. This paper presents ...
113
click to vote
FM
2003
Springer
15 years 5 months ago
2003
Springer
We present a novel application on model checking through SPIN as a means for verifying purely descriptive specifications written in TRIO, a first order, linear-time temporal logic ...