Foundations of Software Science and Computation Structures

DOI10.1007/11690634zbMath1180.68180OpenAlexW2504714231MaRDI QIDQ5899098

Olivier Serre

Publication date: 2 May 2007

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

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

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Games involving graphs (91A43) Specification and verification (program logics, model checking, etc.) (68Q60) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items

Countdown games, and simulation on (succinct) one-counter nets ⋮ A note on emptiness for alternating finite automata with a one-letter alphabet ⋮ Bisimulation equivalence and regularity for real-time one-counter automata ⋮ Unnamed Item ⋮ Church synthesis on register automata over linearly ordered data domains ⋮ An automata-theoretic approach to the verification of distributed algorithms ⋮ Unnamed Item ⋮ Energy parity games ⋮ An Automata-Theoretic Approach to Infinite-State Systems ⋮ Model checking memoryful linear-time logics over one-counter automata ⋮ Reachability on prefix-recognizable graphs ⋮ On the complexity of resource-bounded logics ⋮ Optimally Resilient Strategies in Pushdown Safety Games ⋮ Model Checking FO(R) over One-Counter Processes and beyond ⋮ The Complexity of Flat Freeze LTL

This page was built for publication: Foundations of Software Science and Computation Structures