On nets, algebras and modularity

DOI10.1007/3-540-54415-1_46zbMath1493.68255OpenAlexW1563618635MaRDI QIDQ5096217

Alexander Rabinovich, B. A. Trakhtenbrot

Publication date: 16 August 2022

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.137.1991

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Cites Work

• Equational reasoning about nondeterministic processes
• Semantics of finite and infinite networks of concurrent communicating agents
• Connectedness and synchronization
• A fully abstract trace model for dataflow and asynchronous networks
• A generalized Kahn Principle for abstract asynchronous networks
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On nets, algebras and modularity