On finite alphabets and infinite bases

DOI10.1016/j.ic.2007.09.003zbMath1146.68047OpenAlexW2133267148MaRDI QIDQ924717

Bas Luttik, Taolue Chen, Sumit Nain, W. J. Fokkink

Publication date: 19 May 2008

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ic.2007.09.003

zbMATH Keywords

process algebraconcurrencyequational theory\(\omega \)-completeness

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Semantics in the theory of computing (68Q55) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (9)

The Equational Theory of Weak Complete Simulation Semantics over BCCSP ⋮ Axiomatizing recursion-free, regular monitors ⋮ Complete and ready simulation semantics are not finitely based over BCCSP, even with a singleton alphabet ⋮ Unnamed Item ⋮ Axiomatizing weak simulation semantics over BCCSP ⋮ Ready to preorder: the case of weak process semantics ⋮ On Finite Bases for Weak Semantics: Failures Versus Impossible Futures ⋮ Unnamed Item ⋮ Axiomatizing Weak Ready Simulation Semantics over BCCSP

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Tools for proving inductive equalities, relative completeness, and \(\omega\)-completeness
• Nested semantics over finite trees are equationally hard
• Equational theory of positive numbers with exponentiation is not finitely axiomatizable
• Partial evaluation and \(\omega\)-completeness of algebraic specifications
• A calculus of communicating systems
• A Finite Equational Base for CCS with Left Merge and Communication Merge
• Ready to Preorder: Get Your BCCSP Axiomatization for Free!
• The λ-calculus is ω-incomplete
• The Logic of Equality
• TARSKI’S FINITE BASIS PROBLEM IS UNDECIDABLE
• Foundations of Software Science and Computation Structures
• Automata, Languages and Programming
• On Finite Alphabets and Infinite Bases III: Simulation
• Identities in Two-Valued Calculi
• Processes, Terms and Cycles: Steps on the Road to Infinity
• Foundations of Software Science and Computation Structures

This page was built for publication: On finite alphabets and infinite bases