32 citations · 149 across the 42 of their papers we have counts for
Showing 2021Show all
2 papers · 1 filter
cs.LO2021
HyperLTL Satisfiability is -complete, HyperCTL* Satisfiability is -complete
Marie Fortin, Louwe B. Kuijer, Patrick Totzke +1
Temporal logics for the specification of information-flow properties are able to express relations between multiple executions of a system. The two most important such logics are H…
cs.FL2021★ 8 cited
A Bit of Nondeterminism Makes Pushdown Automata Expressive and Succinct
Shibashis Guha, Ismaël Jecker, Karoliina Lehtinen +1
We study the expressiveness and succinctness of history-deterministic pushdown automata (HD-PDA) over finite words, that is, pushdown automata whose nondeterminism can be resolved…