Defining conditional independence using collapses

DOI10.1016/0304-3975(92)90054-JzbMATH Open0769.68082MaRDI QIDQ1194331FDOQ1194331

Doron Peled, Shmuel Katz

Publication date: 27 September 1992

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

zbMATH Keywords

conditional independencesemanticscollapsestotal correctness

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (17)

• Relational structures model of concurrency
• Applicability of fair simulation
• Trace consistency and inevitability
• Partial-Order Reduction
• Actor-based model checking for software-defined networks
• Composing model programs for analysis
• Representation of computations in concurrent automata by dependence orders
• A comparison of confluence and ample sets in probabilistic and non-probabilistic branching time
• RECOGNIZABLE AND LOGICALLY DEFINABLE LANGUAGES OF INFINITE COMPUTATIONS IN CONCURRENT AUTOMATA
• Collapsibility of Distribution Dependence
• Combining partial-order reductions with on-the-fly model-checking.
• Proving partial order properties
• Partial order reduction for rewriting semantics of programming languages
• Full simulation coverage for SystemC transaction-level models of systems-on-a-chip
• Modular synthesis of timed circuits using partial orders on LPNs
• Serializable histories in quantified propositional temporal logic
• Recognizable languages in concurrency monoids

   Recommendations

• Semantic independence 👍 👎
• A generalized notion of semantic independence 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Modelling concurrency with comtraces and generalized comtraces 👍 👎

This page was built for publication: Defining conditional independence using collapses

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1194331)