Lifting non-finite axiomatizability results to extensions of process algebras
type: Item
instance of: scholarly article
title: Lifting non-finite axiomatizability results to extensions of process algebras
zbMATH Open document ID: 1186.68313
author: B. E. Eshmatov
published in: Acta Informatica
publication date: 2010-05-07T00:00:00Z
Mathematics Subject Classification ID: 68Q85
zbMATH DE Number: 5705447
zbMATH Keywords: reduction mappings
describes a project that uses: mCRL2
describes a project that uses: mCRL
MaRDI profile type: Publication
OpenAlex ID: W2137908781
cites work: A domain equation for bisimulation
cites work: On the Axiomatizability of Priority
cites work: Ready to Preorder: Get Your BCCSP Axiomatization for Free!
cites work: CCS with Hennessy's merge has no finite-equational axiomatization
cites work: Processes, Terms and Cycles: Steps on the Road to Infinity
cites work: Bisimilarity is not finitely based over BPA with interrupt
cites work: Termination, deadlock, and divergence
cites work: CPO models for compact GSOS languages
cites work: Impossibility Results for the Equational Theory of Timed CCS
cites work: Structural operational semantics.
cites work: Q4790410
cites work: Process Algebra
cites work: Process algebra for synchronous communication
cites work: Q4551157
cites work: Ready to preorder: the case of weak process semantics
cites work: Ready to preorder: an algebraic and general proof
cites work: Nonfinite axiomatizability of the equational theory of shuffle
cites work: A conservative look at operational semantics with variable binding
cites work: Q3614665
cites work: Q4288818
cites work: A term model for synchronous processes
cites work: Q4223008
cites work: Interactive Markov chains. And the quest for quantified quality
cites work: Q3777424
cites work: Bisimulation on speed: Worst-case efficiency
cites work: Foundations of Software Science and Computation Structures
cites work: Bisimulation on speed: a unified approach
cites work: Q3929062
cites work: Q3992568
cites work: Q4038732
cites work: Automata, Languages and Programming
cites work: The algebra of timed processes, ATP: Theory and application
cites work: A structural approach to operational semantics
cites work: Q3392273
Wikidata QID: Q57745625
DOI: 10.1007/S00236-010-0114-7
description: scientific article; zbMATH DE number 5705447