The free process algebra generated by , and

DOI10.1016/J.TCS.2011.03.019zbMATH Open1216.68195OpenAlexW1514227910MaRDI QIDQ549205FDOQ549205

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

• Process algebra for synchronous communication
• Process Algebra
• Title not available (Why is that?)
• Logic and structure
• The algebra of communicating processes with empty process
• Process algebra: equational theories of communicating processes. With forewords by Tony Hoare, Robin Milner and Jan Bergstra.
• On formulas of one variable in intuitionistic propositional calculus
• Infinitary intuitionistic logic from a classical point of view
• Title not available (Why is that?)

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)