Impossibility Results in the Equational Logic of Processes

Authors:
Luca Aceto
Affiliations:
Department of Computer Science, School of Science and Engineering, Reykjavík University, 103 Reykjavík, Iceland and BRICS, Department of Computer Science, Aalborg University, 9220 Aalbor ...
Venue:
Electronic Notes in Theoretical Computer Science (ENTCS)
Year:
2007

Citing 10
Cited 0

Communicating sequential processes

Communicating sequential processes
Process algebra

Process algebra
Formal verification of parallel programs

Communications of the ACM
Communication and Concurrency

Communication and Concurrency
The Importance of the Left Merge Operator in Process Algebras

ICALP '90 Proceedings of the 17th International Colloquium on Automata, Languages and Programming
An Interactive Proof Tool for Process Algebras

STACS '92 Proceedings of the 9th Annual Symposium on Theoretical Aspects of Computer Science
Concurrency and Automata on Infinite Sequences

Proceedings of the 5th GI-Conference on Theoretical Computer Science
CCS with Hennessy's merge has no finite-equational axiomatization

Theoretical Computer Science - Expressiveness in concurrency
Bisimilarity is not finitely based over BPA with interrupt

CALCO'05 Proceedings of the First international conference on Algebra and Coalgebra in Computer Science
Finite equational bases in process algebra: results and open questions

Processes, Terms and Cycles

Quantified Score

Hi-index	0.00

Visualization

Abstract

This talk offers a survey of negative results on the existence of finite equational axiomatizations for bisimulation equivalence over fragments of algebraic process calculi.