Pushdown Processes: Games and Model Checking
作者： Igor Walukiewicz
DOI: 10.7146/BRICS.V3I54.20057
关键词:
摘要: Games given by transition graphs of pushdown processes are considered. It is shown that if there a winning strategy in such game then realized process. This fact turns out to be connected with the model checking problem for automata and propositional mu-calculus. this DEXPTIME-complete.
core.ac.uk
tidsskrift.dk
statsbiblioteket.dk参考文章(0)