Mathematical Foundations of Computer Science 2003
From MaRDI portal
Publication:5431297
DOI10.1007/b11836zbMath1124.03314MaRDI 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
68Q60: Specification and verification (program logics, model checking, etc.)
03B25: Decidability of theories and sets of sentences
05C99: Graph theory
Related Items
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, Regular sets over extended tree structures, An undecidable property of context-free linear orders, Rabin's theorem in the concurrency setting: a conjecture, Arithmetics properties of substitutions and infinite automata, A Hierarchy of Automaticω-Words having a Decidable MSO Theory, Model Checking FO(R) over One-Counter Processes and beyond