Defining conditional independence using collapses

DOI10.1016/0304-3975(92)90054-JzbMath0769.68082MaRDI QIDQ1194331

Shmuel Katz, Doron A. Peled

Publication date: 27 September 1992

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

zbMATH Keywords

semanticsconditional independencecollapsestotal correctness

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Semantics in the theory of computing (68Q55)

Related Items

Applicability of fair simulation, Partial-Order Reduction, A comparison of confluence and ample sets in probabilistic and non-probabilistic branching time, Relational structures model of concurrency, Recognizable languages in concurrency monoids, Serializable histories in quantified propositional temporal logic, Actor-based model checking for software-defined networks, Combining partial-order reductions with on-the-fly model-checking., Composing model programs for analysis, Representation of computations in concurrent automata by dependence orders, Modular Synthesis of Timed Circuits using Partial Orders on LPNs, Full simulation coverage for SystemC transaction-level models of systems-on-a-chip, RECOGNIZABLE AND LOGICALLY DEFINABLE LANGUAGES OF INFINITE COMPUTATIONS IN CONCURRENT AUTOMATA, Partial Order Reduction for Rewriting Semantics of Programming Languages, Proving partial order properties

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Adequate proof principles for invariance and liveness properties of concurrent programs
• Semantic independence
• Stepwise refinement of parallel algorithms
• Decomposition of distributed programs into communication-closed layers
• On interprocess communication. I: Basic formalism
• Appraising fairness in languages for distributed programming
• Proving assertions about parallel programs
• An axiomatic proof technique for parallel programs
• Interleaving set temporal logic
• Automatic translation of FORTRAN programs to vector form
• Guarded commands, nondeterminacy and formal derivation of programs
• Communicating sequential processes
• A Shared Memory Computer Display System