Categories of Interaction Processes
{'Code': '05010100', 'Directorate': {'LongName': 'Direct For Computer & Info Scie & Enginr'}, 'Division': {'LongName': 'Division of Computing and Communication Foundations'}}
{'SignBlockName': 'Bruce H. Barnes'}
The central features of concurrent, parallel and distributed computation are captured in the settings of monoidal categories with finite biproducts, countable coproducts, and distributive laws. Such categories are not only thoroughly researched, but central to any study of dynamics. In these categories the interplay of monoids (algebras) and comonoids (coalgebras) play an important role in the analysis of dynamics. A traditional usage is in Hopf algebras, the central features of which abstract to bimonoids (bialgebras). Processes which make progress by interaction require further research into a different interplay between monoids and comonoids. Call these dimonoids (dialgebras). In addition, careful attention must be paid to the role of silent moves. The combination of dimonoid structure with nontrivial grade zero objects requires careful study. The research will proceed first at the level of automata (semiautomata, labeled transition systems) and then abstract to equivalence classes of automata functorially.
{'FirstName': 'David', 'LastName': 'Benson', 'EmailAddress': 'dbenson@eecs.wsu.edu', 'StartDate': '08/01/1988', 'EndDate': None, 'RoleCode': 'Principal Investigator'}
{'Name': 'Washington State University', 'CityName': 'PULLMAN', 'ZipCode': '991641060', 'PhoneNumber': '5093359661', 'StreetAddress': '280 Lighty', 'CountryName': 'United States', 'StateName': 'Washington', 'StateCode': 'WA'}
{'Code': '2860', 'Text': 'THEORY OF COMPUTING'}
{'url': 'https://www.nsf.gov/awardsearch/download?DownloadFileName=1988&All=true', 'xml': '8801866.xml'}