113 search results - page 8 / 23 » LTL Can Be More Succinct |
APPROX
2006
Springer
15 years 1 months ago
2006
Springer
We describe a simple random-sampling based procedure for producing sparse matrix approximations. Our procedure and analysis are extremely simple: the analysis uses nothing more th...
ATAL
2008
Springer
14 years 12 months ago
2008
Springer
Some natural epistemic properties which may arise in applications can only be expressed in standard epistemic logic by formulae which are exponentially long in the number of agent...
PVLDB
2010
14 years 8 months ago
2010
We show how Recursive Markov Chains (RMCs) and their restrictions can define probabilistic distributions over XML documents, and study tractability of querying over such models. ...
FSTTCS
2009
Springer
15 years 4 months ago
2009
Springer
Linear temporal logic was introduced in order to reason about reactive systems. It is often considered with respect to infinite words, to specify the behaviour of long-running sys...
RISE
2004
Springer
15 years 3 months ago
2004
Springer
In this paper, we develop a symbolic representation for timed concurrent constraint (tccp) programs, which can be used for defining a lightweight model–checking algorithm for re...