English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools annual

Global: Zendy Free Plan

Global: Zendy Tools monthly

Global: Zendy Plus monthly

We define a pi-calculus variant with a costed semantics where channels aretreated as resources that must explicitly be allocated before they are used andcan be deallocated when no longer required. We use a substructural type systemtracking permission transfer to construct coinductive proof techniques forcomparing behaviour and resource usage efficiency of concurrent processes. Weestablish full abstraction results between our coinductive definitions and acontextual behavioural preorder describing a notion of process efficiencyw.r.t. its management of resources. We also justify these definitions andrespective proof techniques through numerous examples and a case studycomparing two concurrent implementations of an extensible buffer.

Compositional Reasoning for Explicit Resource Management in Channel-Based Concurrency