Lifting non-finite axiomatizability results to extensions of process algebras

DOI10.1007/s00236-010-0114-7zbMath1186.68313OpenAlexW2137908781WikidataQ57745625 ScholiaQ57745625MaRDI QIDQ969643

B. E. Eshmatov

Publication date: 7 May 2010

Published in: Acta Informatica (Search for Journal in Brave)

Full work available at URL: https://research.vu.nl/en/publications/9e8affc4-e7cb-411e-952e-03688815a541

zbMATH Keywords

reduction mappings

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items

The Equational Theory of Weak Complete Simulation Semantics over BCCSP, Are Two Binary Operators Necessary to Obtain a Finite Axiomatisation of Parallel Composition?, Non-finite axiomatisability results via reductions: CSP parallel composition and CCS restriction, Complete and ready simulation semantics are not finitely based over BCCSP, even with a singleton alphabet, Unnamed Item, Axiomatizing weak simulation semantics over BCCSP, The equational theory of prebisimilarity over basic CCS with divergence, Unnamed Item, Axiomatizing Weak Ready Simulation Semantics over BCCSP

Uses Software

• mCRL2
• mCRL

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Bisimulation on speed: Worst-case efficiency
• Interactive Markov chains. And the quest for quantified quality
• Ready to preorder: an algebraic and general proof
• Bisimilarity is not finitely based over BPA with interrupt
• Ready to preorder: the case of weak process semantics
• Nonfinite axiomatizability of the equational theory of shuffle
• A conservative look at operational semantics with variable binding
• The algebra of timed processes, ATP: Theory and application
• CCS with Hennessy's merge has no finite-equational axiomatization
• A structural approach to operational semantics
• Bisimulation on speed: a unified approach
• CPO models for compact GSOS languages
• A domain equation for bisimulation
• On the Axiomatizability of Priority
• Ready to Preorder: Get Your BCCSP Axiomatization for Free!
• Impossibility Results for the Equational Theory of Timed CCS
• Process algebra for synchronous communication
• A term model for synchronous processes
• Process Algebra
• Termination, deadlock, and divergence
• Foundations of Software Science and Computation Structures
• Automata, Languages and Programming
• Processes, Terms and Cycles: Steps on the Road to Infinity