Pages that link to "Item:Q2870198"
From MaRDI portal
The following pages link to Expressiveness of Process Algebras (Q2870198):
Displaying 25 items.
- Reactive Turing machines (Q393091) (← links)
- A taxonomy of process calculi for distribution and mobility (Q660996) (← links)
- Comparing communication primitives via their relative expressive power (Q1004386) (← links)
- Towards a unified approach to encodability and separation results for process calculi (Q1959439) (← links)
- The \(C_\pi\)-calculus: a model for confidential name passing (Q1996859) (← links)
- On primitives for compensation handling as adaptable processes (Q2043807) (← links)
- Session-based concurrency, declaratively (Q2120811) (← links)
- Expressiveness of concurrent intensionality (Q2193283) (← links)
- Replacement freeness: a criterion for separating process calculi (Q2210864) (← links)
- On the relative expressiveness of higher-order session processes (Q2272988) (← links)
- CCS: it's not fair! Fair schedulers cannot be implemented in CCS-like languages even under progress and certain fairness assumptions (Q2340255) (← links)
- Comparing type systems for deadlock freedom (Q2667185) (← links)
- On the Relative Expressiveness of Higher-Order Session Processes (Q2802492) (← links)
- Breaking symmetries (Q2971075) (← links)
- Synchrony versus causality in distributed systems (Q2971080) (← links)
- On the Expressiveness of Symmetric Communication (Q3179397) (← links)
- (Q3385647) (← links)
- Towards a Unified Approach to Encodability and Separation Results for Process Calculi (Q3541040) (← links)
- The true concurrency of differential interaction nets (Q4577982) (← links)
- On parameterization of higher-order processes (Q4976336) (← links)
- (Q4989406) (← links)
- (Q5013871) (← links)
- (Q5111635) (← links)
- Full abstraction for expressiveness: history, myths and facts (Q5741573) (← links)
- Non-Deterministic Functions as Non-Deterministic Processes (Extended Version) (Q6076174) (← links)
