CCS with Hennessy's merge has no finite-equational axiomatization

This paper confirms a conjecture of Bergstra and Klop's from 1984 by establishing that the process algebra obtained by adding an auxiliary operator proposed by Hennessy in 1981 to the recursion free fragment of Milner's Calculus of Communicating Systems is not finitely based modulo bisimul...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Theoretical computer science Ročník 330; číslo 3; s. 377 - 405
Hlavní autori:	Aceto, Luca, Fokkink, Wan, Ingólfsdóttir, Anna, Luttik, Bas
Médium:	Journal Article Konferenčný príspevok..
Jazyk:	English
Vydavateľské údaje:	Amsterdam Elsevier B.V 09.02.2005 Elsevier
Predmet:	Algebra Algorithmics. Computability. Computer arithmetics Applied sciences Bisimulation CCS Communication merge Complete axiomatizations Computer science; control theory; systems Concurrency Equational logic Exact sciences and technology General algebraic systems General logic Hennessy's merge Left merge Logic and foundations Mathematical logic, foundations, set theory Mathematics Model theory Non-finitely based algebras Process algebra Sciences and techniques of general use Theoretical computing Process algebra Non-finitely based algebras 68Q45 Communication merge Complete axiomatizations Hennessy's merge 08A70 CCS Concurrency Bisimulation Equational logic 03C05 68Q70 03B45 68Q55 68Q10 Left merge Computer theory Bisimulation equivalence Calculus of communicating systems Axiomatic theory Hennessy merge
ISSN:	0304-3975, 1879-2294
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!