Interleaving set temporal logic

DOI10.1016/0304-3975(90)90096-ZzbMath0718.03014OpenAlexW1980003032MaRDI QIDQ2639046

Shmuel Katz, Doron A. Peled

Publication date: 1990

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(90)90096-z

zbMATH Keywords

interleaving semanticspartial order semanticsconcurrencynondeterminismInterleaving Set Temporal Logicreasoning about global states constructed from partial orders

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Modal logic (including the logic of norms) (03B45) Logic in computer science (03B70) Specification and verification (program logics, model checking, etc.) (68Q60)

Related Items

Detecting causal relationships in distributed computations: In search of the holy grail, A principle for sequential reasoning about distributed algorithms, Automata Theory and Model Checking, Fairness and the axioms of control predicates, Appraising fairness in languages for distributed programming, An application of temporal projection to interleaving concurrency, On projective and separable properties, Formal timing analysis of distributed systems, Defining conditional independence using collapses, A stubborn attack on state explosion, Verification of distributed programs using representative interleaving sequences, On equivalence-completions of fairness assumptions, Deciding global partial-order properties

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The temporal logic of branching time
• Adequate proof principles for invariance and liveness properties of concurrent programs
• A partial ordering semantics for CCS
• Decomposition of distributed programs into communication-closed layers
• On interprocess communication. I: Basic formalism
• Modeling concurrency with partial orders
• Appraising fairness in languages for distributed programming
• A calculus of communicating systems
• Repeated snapshots in distributed systems with synchronous communications and their implementation in CSP
• A formal model of atomicity in asynchronous systems
• Alternative semantics for temporal logics
• Decision procedures and expressiveness in the temporal logic of branching time
• Reasoning with time and chance
• “Sometimes” and “not never” revisited
• A Proof System for Communicating Sequential Processes
• Time, clocks, and the ordering of events in a distributed system
• Communicating sequential processes