A spatial logic for concurrency. I (Q1887152)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A spatial logic for concurrency. I |
scientific article; zbMATH DE number 2118417
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A spatial logic for concurrency. I |
scientific article; zbMATH DE number 2118417 |
Statements
A spatial logic for concurrency. I (English)
0 references
23 November 2004
0 references
A logic which can express properties of freshness, secrecy, structure and behavior of concurrent systems is presented. It contains spatial operations corresponding to composition, local name restriction and primitive fresh name quantifier. At the beginning short review of the asynchronous \(\pi\)-calculus is given. Later a detailed presentation of the syntax of the spatial logic, its semantics, and logical validity are studied. At the end, fresh and hidden name quantifications and the recursive definition properties are motivated and discussed.
0 references
spatial logic
0 references
concurrency
0 references
\(\pi\)-calculus
0 references
0.9048357605934144
0 references
0.8790839314460754
0 references
0.8457030057907104
0 references
