An equational axiomatization for multi-exit iteration

DOI10.1006/INCO.1997.2645MaRDI QIDQ1369097zbMATH OpenOpenAlexFDO

Authors Luca Aceto, Wan Fokkink

Publication date 16 February 1998

Published in Information and Computation (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/4e5ce18dae41c0968a1236186c754cf5a2065776

zbMATH Keywords

basic process algebra

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• A note on an expressiveness hierarchy for multi-exit iteration
• A complete equational axiomatization for MPA with string iteration
• A complete equational axiomatization for prefix iteration
• Axiomatizations for the perpetual loop in process algebra
• scientific article; zbMATH DE number 883892

Cites work

• scientific article; zbMATH DE number 4039251 (Why is no real title available?)
• scientific article; zbMATH DE number 3716792 (Why is no real title available?)
• scientific article; zbMATH DE number 42752 (Why is no real title available?)
• scientific article; zbMATH DE number 3550181 (Why is no real title available?)
• scientific article; zbMATH DE number 1113856 (Why is no real title available?)
• scientific article; zbMATH DE number 1113857 (Why is no real title available?)
• scientific article; zbMATH DE number 1142311 (Why is no real title available?)
• scientific article; zbMATH DE number 1555176 (Why is no real title available?)
• scientific article; zbMATH DE number 883892 (Why is no real title available?)
• scientific article; zbMATH DE number 3229496 (Why is no real title available?)
• scientific article; zbMATH DE number 3307592 (Why is no real title available?)
• scientific article; zbMATH DE number 3362975 (Why is no real title available?)
• scientific article; zbMATH DE number 3366846 (Why is no real title available?)
• scientific article; zbMATH DE number 3412171 (Why is no real title available?)
• A calculus of communicating systems
• A complete axiomatisation for observational congruence of finite-state behaviours
• A complete equational axiomatization for prefix iteration
• A complete inference system for a class of regular behaviours
• A completeness theorem for Kleene algebras and the algebra of regular events
• Algebra of communicating processes with abstraction
• Axiomatizing prefix iteration with silent steps
• Complete systems of \(\mathcal B\)-rational identities
• Decidability of bisimulation equivalence for process generating context-free languages
• Equational axioms for regular sets
• Formal verification of parallel programs
• Graphes canoniques de graphes algébriques
• Process Algebra
• Realization of Events by Logical Nets
• Step bisimulation is pomset equivalence on a parallel language without explicit internal choice
• Two Complete Axiom Systems for the Algebra of Regular Events
• \(Ntyft/ntyxt\) rules reduce to \(n\)tree rules

Cited in

(7)

• Exits in the refinement calculus
• Termination modulo equations by abstract commutation with an application to iteration
• Axiomatizing flat iteration
• Non-regular iterators in process algebra
• A note on an expressiveness hierarchy for multi-exit iteration
• A Finite Axiomatization of Nondeterministic Regular Expressions
• Axiomatizations for the perpetual loop in process algebra

This page was built for publication: An equational axiomatization for multi-exit iteration

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