Concurrent Transition System Models of Process Networks
{'Code': '05010400', 'Directorate': {'Abbreviation': 'CSE', 'LongName': 'Direct For Computer & Info Scie & Enginr'}, 'Division': {'Abbreviation': 'CCF', 'LongName': 'Division of Computing and Communication Foundations'}}
{'SignBlockName': 'name not available', 'PO_EMAI': None, 'PO_PHON': None}
This research is aimed at obtaining a better understanding of                   mathematical models for networks of concurrent processes, and the               relationships between such models.  Of particular interest is the               relationship between "CCS/CSP-style" models and "dataflow-style"                models.  The primary tool to be used in this investigation is a                 collection of mathematical structures called concurrent transition              systems.  Concurrent transition systems, are a generalization of                ordinary nondeterministic transition systems into which concurrency             information has been incorporated in a convenient fashion.                                                                                                      The basic approach consists of three steps: (1) use concurrent                  transition systems to define a general operational model of concurrent          processes, called labeled processes, in which network-building                  operations on processes have simple algebraic definitions; (2) define           various ways of mapping the labeled process model to more abstract              models; and (3) investigate how the network-building operations                 translate under these abstraction mappings.  Preliminary work has               resulted in a simple characterization of a subclass of labeled                  processes, called Kahn processes, which are "dataflow-like" processes           with timing-independent, functional behavior.  From this                        characterization, a simple and direct proof is obtained, of the fact            that network interconnection of Kahn processes obeys Kahn's fixed point         principle.
{'FirstName': 'Eugene', 'LastName': 'Stark', 'PI_MID_INIT': 'W', 'PI_SUFX_NAME': None, 'PI_FULL_NAME': 'Eugene W Stark', 'EmailAddress': 'stark@cs.sunysb.edu', 'NSF_ID': '000122026', 'StartDate': '08/01/1987', 'EndDate': None, 'RoleCode': 'Principal Investigator'}
{'Name': 'SUNY at Stony Brook', 'CityName': 'STONY BROOK', 'ZipCode': '117940001', 'PhoneNumber': '6316329949', 'StreetAddress': 'W5510 FRANKS MELVILLE MEMORIAL L', 'StreetAddress2': None, 'CountryName': 'United States', 'StateName': 'New York', 'StateCode': 'NY', 'CONGRESSDISTRICT': '01', 'CONGRESS_DISTRICT_ORG': 'NY01', 'ORG_UEI_NUM': 'M746VC6XMNH9', 'ORG_LGL_BUS_NAME': 'THE RESEARCH FOUNDATION FOR THE STATE UNIVERSITY OF NEW YORK', 'ORG_PRNT_UEI_NUM': None}
{'Name': None, 'CityName': None, 'StateCode': None, 'ZipCode': None, 'StreetAddress': None, 'CountryCode': None, 'CountryName': None, 'StateName': None, 'CountryFlag': None, 'CONGRESSDISTRICT': None, 'CONGRESS_DISTRICT_PERF': '""'}
{'Code': '2875', 'Text': 'SYSTEM SOFTWARE'}
{'url': 'https://www.nsf.gov/awardsearch/download?DownloadFileName=1987&All=true', 'xml': '8702247.xml'}