The following pages link to CONCUR 2005 – Concurrency Theory (Q5897472):
Displaying 9 items.
- Interaction graphs: graphings (Q345705) (← links)
- Nets, sequential components and concurrency relations (Q797994) (← links)
- An exact correspondence between a typed pi-calculus and polarised proof-nets (Q974114) (← links)
- Interpreting a finitary pi-calculus in differential interaction nets (Q979075) (← links)
- Reducibility between classes of port graph grammar. (Q1872703) (← links)
- Hard combinators (Q2870311) (← links)
- (Q4216507) (← links)
- The true concurrency of differential interaction nets (Q4577982) (← links)
- Coupling asynchrony and interrupts: Place Chart Nets (Q6487382) (← links)