Interleaving set temporal logic
From MaRDI portal
Publication:2639046
DOI10.1016/0304-3975(90)90096-ZzbMath0718.03014MaRDI QIDQ2639046
Publication date: 1990
Published in: Theoretical Computer Science (Search for Journal in Brave)
interleaving semantics; partial order semantics; concurrency; nondeterminism; Interleaving Set Temporal Logic; reasoning about global states constructed from partial orders
68Q10: Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.)
03B45: Modal logic (including the logic of norms)
03B70: Logic in computer science
68Q60: Specification and verification (program logics, model checking, etc.)
Related Items
A stubborn attack on state explosion, Formal timing analysis of distributed systems, Defining conditional independence using collapses, Verification of distributed programs using representative interleaving sequences, On equivalence-completions of fairness assumptions, Detecting causal relationships in distributed computations: In search of the holy grail, A principle for sequential reasoning about distributed algorithms, On projective and separable properties, Deciding global partial-order properties