scientific article; zbMATH DE number 2038703

MaRDI QIDQ4449168zbMATH OpenFDO

Authors Stefan Blom, Sumit Nain, Wan Fokkink

Publication date 8 February 2004

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2719/27190109.htm

Mathematics Subject Classification ID

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

Recommendations

• Axiomatizing weak ready simulation semantics over BCCSP
• Ready to Preorder: Get Your BCCSP Axiomatization for Free!
• A menagerie of non-finitely based process semantics over BPA* – from ready simulation to completed traces
• On finite alphabets and infinite bases
• Ready-Trace Semantics for Concrete Process Algebra with the Priority Operator

Cited in

(14)

• (Bi)simulations up-to characterise process semantics
• Axiomatizing weak ready simulation semantics over BCCSP
• On the axiomatizability of impossible futures
• Ready to Preorder: Get Your BCCSP Axiomatization for Free!
• Trace- and failure-based semantics for responsiveness
• scientific article; zbMATH DE number 7471704 (Why is no real title available?)
• scientific article; zbMATH DE number 7559474 (Why is no real title available?)
• Ready Simulation for Concurrency: It’s Logical!
• Nested semantics over finite trees are equationally hard
• From bisimulation to traces: the impact of parallel composition on finite bases
• Ready to preorder: an algebraic and general proof
• Bisimilarity is not finitely based over BPA with interrupt
• On finite alphabets and infinite bases
• Ready simulation for concurrency: it's logical!

This page was built for publication:

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