Antichains and compositional algorithms for LTL synthesis
type: Item
instance of: scholarly article
title: Antichains and compositional algorithms for LTL synthesis
zbMATH Open document ID: 1258.03046
author: Emmanuel Filiot
author: Naiyong Jin
author: Jean-François Raskin
published in: Formal Methods in System Design
publication date: 2012-09-27T00:00:00Z
Mathematics Subject Classification ID: 03D05
Mathematics Subject Classification ID: 03B44
Mathematics Subject Classification ID: 68Q45
Mathematics Subject Classification ID: 91A80
zbMATH DE Number: 6087619
zbMATH Keywords: LTL realizability and synthesis
zbMATH Keywords: automata on infinite words
zbMATH Keywords: compositional algorithms
zbMATH Keywords: antichain algorithms
zbMATH Keywords: safety game
describes a project that uses: Antichains
MaRDI profile type: Publication
full work available at URL: s10703-011-0115-3
OpenAlex ID: W2108036288
cites work: Q5692280
cites work: Translating to Co-Büchi Made Tight, Unified, and Useful
cites work: CONCUR 2005 – Concurrency Theory
cites work: Antichains: A New Algorithm for Checking Universality of Finite Automata
cites work: An Antichain Algorithm for LTL Realizability
cites work: Compositional Algorithms for LTL Synthesis
cites work: Automata, logics, and infinite games. A guide to current research
cites work: Open Implication
cites work: Compositional Control Synthesis for Partially Observable Systems
cites work: Safraless Compositional Synthesis
cites work: On Bounded Specifications
cites work: Borel determinacy
cites work: From Nondeterministic B\"uchi and Streett Automata to Deterministic Parity Automata
cites work: Verification, Model Checking, and Abstract Interpretation
cites work: Q4205072
cites work: Algorithms for Omega-Regular Games with Imperfect Information
cites work: Bounded Synthesis
cites work: Q2754087
cites work: Church’s Problem and a Tour through Automata Theory
DOI: 10.1007/S10703-011-0115-3
description: scientific article; zbMATH DE number 6087619