3229 search results - page 146 / 646 » The Theory of Timed Automata |
143
click to vote
NAACL
2004
15 years 7 months ago
2004
Many probabilistic models for natural language are now written in terms of hierarchical tree structure. Tree-based modeling still lacks many of the standard tools taken for grante...
195
click to vote
WOLLIC
2010
Springer
15 years 4 months ago
2010
Springer
We provide a formalisation of the theory of pushdown automata (PDAs) using the HOL4 theorem prover. It illustrates how provers such as HOL can be used for mechanising complicated p...
177
click to vote
APAL
2006
15 years 6 months ago
2006
For a long time people have been trying to develop probability theory starting from `finite' events rather than collections of infinite events. In this way one can find natura...
141
click to vote
MLQ
2002
15 years 6 months ago
2002
In this paper it is shown that the intuitionistic fixed point theory ID i (strict) for times iterated fixed points of strictly positive operator forms is conservative for negativ...
180
click to vote
IPPS
2008
IEEE
16 years 27 days ago
2008
IEEE
In this paper, we introduce the new technique of HighConfidence Software Monitoring (HCSM), which allows one to perform software monitoring with bounded overhead and concomitantl...