An equational axiomatization for multi-exit iteration
From MaRDI portal
Publication:1369097
DOI10.1006/inco.1997.2645zbMath0881.68069OpenAlexW2049510504MaRDI QIDQ1369097
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
Related Items (5)
Axiomatizations for the perpetual loop in process algebra ⋮ Termination modulo equations by abstract commutation with an application to iteration ⋮ A Finite Axiomatization of Nondeterministic Regular Expressions ⋮ Non-regular iterators in process algebra ⋮ A note on an expressiveness hierarchy for multi-exit iteration
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- 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
- Algebra of communicating processes with abstraction
- A calculus of communicating systems
- Complete systems of \(\mathcal B\)-rational identities
- A complete axiomatisation for observational congruence of finite-state behaviours
- A completeness theorem for Kleene algebras and the algebra of regular events
- A complete equational axiomatization for prefix iteration
- \(Ntyft/ntyxt\) rules reduce to \(n\)tree rules
- Axiomatizing prefix iteration with silent steps
- Decidability of bisimulation equivalence for process generating context-free languages
- Realization of Events by Logical Nets
- Graphes canoniques de graphes algébriques
- Process Algebra
- Formal verification of parallel programs
- Equational axioms for regular sets
- Step bisimulation is pomset equivalence on a parallel language without explicit internal choice
- Two Complete Axiom Systems for the Algebra of Regular Events
This page was built for publication: An equational axiomatization for multi-exit iteration
