Zobrazeno 1 - 2
of 2
pro vyhledávání: '"Rubbens, Bob"'
Autor:
van Dijk, Tom, Rubbens, Bob
Publikováno v:
EPTCS 305, 2019, pp. 123-139
A naive way to solve the model-checking problem of the mu-calculus uses fixpoint iteration. Traditionally however mu-calculus model-checking is solved by a reduction in linear time to a parity game, which is then solved using one of the many algorith
Externí odkaz:
http://arxiv.org/abs/1909.07659
Publikováno v:
Electronic Proceedings in Theoretical Computer Science, Vol 305, Iss Proc. GandALF 2019, Pp 123-139 (2019)
Proceedings Tenth International Symposium on Games, Automata, Logics, and Formal Verification, GandALF 2019: Bordeaux, France, 2-3rd September 2019, 123-139
STARTPAGE=123;ENDPAGE=139;TITLE=Proceedings Tenth International Symposium on Games, Automata, Logics, and Formal Verification, GandALF 2019
Proceedings Tenth International Symposium on Games, Automata, Logics, and Formal Verification, GandALF 2019: Bordeaux, France, 2-3rd September 2019, 123-139
STARTPAGE=123;ENDPAGE=139;TITLE=Proceedings Tenth International Symposium on Games, Automata, Logics, and Formal Verification, GandALF 2019
A naive way to solve the model-checking problem of the mu-calculus uses fixpoint iteration. Traditionally however mu-calculus model-checking is solved by a reduction in linear time to a parity game, which is then solved using one of the many algorith
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::5cba7799a18d106730105d67c90b6c7d
https://doaj.org/article/98683258d3cf4e14bfbdd52d04761188
https://doaj.org/article/98683258d3cf4e14bfbdd52d04761188
