A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf
.
Filters
Near-Optimal Scheduling for LTL with Future Discounting
[article]
2015
arXiv
pre-print
The logic, introduced by Almagor, Boker and Kupferman, is a quantitative variant of LTL in which an event in the far future has only discounted contribution to a truth value (that is a real number in the ...
We study the search problem for optimal schedulers for the linear temporal logic (LTL) with future discounting. ...
The authors are supported by Grants-in-Aid No. 24680001, 15KT0012 and 15K11984, JSPS. ...
arXiv:1410.4950v4
fatcat:yfni2t4bcffdln2lieihzz4dmm
Near-Optimal Scheduling for LTL with Future Discounting
[chapter]
2016
Lecture Notes in Computer Science
On the one hand, our (alternative) algorithm resembles the one in [3] . ...
On the ground that the logic LTL disc [D, F] from [3] is capable of expressing many common specifications encountered in real-world problems, finding an optimal path-i.e. resolving nondeterminism in the ...
The authors are supported by Grants-in-Aid No. 24680001, 15KT0012 and 15K11984, JSPS. ...
doi:10.1007/978-3-319-28766-9_8
fatcat:qdcve2hagnemnbpwkirbtj3oh4
LA FUSIÓN DE IMÁGENES DE TELEDETECCIÓN: UNA AYUDA PARA LA INTERPRETACIÓN DE ENTORNOS URBANOS
2010
EGA Revista de expresión gráfica arquitectónica
En este trabajo exponemos cedentes de satélites o aéreas) son usa- al. 2005. ...
In June 1850, dem-
ly missing one of José de Hermosilla, and the five plans inal definition in Castilian feet. ...
doi:10.4995/ega.2010.1006
fatcat:rgsiowpdhvhfzniuohzmjblu7u
Coalgebraic Logics (Dagstuhl Seminar 12411) Algebraic and Combinatorial Methods in Computational Complexity (Dagstuhl Seminar 12421) Time-of-Flight Imaging: Algorithms, Sensors and Applications (Dagstuhl Seminar 12431) Foundations and Challenges of Change and Evolution in Ontologies (Dagstuhl Seminar 12441) Requirements Management-Novel Perspectives and Challenges (Dagstuhl Seminar 12442)
2012
unpublished
We then discuss how computational complexity creeps in and how to cope with it. ...
In addition, we sketch some approaches for dealing with requirements evolution, adopted from the PhD thesis of Neil Ernst [1]. ...
In Proceedings of the 2010 IEEE Symposium on Security and Privacy, SP '10, pages 109-124, Washington, DC, USA, 2010. IEEE Computer Society. 25 Veracode Fergal Glynn. ...
fatcat:3zuf3grgabettljj7apksbc4lq