Pages that link to "Item:Q1342264"
From MaRDI portal
The following pages link to A complete equational axiomatization for prefix iteration (Q1342264):
Displaying 15 items.
- Is observational congruence on \(\mu \)-expressions axiomatisable in equational Horn logic? (Q979076) (← links)
- Independence of the equational axioms for iteration theories (Q1106011) (← links)
- A complete equational axiomatization for MPA with string iteration (Q1274456) (← links)
- An equational axiomatization for multi-exit iteration (Q1369097) (← links)
- Nonaxiomatisability of equivalences over finite state processes (Q1377607) (← links)
- Termination modulo equations by abstract commutation with an application to iteration (Q1391793) (← links)
- Discrete time process algebra (Q1914041) (← links)
- Axiomatizing prefix iteration with silent steps (Q1923086) (← links)
- Models of nondeterministic regular expressions (Q1970200) (← links)
- SOS rule formats for idempotent terms and idempotent unary operators (Q2436519) (← links)
- Embedding Untimed into Timed Process Algebra; the Case for Explicit Termination (Q4917024) (← links)
- A sound and complete abstraction for reasoning about parallel prefix sums (Q5408435) (← links)
- Complete Axiomatization for Divergent-Sensitive Bisimulations in Basic Process Algebra with Prefix Iteration (Q5415608) (← links)
- Non-regular iterators in process algebra (Q5958616) (← links)
- Axiomatizing flat iteration (Q6044120) (← links)