Decidability of well-connectedness for distributed synthesis
type: Item
instance of: scholarly article
title: Decidability of well-connectedness for distributed synthesis
zbMATH Open document ID: 1259.68091
author: Paul Gastin
author: Nathalie Sznajder
published in: Information Processing Letters
publication date: 2013-03-21T00:00:00Z
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 68Q15
Mathematics Subject Classification ID: 68M14
zbMATH DE Number: 6147770
zbMATH Keywords: computational complexity
zbMATH Keywords: concurrency
zbMATH Keywords: formal methods
zbMATH Keywords: synthesis problem
zbMATH Keywords: distributed systems
MaRDI profile type: Publication
full work available at URL: j.ipl.2012.08.018
OpenAlex ID: W2059903212
cites work: Network information flow
cites work: Solving Sequential Conditions by Finite-State Strategies
cites work: Q5725991
cites work: Distributed synthesis for well-connected architectures
cites work: Q4074888
cites work: Q5501252
DOI: 10.1016/J.IPL.2012.08.018
description: scientific article; zbMATH DE number 6147770