The following pages link to Proved trees (Q5204353):
Displaying 19 items.
- General patterns of interaction in stochastic fusion (Q272780) (← links)
- Locality and interleaving semantics in calculi for mobile processes (Q672123) (← links)
- Location equivalence in a parametric setting (Q672708) (← links)
- Non-interleaving semantics for mobile processes (Q1285660) (← links)
- Names of the \(\pi\)-calculus agents handled locally (Q1589648) (← links)
- Dynamic connectors for concurrency (Q1603689) (← links)
- A causal semantics for CCS via rewriting logic (Q1606128) (← links)
- Language-based performance prediction for distributed and mobile systems (Q1854534) (← links)
- Twenty years of rewriting logic (Q1931904) (← links)
- Gaining trust by tracing security protocols (Q2095430) (← links)
- Concurrencies in reversible concurrent calculi (Q2097423) (← links)
- Twenty Years on: Reflections on the CEDISYS Project. Combining True Concurrency with Process Algebra (Q3507401) (← links)
- From Gene Regulation to Stochastic Fusion (Q3543333) (← links)
- Extended transition systems for parametric bisimulation (Q4630292) (← links)
- Distribution and locality of concurrent systems (Q4632423) (← links)
- Causality for mobile processes (Q4645219) (← links)
- Read-write causality (Q5096915) (← links)
- (Q5141619) (← links)
- Distributed processes and location failures (Q5958774) (← links)
