Pages that link to "Item:Q1377607"
From MaRDI portal
The following pages link to Nonaxiomatisability of equivalences over finite state processes (Q1377607):
Displaying 10 items.
- Nested semantics over finite trees are equationally hard (Q598202) (← links)
- Bisimilarity is not finitely based over BPA with interrupt (Q860878) (← links)
- Theory of interaction (Q896903) (← links)
- Is observational congruence on \(\mu \)-expressions axiomatisable in equational Horn logic? (Q979076) (← links)
- The equational logic of fixed points (Q1391734) (← links)
- Embedding Untimed into Timed Process Algebra; the Case for Explicit Termination (Q4917024) (← links)
- Complete Axiomatization for Divergent-Sensitive Bisimulations in Basic Process Algebra with Prefix Iteration (Q5415608) (← links)
- On the axiomatisability of priority (Q5458057) (← links)
- Non-deterministic structures of computation (Q5740658) (← links)
- Non-regular iterators in process algebra (Q5958616) (← links)
