Lifting non-finite axiomatizability results to extensions of process algebras

DOI10.1007/S00236-010-0114-7zbMATH Open1186.68313OpenAlexW2137908781WikidataQ57745625 ScholiaQ57745625MaRDI QIDQ969643FDOQ969643

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

Recommendations

• Nonaxiomatisability of equivalences over finite state processes
• The equational theory of prebisimilarity over basic CCS with divergence
• The Saga of the Axiomatization of Parallel Composition
• CCS with Hennessy's merge has no finite-equational axiomatization
• On the axiomatizability of impossible futures

zbMATH Keywords

reduction mappings

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (11)

• Title not available (Why is that?)
• The equational theory of prebisimilarity over basic CCS with divergence
• The Equational Theory of Weak Complete Simulation Semantics over BCCSP
• Axiomatizing Weak Ready Simulation Semantics over BCCSP
• Title not available (Why is that?)
• Predicatively unprovable termination of the Ackermannian Goodstein process
• Complete and ready simulation semantics are not finitely based over BCCSP, even with a singleton alphabet
• Non-finite axiomatisability results via reductions: CSP parallel composition and CCS restriction
• Are Two Binary Operators Necessary to Obtain a Finite Axiomatisation of Parallel Composition?
• Axiomatizing weak simulation semantics over BCCSP
• Title not available (Why is that?)

Uses Software

• mCRL2
• mCRL

This page was built for publication: Lifting non-finite axiomatizability results to extensions of process algebras

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