An equational axiomatization for multi-exit iteration

DOI10.1006/INCO.1997.2645zbMATH Open0881.68069OpenAlexW2049510504MaRDI QIDQ1369097FDOQ1369097

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)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Equational axioms for regular sets
• Algebra of communicating processes with abstraction
• A calculus of communicating systems
• Two Complete Axiom Systems for the Algebra of Regular Events
• \(Ntyft/ntyxt\) rules reduce to \(n\)tree rules
• Formal verification of parallel programs
• Complete systems of \(\mathcal B\)-rational identities
• A completeness theorem for Kleene algebras and the algebra of regular events
• Process Algebra
• A complete inference system for a class of regular behaviours
• A complete axiomatisation for observational congruence of finite-state behaviours
• Graphes canoniques de graphes algébriques
• Decidability of bisimulation equivalence for process generating context-free languages
• Axiomatizing prefix iteration with silent steps
• A complete equational axiomatization for prefix iteration
• Realization of Events by Logical Nets
• Step bisimulation is pomset equivalence on a parallel language without explicit internal choice

Cited In (6)

• Exits in the refinement calculus
• Termination modulo equations by abstract commutation with an application to 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)