On Finite Alphabets and Infinite Bases III: Simulation

DOI10.1007/11817949_28zbMATH Open1151.68519OpenAlexW2162466826MaRDI QIDQ5756593FDOQ5756593

Authors: Taolue Chen, Wan Fokkink 

Publication date: 4 September 2007

Published in: CONCUR 2006 – Concurrency Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11817949_28

Recommendations

• Foundations of Software Science and Computation Structures
• On finite alphabets and infinite bases
• Foundations of Software Science and Computation Structures
• Coding on Countably Infinite Alphabets
• Applications of symbolic dynamics on an infinite alphabet
• Alphabets, rewriting trails and periodic representations in algebraic bases
• Counting Multiplicity over Infinite Alphabets
• Critical bases for ternary alphabets
• Automata over infinite alphabets
• Expansions in multiple bases over general alphabets

Mathematics Subject Classification ID

Logic in computer science (03B70) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Cited In (9)

• The equational theory of weak complete simulation semantics over BCCSP
• Foundations of Software Science and Computation Structures
• Is observational congruence on \(\mu \)-expressions axiomatisable in equational Horn logic?
• Trace simulation semantics is not finitely based over BCCSP
• Title not available (Why is that?)
• Foundations of Software Science and Computation Structures
• Complete and ready simulation semantics are not finitely based over BCCSP, even with a singleton alphabet
• On finite alphabets and infinite bases
• Axiomatizing weak simulation semantics over BCCSP

This page was built for publication: On Finite Alphabets and Infinite Bases III: Simulation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5756593)