The following pages link to CONCUR 2005 – Concurrency Theory (Q5897489):
Displaying 9 items.
- Ready to preorder: an algebraic and general proof (Q843212) (← links)
- (Bi)simulations up-to characterise process semantics (Q1012122) (← links)
- Branching time and orthogonal bisimulation equivalence (Q1884905) (← links)
- Processes as formal power series: a coinductive approach to denotational semantics (Q2503337) (← links)
- On the unification of process semantics: equational semantics (Q2805160) (← links)
- Simulations up-to and canonical preorders (extended abstract) (Q2871827) (← links)
- A Linear-Time–Branching-Time Spectrum of Behavioral Specification Theories (Q2971124) (← links)
- New Bisimulation Semantics for Distributed Systems (Q3614847) (← links)
- Coinductive Characterisations Reveal Nice Relations Between Preorders and Equivalences (Q5415615) (← links)