Mathematical Foundations of Computer Science 2003

DOI10.1007/b11836zbMath1124.68369OpenAlexW2495578842MaRDI QIDQ5431341

Philipp Rohde, Christof Löding

Publication date: 7 December 2007

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/b11836

Mathematics Subject Classification ID

Games involving graphs (91A43) Modal logic (including the logic of norms) (03B45) Specification and verification (program logics, model checking, etc.) (68Q60) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items

\(\mathsf{QCTL}\) model-checking with \(\mathsf{QBF}\) solvers ⋮ Complexity of question/answer games ⋮ Sabotage Modal Logic: Some Model and Proof Theoretic Aspects ⋮ THE MODAL LOGIC OF STEPWISE REMOVAL ⋮ The modal logic of copy and remove ⋮ Connectivity games over dynamic networks ⋮ Moving in a network under random failures: a complexity analysis ⋮ An algorithmic analysis of the Honey-Bee game ⋮ On sabotage games ⋮ Copy and remove as dynamic operators ⋮ A Game Theoretic Approach to the Analysis of Dynamic Networks