A note on an expressiveness hierarchy for multi-exit iteration

DOI10.1016/S0020-0190(03)00234-5zbMath1175.68266OpenAlexW2143422750MaRDI QIDQ1014386

Anna Ingólfsdóttir, Luca Aceto, W. J. Fokkink

Publication date: 28 April 2009

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0020-0190(03)00234-5

zbMATH Keywords

process algebrabisimulationexpressivenessconcurrencybasic process algebra (BPA)multi-exit iteration

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A complete inference system for a class of regular behaviours
• Complete systems of \(\mathcal B\)-rational identities
• A completeness theorem for Kleene algebras and the algebra of regular events
• An equational axiomatization for multi-exit iteration
• Decidability of bisimulation equivalence for process generating context-free languages
• Graphes canoniques de graphes algébriques
• Process Algebra
• On the capabilities of while, repeat, and exit statements

This page was built for publication: A note on an expressiveness hierarchy for multi-exit iteration