Model checking and boolean graphs
type: Item
instance of: scholarly article
title: Model checking and boolean graphs
zbMATH Open document ID: 0798.03017
DOI: 10.1016/0304-3975(94)90266-6
author: Henrik Reif Andersen
published in: Theoretical Computer Science
publication date: 1994-11-03T00:00:00Z
Mathematics Subject Classification ID: 03B45
Mathematics Subject Classification ID: 68Q85
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 68R10
zbMATH DE Number: 567724
zbMATH Keywords: satisfaction problem
zbMATH Keywords: modal \(\mu\)-calculus
zbMATH Keywords: marking of a Boolean graph
zbMATH Keywords: model checking algorithm
MaRDI profile type: Publication
full work available at URL: 0304-3975(94)90266-6
OpenAlex ID: W2756011084
cites work: On the computational power of pushdown automata
cites work: Compositional checking of satisfaction
cites work: A linear algorithm to solve fixed-point equations on transition systems
cites work: Programming languages and their definition. Selected papers ed. by C. B. Jones
cites work: Tableau-based model checking in the propositional mu-calculus
cites work: A linear-time model-checking algorithm for the alternation-free modal mu- calculus
cites work: Q3619797
cites work: Linear-time algorithms for testing the satisfiability of propositional horn formulae
cites work: Results on the propositional \(\mu\)-calculus
cites work: Q3792217
cites work: Q4038716
cites work: A lattice-theoretical fixpoint theorem and its applications
cites work: Q3033311
description: scientific article; zbMATH DE number 567724