Pages that link to "Item:Q1923086"

The following pages link to Axiomatizing prefix iteration with silent steps (Q1923086):

Displaying 17 items.

• A generalization of ACP using Belnap's logic (Q864509) (← links)
• Is observational congruence on \(\mu \)-expressions axiomatisable in equational Horn logic? (Q979076) (← 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)
• Mechanising a type-safe model of multithreaded Java with a verified compiler (Q1663233) (← links)
• Ordered SOS process languages for branching and eager bisimulations (Q1854563) (← links)
• Process languages with discrete relative time based on the ordered SOS format and rooted eager bisimulation (Q1878718) (← links)
• Models of nondeterministic regular expressions (Q1970200) (← links)
• Coupled similarity: the first 32 years (Q2182667) (← links)
• Axiomatizations for the perpetual loop in process algebra (Q4571987) (← links)
• A Finite Axiomatization of Nondeterministic Regular Expressions (Q4943553) (← links)
• Canonical Solutions to Recursive Equations and Completeness of Equational Axiomatisations. (Q5089302) (← 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)