Foundations of Software Science and Computation Structures
From MaRDI portal
Publication:5899098
DOI10.1007/11690634zbMath1180.68180MaRDI QIDQ5899098
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
68Q25: Analysis of algorithms and problem complexity
91A43: Games involving graphs
68Q60: Specification and verification (program logics, model checking, etc.)
68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)
Related Items
Unnamed Item, Unnamed Item, On the complexity of resource-bounded logics, Model checking memoryful linear-time logics over one-counter automata, Reachability on prefix-recognizable graphs, An automata-theoretic approach to the verification of distributed algorithms, Energy parity games, A note on emptiness for alternating finite automata with a one-letter alphabet, Bisimulation equivalence and regularity for real-time one-counter automata, An Automata-Theoretic Approach to Infinite-State Systems, Model Checking FO(R) over One-Counter Processes and beyond