Program schemata vs. automata for decidability of program logics
type: Item
instance of: scholarly article
title: Program schemata vs. automata for decidability of program logics
zbMATH Open document ID: 0895.03012
DOI: 10.1016/S0304-3975(96)00168-5
author: Nikolay V. Shilov
published in: Theoretical Computer Science
publication date: 1998-07-23T00:00:00Z
Mathematics Subject Classification ID: 03B70
Mathematics Subject Classification ID: 03B25
zbMATH DE Number: 1178778
zbMATH Keywords: decidability
zbMATH Keywords: program logics
zbMATH Keywords: mu-calculus
MaRDI profile type: Publication
cites work: Q4501136
cites work: Symbolic model checking: \(10^{20}\) states and beyond
cites work: On model checking for the \(\mu\)-calculus and its fragments
cites work: Propositional dynamic logic of regular programs
cites work: Theory of program structures: Schemes, semantics, verification
cites work: Q3318101
cites work: Results on the propositional \(\mu\)-calculus
cites work: Q3483264
cites work: Decidability of Second-Order Theories and Automata on Infinite Trees
cites work: Q3349961
cites work: The complementation problem for Büchi automata with applications to temporal logic
cites work: An automata theoretic decision procedure for the propositional mu- calculus
description: scientific article; zbMATH DE number 1178778