scientific article
From MaRDI portal
Publication:2754192
zbMath0973.68533MaRDI QIDQ2754192
Publication date: 9 December 2001
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Related Items
Bisimilarity is not finitely based over BPA with interrupt ⋮ Nested semantics over finite trees are equationally hard ⋮ Unique parallel decomposition in branching and weak bisimulation semantics ⋮ On finite alphabets and infinite bases ⋮ Unnamed Item ⋮ CCS with Hennessy's merge has no finite-equational axiomatization ⋮ Unnamed Item ⋮ Decomposition orders -- another generalisation of the fundamental theorem of arithmetic ⋮ The Quest for Equational Axiomatizations of Parallel Composition: Status and Open Problems
This page was built for publication: