Nested semantics over finite trees are equationally hard

Authors:
Luca Aceto;Wan Fokkink;Rob van Glabbeek;Anna Ingólfsdóttir
Affiliations:
BRICS (Basic Research in Computer Science), Centre of the Danish National Research Foundation, Department of Computer Science, Aalborg University, Ft. Bajersvej 7E, 9220 Aalborg Ø, Denmark;CW1, Department of Software Engineering, Kruislaan 413, 1098 SJ Amsterdam, The Netherlands;INRIA, Sophia Antipolis, France;BRICS (Basic Research in Computer Science), Centre of the Danish National Research Foundation, Department of Computer Science, Aalborg University, Ft. Bajersvej 7E, 9220 Aalborg Ø, Denmark an ...
Venue:
Information and Computation
Year:
2004

Citing 19
Cited 12

Algebraic laws for nondeterminism and concurrency

Journal of the ACM (JACM)
Communicating sequential processes

Communicating sequential processes
The equational theory of pomsets

Theoretical Computer Science
CCS expressions finite state processes, and three problems of equivalence

Information and Computation
A new strategy for proving &ohgr;-completeness applied to process algebra

CONCUR '90 Proceedings on Theories of concurrency : unification and extension: unification and extension
Structured operational semantics and bisimulation as a congruence

Information and Computation
Decidability of bisimulation equivalence for process generating context-free languages

Journal of the ACM (JACM)
Undecidable equivalences for basic process algebra

Information and Computation
Bisimulation equivalence is decidable for all context-free processes

Information and Computation
Formal verification of parallel programs

Communications of the ACM
Communication and Concurrency

Communication and Concurrency
Undecidable Equivalences for Basic Parallel Processes

TACS '94 Proceedings of the International Conference on Theoretical Aspects of Computer Software
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
Bisimulation Equivalence is Decidable for Basic Parallel Processes

CONCUR '93 Proceedings of the 4th International Conference on Concurrency Theory
Concurrency and Automata on Infinite Sequences

Proceedings of the 5th GI-Conference on Theoretical Computer Science
The max-plus algebra of the natural numbers has no finite equational basis

Theoretical Computer Science
A menagerie of non-finitely based process semantics over BPA* - from ready simulation to completed traces

Mathematical Structures in Computer Science
On the axiomatizability of ready traces, ready simulation, and failure traces

ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming

Bisimilarity is not finitely based over BPA with interrupt

Theoretical Computer Science - Algebra and coalgebra in computer science
On finite alphabets and infinite bases

Information and Computation
Constrained Simulations, Nested Simulation Semantics and Counting Bisimulations

Electronic Notes in Theoretical Computer Science (ENTCS)
Coinductive Characterisations Reveal Nice Relations Between Preorders and Equivalences

Electronic Notes in Theoretical Computer Science (ENTCS)
A Cancellation Theorem for BCCSP

Fundamenta Informaticae
On Finite Bases for Weak Semantics: Failures Versus Impossible Futures

SOFSEM '09 Proceedings of the 35th Conference on Current Trends in Theory and Practice of Computer Science
Ready to preorder: get your BCCSP axiomatization for free!

CALCO'07 Proceedings of the 2nd international conference on Algebra and coalgebra in computer science
On finite alphabets and infinite bases II: completed and ready simulation

FOSSACS'06 Proceedings of the 9th European joint conference on Foundations of Software Science and Computation Structures
Bisimilarity is not finitely based over BPA with interrupt

CALCO'05 Proceedings of the First international conference on Algebra and Coalgebra in Computer Science
On finite alphabets and infinite bases III: simulation

CONCUR'06 Proceedings of the 17th international conference on Concurrency Theory
Finite equational bases in process algebra: results and open questions

Processes, Terms and Cycles
A Cancellation Theorem for BCCSP

Fundamenta Informaticae

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper studies nested simulation and nested trace semantics over the language BCCSP, a basic formalism to express finite process behaviour. It is shown that none of these semantics affords finite (in)equational axiomatizations over BCCSP. In particular, for each of the nested semantics studied in this paper, the collection of sound, closed (in)equations over a singleton action set is not finitely based.