An incompleteness result in process algebra

DOI10.1016/0020-0190(88)90030-0zbMath0661.68030OpenAlexW2022663853MaRDI QIDQ1113665

Andrzej Szałas

Publication date: 1988

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(88)90030-0

zbMATH Keywords

process algebraincompletenessconcurrencyobservational equivalencecommunicating processesequivalence problem for Turing machines

Mathematics Subject Classification ID

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Algebra of communicating processes with abstraction
• A calculus of communicating systems
• Process algebra for synchronous communication

This page was built for publication: An incompleteness result in process algebra