The free process algebra generated by , and

DOI10.1016/J.TCS.2011.03.019MaRDI QIDQ549205zbMATH OpenOpenAlexFDO

Authors 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

• scientific article; zbMATH DE number 1142329 (Why is no real title available?)
• scientific article; zbMATH DE number 4117829 (Why is no real title available?)
• Infinitary intuitionistic logic from a classical point of view
• Logic and structure
• On formulas of one variable in intuitionistic propositional calculus
• Process Algebra
• Process algebra for synchronous communication
• Process algebra: equational theories of communicating processes. With forewords by Tony Hoare, Robin Milner and Jan Bergstra.
• The algebra of communicating processes with empty process

This page was built for publication: The free process algebra generated by \(\delta \), \(\epsilon\) and \(\tau \)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q549205)