On partial order characterizations of information structures
type: Item
instance of: scholarly article
title: On partial order characterizations of information structures
zbMATH Open document ID: 0966.93016
DOI: 10.1007/PL00009870
author: Demosthenis Teneketzis
author: Mark S. Andersland
published in: MCSS. Mathematics of Control, Signals, and Systems
publication date: 2001-07-30T00:00:00Z
review text: This paper presents a sufficient condition for the existence of partial order characterizations of information structures, and is based upon the Witsenhausen model which is the most appropriate to analyze the relationship between information structure and concurrency. As a result, it is shown that the partial-order-based descriptions of concurrency customarily used by computer scientists are not always suitable.
Mathematics Subject Classification ID: 93A14
Mathematics Subject Classification ID: 93C41
Mathematics Subject Classification ID: 94A15
Mathematics Subject Classification ID: 06A06
Mathematics Subject Classification ID: 68Q85
zbMATH DE Number: 1569513
zbMATH Keywords: information structure
zbMATH Keywords: concurrency
zbMATH Keywords: nonsequential systems
zbMATH Keywords: deadlock-freeness
reviewed by: Guy Jumarie
MaRDI profile type: Publication
Recommended article: A lower bound for the complexity of information networks for one partial order relation
Recommended article: Ordered information systems and graph granulation
Recommended article: Q3686039
Recommended article: A partial order on uncertainty and information
Recommended article: Realizing partitions respecting full and partial order information
Recommended article: On Computing Extensions and Restrictions of Information Systems Noting Some Order Properties
Recommended article: Q4281648
Recommended article: On the complexity of partial order properties
Recommended article: CHARACTERIZING CLASSES OF STRUCTURED OBJECTS BY MEANS OF INFORMATION INEQUALITIES
description: scientific article; zbMATH DE number 1569513