Defining conditional independence using collapses

DOI10.1016/0304-3975(92)90054-JMaRDI QIDQ1194331zbMATH OpenFDO

Authors Shmuel Katz, Doron Peled

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)

Recommendations

• Semantic independence
• A generalized notion of semantic independence
• scientific article; zbMATH DE number 3846840
• scientific article; zbMATH DE number 3876565
• Modelling concurrency with comtraces and generalized comtraces

Cites work

• scientific article; zbMATH DE number 4213467 (Why is no real title available?)
• scientific article; zbMATH DE number 3976314 (Why is no real title available?)
• scientific article; zbMATH DE number 3982506 (Why is no real title available?)
• scientific article; zbMATH DE number 4030996 (Why is no real title available?)
• scientific article; zbMATH DE number 4085006 (Why is no real title available?)
• scientific article; zbMATH DE number 177814 (Why is no real title available?)
• scientific article; zbMATH DE number 177840 (Why is no real title available?)
• scientific article; zbMATH DE number 4119602 (Why is no real title available?)
• scientific article; zbMATH DE number 4119606 (Why is no real title available?)
• scientific article; zbMATH DE number 3278860 (Why is no real title available?)
• A Shared Memory Computer Display System
• Adequate proof principles for invariance and liveness properties of concurrent programs
• An axiomatic proof technique for parallel programs
• Appraising fairness in languages for distributed programming
• Automatic translation of FORTRAN programs to vector form
• Communicating sequential processes
• Decomposition of distributed programs into communication-closed layers
• Guarded commands, nondeterminacy and formal derivation of programs
• Interleaving set temporal logic
• On interprocess communication. I: Basic formalism
• Proving assertions about parallel programs
• Semantic independence
• Stepwise refinement of parallel algorithms

Cited in

(17)

• Serializable histories in quantified propositional temporal logic
• 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
• Combining partial-order reductions with on-the-fly model-checking.
• Collapsibility of Distribution Dependence
• 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
• Recognizable and logically definable languages of infinite computations in concurrent automata
• Modular synthesis of timed circuits using partial orders on LPNs
• Recognizable languages in concurrency monoids

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)