On finite alphabets and infinite bases
From MaRDI portal
Publication:924717
DOI10.1016/j.ic.2007.09.003zbMath1146.68047MaRDI 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
68Q45: Formal languages and automata
68Q55: Semantics in the theory of computing
68Q85: Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.)
Related Items
Ready to preorder: the case of weak process semantics, Complete and ready simulation semantics are not finitely based over BCCSP, even with a singleton alphabet, Axiomatizing weak simulation semantics over BCCSP, The Equational Theory of Weak Complete Simulation Semantics over BCCSP, Axiomatizing Weak Ready Simulation Semantics over BCCSP, On Finite Bases for Weak Semantics: Failures Versus Impossible Futures
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
