Switching Graphs

DOI10.1016/j.entcs.2008.12.035zbMath1337.68205OpenAlexW2913970140MaRDI QIDQ4982090

Jan Friso Groote, B. Ploeger

Publication date: 23 March 2015

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

Full work available at URL: https://doi.org/10.1016/j.entcs.2008.12.035

zbMATH Keywords

\(\mu\)-calculusparity gamesmodel checkingswitching graphsBoolean equation systems

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Other game-theoretic models (91A40) Specification and verification (program logics, model checking, etc.) (68Q60) Logical aspects of Boolean algebras (03G05)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Linear logic
• Results on the propositional \(\mu\)-calculus
• Path problems in skew-symmetric graphs
• Edge-disjoint routing in plane switch graphs in linear time
• Tools and Algorithms for the Construction and Analysis of Systems
• Depth-First Search and Linear Graph Algorithms
• On model checking for the \(\mu\)-calculus and its fragments

This page was built for publication: Switching Graphs