Pages that link to "Item:Q924717"
From MaRDI portal
The following pages link to On finite alphabets and infinite bases (Q924717):
Displaying 9 items.
- Ready to preorder: the case of weak process semantics (Q975539) (← links)
- Complete and ready simulation semantics are not finitely based over BCCSP, even with a singleton alphabet (Q1944909) (← links)
- Axiomatizing recursion-free, regular monitors (Q2141297) (← links)
- Axiomatizing weak simulation semantics over BCCSP (Q2453533) (← links)
- The Equational Theory of Weak Complete Simulation Semantics over BCCSP (Q2891363) (← links)
- Axiomatizing Weak Ready Simulation Semantics over BCCSP (Q3105742) (← links)
- On Finite Bases for Weak Semantics: Failures Versus Impossible Futures (Q3599070) (← links)
- (Q5028469) (← links)
- (Q5089283) (← links)
