scientific article; zbMATH DE number 883892

zbMATH Open0846.68072MaRDI QIDQ4880140FDOQ4880140

Authors: Wan Fokkink 

Publication date: 2 June 1996

Title of this publication is not available (Why is that?)

Recommendations

• Axiomatizing prefix iteration with silent steps
• A complete equational axiomatization for prefix iteration
• scientific article; zbMATH DE number 1113857

zbMATH Keywords

basic process algebrarooted branching bisimulation equivalence

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Semantics in the theory of computing (68Q55)

Cited In (11)

• A complete equational axiomatization for prefix iteration
• A complete equational axiomatization for MPA with string iteration
• Axiomatizing flat iteration
• Non-regular iterators in process algebra
• An equational axiomatization for multi-exit iteration
• Axiomatizing prefix iteration with silent steps
• Complete axiomatization for divergent-sensitive bisimulations in basic process algebra with prefix iteration
• Milner's proof system for regular expressions modulo bisimilarity is complete. Crystallization: near-collapsing process graph interpretations of regular expressions
• A complete axiomatization of weighted branching bisimulation
• Axiomatizations for the perpetual loop in process algebra
• Next-preserving branching bisimulation

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 Q4880140)