Mediating for reduction (on minimizing alternating Büchi automata)
type: Item
instance of: scholarly article
title: Mediating for reduction (on minimizing alternating Büchi automata)
zbMATH Open document ID: 1360.68536
author: Parosh A. Abdulla
author: Yu-Fang Chen
author: Lukáš Holik
author: Tomáš Vojnar
published in: Theoretical Computer Science
publication date: 2014-09-10T00:00:00Z
Mathematics Subject Classification ID: 68Q45
zbMATH DE Number: 6342267
zbMATH Keywords: alternating Büchi automata
zbMATH Keywords: simulation
zbMATH Keywords: reduction
zbMATH Keywords: quotient
describes a project that uses: LTL2BA
describes a project that uses: GOAL
MaRDI profile type: Publication
full work available at URL: j.tcs.2014.08.003
OpenAlex ID: W1965927648
cites work: Mediating for reduction (on minimizing alternating Büchi automata)
cites work: Weak alternating automata are not that weak
cites work: Automata-Theoretic Model Checking Revisited
cites work: Extending Automated Compositional Verification to the Full Class of Omega-Regular Languages
cites work: Q4551134
cites work: Simulation relations for alternating Büchi automata
cites work: Computing Simulations over Tree Automata
cites work: A Uniform (Bi-)Simulation-Based Framework for Reducing Tree Automata
cites work: Correct Hardware Design and Verification Methods
cites work: Q4415252
cites work: Q2754087
DOI: 10.1016/J.TCS.2014.08.003
description: scientific article; zbMATH DE number 6342267