The following pages link to Process Algebra (Q3999164):
Displayed 20 items.
- Processes with infinite liveness requirements (Q383788) (← links)
- Tree shuffle (Q389936) (← links)
- Specifying termination in CSP (Q407510) (← links)
- Rule formats for determinism and idempotence (Q433348) (← links)
- The infinite evolution mechanism of \(\epsilon\)-bisimilarity (Q458130) (← links)
- Partial order semantics for use case and task models (Q539426) (← links)
- Contexts, refinement and determinism (Q541213) (← links)
- Derivation tree analysis for accelerated fixed-point computation (Q549189) (← links)
- Fixing Zeno gaps (Q549197) (← links)
- The free process algebra generated by \(\delta \), \(\epsilon\) and \(\tau \) (Q549205) (← links)
- A randomized encoding of the \(\pi\)-calculus with mixed choice (Q555750) (← links)
- Bisimulation on speed: Worst-case efficiency (Q598200) (← links)
- A pure labeled transition semantics for the applied pi calculus (Q621583) (← links)
- Confluence for process verification (Q672042) (← links)
- A complete axiomatization of timed bisimulation for a class of timed regular behaviours (Q672231) (← links)
- Structural operational semantics for weak bisimulations (Q673123) (← links)
- A theory of processes with durational actions (Q674005) (← links)
- A process algebraic view of input/output automata (Q674195) (← links)
- Category theory for operational semantics (Q703525) (← links)
- On the computational complexity of bisimulation, redux (Q703845) (← links)