Defining conditional independence using collapses

Theoretical Computer Science

Volumn 101, Issue 2, 1992, Pages 337-359

  Katz, Shmuel ^a   Peled, Doron ^b  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

^b UNIVERSITY OF WARWICK   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY;

CONDITIONAL COMMUTIVITY; CONDITIONAL INDEPENDENCE; CONDITIONAL TRACES; SEMANTICS; TRACE SEMANTICS;

PROGRAMMING THEORY;

EID: 0026886169     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/0304-3975(92)90054-J     Document Type: Article

References (37)

1. Automatic translation of FORTRAN programs to vector form
2. Appraising fairness in languages for distributed programming
3. Proving assertions about parallel programs
4. Refining atomicity in parallel algorithms
5. Stepwise refinement of action systems
6. Analysis of programs for parallel processing
7. Semantic independence
8. Cooperating sequential processes
9. Guarded commands, nondeterminancy and formal derivation of programs
10. Concurrency, automata and domains
11. Decomposition of distributed programs into communication-closed layers
12. Modeling concurrency by partial orders and nonlinear transition systems
13. On proving communication closedness of distributed layers
14. Communicating sequential processes
15. Towards a theory of simulations for verification of concurrent systems
16. Interleaving set temporal logic
17. An efficient verification method for parallel and distributed programs
18. Verification of distributed programs using representative interleaving sequences
19. Fairness for noninterleaving concurrency
20. On interprocess communication, part I: basic formalism
21. Pretending atomicity
22. How to cook a temporal proof system for your pet language
23. Adequate proof principles for invariance and liveness properties of concurrent programs
24. Trace theory
25. Complete processes and inevitability
26. Semi-commutation and deterministic Petri nets
27. An axiomatic proof technique for parallel programs
28. Specifying and proving serializability in temporal logic
29. Proving partial order liveness properties
30. Applications of temporal logic to the specification and verification of reactive systems, a survey of current trends
31. The temporal logic of programs
32. Temporal logic and causality in concurrent systems
33. Stubborn sets for reduced state space generation