Decompositional Reasoning about the History of Parallel Processes

Decompositional reasoning aims at automatically decomposing a global property of a composite system into local properties of (possibly unknown) components. In concurrency theory, decompositional reasoning techniques date back to the seminal work of Larsen and Liu in the late 1980s and early 1990s. However, we are not aware of any such decomposition technique that applies to reasoning about the "past". In this paper, we address this problem and present a decomposition technique for Hennessy-Milner logic with past and its extension with recursively defined formulae. As a language for processes, we use a subset of Milner's CCS with parallel composition, non-deterministic choice, action prefixing and the inaction constant. We focus on developing decompositional reasoning techniques for parallel contexts in that language.

Birgisson, ArnarSchool of Computer Science, Reykjavik University, Iceland & Department of Computer Science and Engineering, Chalmers University of Technology, Sweden (author)
Ingólfsdóttir, AnnaSchool of Computer Science, Reykjavik University, Iceland (author)
Mousavi, Mohammad Reza,1978-Department of Computer Science, TU/Eindhoven, Eindhoven, Netherlands(Swepub:hh)mohmou (author)
School of Computer Science, Reykjavik University, IcelandSchool of Computer Science, Reykjavik University, Iceland & Department of Computer Science and Engineering, Chalmers University of Technology, Sweden (creator_code:org_t)

By the author/editor: Aceto, Luca; Birgisson, Arnar; Ingólfsdóttir, A ...; Mousavi, Mohamma ...

About the subject

Kungliga biblioteket hanterar dina personuppgifter i enlighet med EU:s dataskyddsförordning (2018), GDPR. Läs mer om hur det funkar här.
Så här hanterar KB dina uppgifter vid användning av denna tjänst.