Lifting non-finite axiomatizability results to extensions of process algebras
From MaRDI portal
Publication:969643
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
Cites work
- scientific article; zbMATH DE number 5595151 (Why is no real title available?)
- scientific article; zbMATH DE number 4039251 (Why is no real title available?)
- scientific article; zbMATH DE number 3744561 (Why is no real title available?)
- scientific article; zbMATH DE number 42752 (Why is no real title available?)
- scientific article; zbMATH DE number 177854 (Why is no real title available?)
- scientific article; zbMATH DE number 1231680 (Why is no real title available?)
- scientific article; zbMATH DE number 555217 (Why is no real title available?)
- scientific article; zbMATH DE number 1796138 (Why is no real title available?)
- scientific article; zbMATH DE number 1860682 (Why is no real title available?)
- A conservative look at operational semantics with variable binding
- A domain equation for bisimulation
- A structural approach to operational semantics
- A term model for synchronous processes
- Analysis of distributed systems with mCRL2
- Automata, Languages and Programming
- Bisimilarity is not finitely based over BPA with interrupt
- Bisimulation on speed: Worst-case efficiency
- Bisimulation on speed: a unified approach
- CCS with Hennessy's merge has no finite-equational axiomatization
- CPO models for compact GSOS languages
- Foundations of Software Science and Computation Structures
- Impossibility Results for the Equational Theory of Timed CCS
- Interactive Markov chains. And the quest for quantified quality
- Nonfinite axiomatizability of the equational theory of shuffle
- On the Axiomatizability of Priority
- Process Algebra
- Process algebra for synchronous communication
- Processes, Terms and Cycles: Steps on the Road to Infinity
- Ready to Preorder: Get Your BCCSP Axiomatization for Free!
- Ready to preorder: an algebraic and general proof
- Ready to preorder: the case of weak process semantics
- Structural operational semantics.
- Termination, deadlock, and divergence
- The algebra of timed processes, ATP: Theory and application
Cited in
(11)- scientific article; zbMATH DE number 7471704 (Why is no real title available?)
- Axiomatizing weak ready simulation semantics over BCCSP
- The equational theory of weak complete simulation semantics over BCCSP
- scientific article; zbMATH DE number 177531 (Why is no real title available?)
- Non-finite axiomatisability results via reductions: CSP parallel composition and CCS restriction
- Predicatively unprovable termination of the Ackermannian Goodstein process
- Complete and ready simulation semantics are not finitely based over BCCSP, even with a singleton alphabet
- Are Two Binary Operators Necessary to Obtain a Finite Axiomatisation of Parallel Composition?
- The equational theory of prebisimilarity over basic CCS with divergence
- scientific article; zbMATH DE number 7559474 (Why is no real title available?)
- Axiomatizing weak simulation semantics over BCCSP
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)