3229 search results - page 124 / 646 » The Theory of Timed Automata |
160
click to vote
TACAS
2009
Springer
16 years 1 months ago
2009
Springer
TAPAS is a suite of libraries dedicated to FO (R, Z, +, ≤). The suite provides (1) the application programming interface GENEPI for this logic with encapsulations of many classic...
171
click to vote
IJFCS
2006
15 years 6 months ago
2006
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 re...
151
click to vote
FM
2006
Springer
15 years 10 months ago
2006
Springer
We propose a new look at one of the most fundamental types of behavioral interfaces: discrete time specifications of communication--directly related to the work of de Alfaro and H...
194
click to vote
VMCAI
2010
Springer
16 years 1 months ago
2010
Springer
This paper upgrades Regular Linear Temporal Logic (RLTL) with past operators and complementation. RLTL is a temporal logic that extends the expressive power of linear temporal logi...
187
click to vote
CONEXT
2007
ACM
15 years 10 months ago
2007
ACM
Deterministic finite automata (DFAs) are widely used to perform regular expression matching in linear time. Several techniques have been proposed to compress DFAs in order to redu...