The free process algebra generated by \(\delta \), \(\epsilon\) and \(\tau \)

DOI10.1016/j.tcs.2011.03.019zbMath1216.68195OpenAlexW1514227910MaRDI QIDQ549205

Jan Willem Klop, Karst Koymans, Jos Vrancken, P. H. Rodenburg

Publication date: 7 July 2011

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2011.03.019

zbMATH Keywords

process algebrabisimulationHeyting algebraempty processinfinite sums and productssilent step

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The algebra of communicating processes with empty process
• Process algebra for synchronous communication
• On formulas of one variable in intuitionistic propositional calculus
• Process Algebra
• Infinitary intuitionistic logic from a classical point of view
• Logic and structure