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 Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

This work presents three increasingly expressive Dynamic Logics in which theprograms are CCS processes (sCCS-PDL, CCS-PDL and XCCS-PDL). Their goal is toreason about properties of concurrent programs and systems described using CCS.In order to accomplish that, CCS's operators and constructions are added to abasic modal logic in order to create dynamic logics that are suitable for thedescription and verification of properties of communicating, concurrent andnon-deterministic programs and systems, in a similar way as PDL is used for thesequential case. We provide complete axiomatizations for the three logics.Unlike Peleg's Concurrent PDL with Channels, our logics have a simple Kripkesemantics, complete axiomatizations and the finite model property.

CCS-Based Dynamic Logics for Communicating Concurrent Programs