Pushdown Processes: Games and Model Checking

Forfattere

  • Igor Walukiewicz

DOI:

https://doi.org/10.7146/brics.v3i54.20057

Resumé

Games given by transition graphs of pushdown processes are considered.
It is shown that if there is a winning strategy in such a
game then there is a winning strategy that is realized by a pushdown
process. This fact turns out to be connected with the model checking
problem for the pushdown automata and the propositional mu-calculus.
It is shown that this model checking problem is DEXPTIME-complete.

Downloads

Publiceret

1996-06-24

Citation/Eksport

Walukiewicz, I. (1996). Pushdown Processes: Games and Model Checking. BRICS Report Series, 3(54). https://doi.org/10.7146/brics.v3i54.20057

Nummer

Nr. 54 (1996): RS-54 Pushdown Processes: Games and Model Checking

Sektion

Artikler

Licens

Authors who publish with this journal agree to the following terms:

    1. Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this journal.

    1. Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal.

  1. Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work (See The Effect of Open Access).