scientific article; zbMATH DE number 1555176
From MaRDI portal
Publication:4525274
zbMath0953.68572MaRDI QIDQ4525274
Jan A. Bergstra, Alban Ponse, Inge Bethke
Publication date: 22 January 2001
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Combinatory logic and lambda calculus (03B40)
Related Items (23)
Branching time and orthogonal bisimulation equivalence ⋮ A complete equational axiomatization for prefix iteration ⋮ A generalization of ACP using Belnap's logic ⋮ An equational axiomatization for multi-exit iteration ⋮ Axiomatizations for the perpetual loop in process algebra ⋮ Nonaxiomatisability of equivalences over finite state processes ⋮ Execution architectures for program algebra ⋮ A process calculus with finitary comprehended terms ⋮ Unnamed Item ⋮ An algebraic semantics for hierarchical P/T nets ⋮ A general conservative extension theorem in process algebras with inequalities ⋮ Termination modulo equations by abstract commutation with an application to iteration ⋮ Two finite specifications of a queue ⋮ Using Hoare Logic in a Process Algebra Setting ⋮ Bochvar-McCarthy logic and process algebra ⋮ Fixing Zeno gaps ⋮ Concurrent Kleene algebra and its foundations ⋮ Non-regular iterators in process algebra ⋮ The parallel composition of uniform processes with data ⋮ A note on an expressiveness hierarchy for multi-exit iteration ⋮ A complete equational axiomatization for MPA with string iteration ⋮ Equivalence of recursive specifications in process algebra ⋮ The max-plus algebra of the natural numbers has no finite equational basis
This page was built for publication:
