Zobrazeno 1 - 3
of 3
pro vyhledávání: '"Ritam Raha"'
Publikováno v:
Electronic Proceedings in Theoretical Computer Science, Vol 305, Iss Proc. GandALF 2019, Pp 17-33 (2019)
We study games with reachability objectives under energy constraints. We first prove that under strict energy constraints (either only lower-bound constraint or interval constraint), those games are LOGSPACE-equivalent to energy games with the same e
Externí odkaz:
https://doaj.org/article/e041172c5e754f96b6529c733c014c58
Publikováno v:
Information and Computation
Information and Computation, 2022, 285B, ⟨10.1016/j.ic.2021.104806⟩
Electronic Proceedings in Theoretical Computer Science, Vol 305, Iss Proc. GandALF 2019, Pp 17-33 (2019)
Information and Computation, Elsevier, 2021, pp.1-20. ⟨10.1016/j.ic.2021.104806⟩
GandALF 2019-Tenth International Symposium on Games, Automata, Logics, and Formal Verification
GandALF 2019-Tenth International Symposium on Games, Automata, Logics, and Formal Verification, Sep 2019, Bordeaux, France. pp.17-33, ⟨10.4204/EPTCS.305.2⟩
Information and computation
GandALF
Information and Computation, 2022, 285B, ⟨10.1016/j.ic.2021.104806⟩
Electronic Proceedings in Theoretical Computer Science, Vol 305, Iss Proc. GandALF 2019, Pp 17-33 (2019)
Information and Computation, Elsevier, 2021, pp.1-20. ⟨10.1016/j.ic.2021.104806⟩
GandALF 2019-Tenth International Symposium on Games, Automata, Logics, and Formal Verification
GandALF 2019-Tenth International Symposium on Games, Automata, Logics, and Formal Verification, Sep 2019, Bordeaux, France. pp.17-33, ⟨10.4204/EPTCS.305.2⟩
Information and computation
GandALF
We study games with reachability objectives under energy constraints. We first prove that under strict energy constraints (either only lower-bound constraint or interval constraint), those games are LOGSPACE-equivalent to energy games with the same e
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c441a8bf41ca53548c2f370d0d363635
https://inria.hal.science/hal-03482420/document
https://inria.hal.science/hal-03482420/document
Publikováno v:
Lecture notes in computer science
Tools and Algorithms for the Construction and Analysis of Systems ISBN: 9783030995232
Tools and Algorithms for the Construction and Analysis of Systems ISBN: 9783030995232
Linear temporal logic (LTL) is a specification language for finite sequences (called traces) widely used in program verification, motion planning in robotics, process mining, and many other areas. We consider the problem of learning formulas in fragm
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::05437f038916d785c2665db1e4b8c27a
https://repository.uantwerpen.be/docstore/d:irua:12149
https://repository.uantwerpen.be/docstore/d:irua:12149