295 search results - page 25 / 59 » Approximating the Expressive Power of Logics in Finite Model... |
102
Voted
CORR
2007
Springer
15 years 17 days ago
2007
Springer
Formal verification using the model checking paradigm has to deal with two aspects: The system models are structured, often as products of components, and the specification logic...
104
click to vote
JMLR
2008
15 years 16 days ago
2008
In this paper we develop a theoretical analysis of the performance of sampling-based fitted value iteration (FVI) to solve infinite state-space, discounted-reward Markovian decisi...
102
Voted
LICS
2003
IEEE
15 years 5 months ago
2003
IEEE
This paper reports on and discusses three notions of approximation for Labelled Markov Processes that have been developed last year. The three schemes are improvements over former...
110
Voted
ECBS
2006
IEEE
15 years 4 months ago
2006
IEEE
The paper depicts experiments and results with preditraction based verification applied to infinite state Predicate abstraction is a method for automatic tion of abstract state sp...
215
click to vote
POPL
2004
ACM
16 years 27 days ago
2004
ACM
For decades we have been using Chomsky's generative system of grammars, particularly context-free grammars (CFGs) and regular expressions (REs), to express the syntax of prog...