On the computational complexity of verifying one-counter processes
S Goller, R Mayr, AW To - … Annual IEEE Symposium on Logic In …, 2009 - ieeexplore.ieee.org
One-counter processes are pushdown systems over a singleton stack alphabet (plus a stack-
bottom symbol). We study the complexity of two closely related verification problems over
one-counter processes: model checking with the temporal logic EF, where formulas are
given as directed acyclic graphs, and weak bisimilarity checking against finite systems. We
show that both problems are P NP-complete. This is achieved by establishing a close
correspondence with the membership problem for a natural fragment of Presburger …
bottom symbol). We study the complexity of two closely related verification problems over
one-counter processes: model checking with the temporal logic EF, where formulas are
given as directed acyclic graphs, and weak bisimilarity checking against finite systems. We
show that both problems are P NP-complete. This is achieved by establishing a close
correspondence with the membership problem for a natural fragment of Presburger …
[PS][PS] On the Computational Complexity of Verifying One-Counter Processes
R Mayr, AW To - lsv.ens-cachan.fr
One-counter processes are pushdown systems over a singleton stack alphabet (plus a stack-
bottom symbol). We study the complexity of two closely related verification problems over
one-counter processes: model checking with the temporal logic EF, where formulas are
given as directed acyclic graphs, and weak bisimilarity checking against finite systems. We
show that both problems are PNP-complete. This is achieved by establishing a close
correspondence with the membership problem for a natural fragment of Presburger …
bottom symbol). We study the complexity of two closely related verification problems over
one-counter processes: model checking with the temporal logic EF, where formulas are
given as directed acyclic graphs, and weak bisimilarity checking against finite systems. We
show that both problems are PNP-complete. This is achieved by establishing a close
correspondence with the membership problem for a natural fragment of Presburger …
以上显示的是最相近的搜索结果。 查看全部搜索结果