Latticed-LTL synthesis in the presence of noisy inputs
type: Item
instance of: scholarly article
title: Latticed-LTL synthesis in the presence of noisy inputs
zbMATH Open document ID: 1374.93029
author: Shaull Almagor
author: Orna Kupferman
published in: Discrete Event Dynamic Systems
publication date: 2017-11-10T00:00:00Z
Mathematics Subject Classification ID: 93A30
Mathematics Subject Classification ID: 93B50
Mathematics Subject Classification ID: 03B44
zbMATH DE Number: 6805733
zbMATH Keywords: synthesis
zbMATH Keywords: lattice
zbMATH Keywords: quantitative formal methods
zbMATH Keywords: automata
zbMATH Keywords: noise
MaRDI profile type: Publication
full work available at URL: s10626-017-0242-0
OpenAlex ID: W4252384962
cites work: Formalizing and Reasoning about Quality
cites work: Q5275381
cites work: Ranking Automata and Games for Prioritized Requirements
cites work: Borel determinacy
cites work: Better Quality in Synthesis through Quantitative Objectives
cites work: The complexity of two-player games of incomplete information
cites work: Quantitative Languages
cites work: Algorithms for Omega-Regular Games with Imperfect Information
cites work: Q5501249
cites work: Minimum Attention Controller Synthesis for Omega-Regular Objectives
cites work: Controller Synthesis with Budget Constraints
cites work: Q4531751
cites work: Model Checking Quantitative Linear Time Logic
cites work: An Antichain Algorithm for LTL Realizability
cites work: Consistent partial model checking
cites work: A Deterministic Subexponential Algorithm for Solving Parity Games
cites work: Lattice Automata
cites work: LATTICED SIMULATION RELATIONS AND GAMES
cites work: Church's Problem Revisited
cites work: Q4952307
cites work: Robust discrete synthesis against unspecified disturbances
cites work: Alternating finite automata on \(\omega\)-words
cites work: Q4205072
cites work: Exponential Determinization for ω‐Automata with a Strong Fairness Acceptance Condition
cites work: Solving Parity Games in Big Steps
cites work: On synthesizing robust discrete controllers under modeling uncertainty
cites work: Verified software: Theories, tools, experiments. Second international conference, VSTTE 2008, Toronto, Canada, October 6--9, 2008. Proceedings
cites work: Reasoning about infinite computations
cites work: Church Synthesis Problem for Noisy Input
DOI: 10.1007/S10626-017-0242-0
description: scientific article; zbMATH DE number 6805733