Mathematical Foundations of Computer Science 2003
From MaRDI portal
Publication:5431297
DOI10.1007/b11836zbMath1124.03314OpenAlexW2495578842MaRDI QIDQ5431297
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
Specification and verification (program logics, model checking, etc.) (68Q60) Decidability of theories and sets of sentences (03B25) Graph theory (05C99)
Related Items (10)
Arithmetics properties of substitutions and infinite automata ⋮ The mu-calculus and Model Checking ⋮ Unnamed Item ⋮ An undecidable property of context-free linear orders ⋮ A Hierarchy of Automaticω-Words having a Decidable MSO Theory ⋮ Rabin's theorem in the concurrency setting: a conjecture ⋮ Model Checking FO(R) over One-Counter Processes and beyond ⋮ Regular sets over extended tree structures ⋮ Monadic <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.gif" overflow="scroll"><mml:msubsup><mml:mi mathvariant="normal">Σ</mml:mi><mml:mn>1</mml:mn><mml:mn>1</mml:mn></mml:msubsup></mml:math> and Modal Logic with Quantified Binary Relations ⋮ Existential second-order logic and modal logic with quantified accessibility relations
This page was built for publication: Mathematical Foundations of Computer Science 2003
