Testing language containment for \(\omega\)-automata using BDDs
type: Item
instance of: scholarly article
title: Testing language containment for \(\omega\)-automata using BDDs
zbMATH Open document ID: 0826.68050
author: Hervé J. Touati
author: Robert K. Brayton
author: R. P. Kurshan
published in: Information and Computation
publication date: 1995-07-05T00:00:00Z
Mathematics Subject Classification ID: 68Q15
Mathematics Subject Classification ID: 68Q45
zbMATH DE Number: 758653
zbMATH Keywords: \(\omega\)-automata
zbMATH Keywords: task decomposition
zbMATH Keywords: task-relative homomorphic reduction
zbMATH Keywords: system complexity
MaRDI profile type: Publication
full work available at URL: inco.1995.1055
OpenAlex ID: W2030624121
DOI: 10.1006/INCO.1995.1055
Recommended article: Q2769574
Recommended article: Q4027622
Recommended article: Extending Automated Compositional Verification to the Full Class of Omega-Regular Languages
Recommended article: Q4608630
Recommended article: Biautomata for k-Piecewise Testable Languages
Recommended article: Testing with Büchi Automata: Transition Coverage Metrics, Performance Analysis, and Property Refinement
Recommended article: Efficient inclusion testing for simple classes of unambiguous \(\omega \)-automata
Recommended article: Tools and Algorithms for the Construction and Analysis of Systems
Recommended article: Q4884884
description: scientific article; zbMATH DE number 758653