Journal article
On Partial Order Characterizations of Information Structures
Mathematics of control, signals, and systems, Vol.13(4), pp.277-292
12/2000
DOI: 10.1007/PL00009870
Abstract
The degree of concurrency possible in an informationally decentralized nonsequential system is determined by the precedence constraints imposed by the system's information structure on its controlled and uncontrolled inputs. One approach to characterizing these constraints is to attempt to associate each realization of the system's inputs with the strongest partial ordering of the system's decision-making agents that is consistent with the system's information structure. If such an association is possible, it leads to a partial order characterization of the corresponding information structure. In this paper we show that, in general, no such partial order characterization exists and we identify a sufficient (but not necessary) condition for existence. The condition has design implications that are important and intuitive and are discussed in the paper. Our results demonstrate that partial-order-based descriptions of concurrency, sometimes used in computer science, are not always correct.
Details
- Title: Subtitle
- On Partial Order Characterizations of Information Structures
- Creators
- Demosthenis Teneketzis - Department of Electrical Engineering and Computer Science, University of Michigan, Ann Arbor, Michigan 48109-2122, U.S.A. teneketzis@eecs.umich.edu. USMark S Andersland - Department of Electrical and Computer Engineering, University of Iowa, Iowa City, Iowa 52242-1595, U.S.A. msanders@icaen.uiowa.edu. US
- Resource Type
- Journal article
- Publication Details
- Mathematics of control, signals, and systems, Vol.13(4), pp.277-292
- DOI
- 10.1007/PL00009870
- ISSN
- 0932-4194
- eISSN
- 1435-568X
- Publisher
- Springer-Verlag London Limited
- Language
- English
- Date published
- 12/2000
- Academic Unit
- Electrical and Computer Engineering
- Record Identifier
- 9984083226002771
Metrics
17 Record Views