Defining Conditional Independence Using Collapses

@article{Katz1992DefiningCI,
  title={Defining Conditional Independence Using Collapses},
  author={Shmuel Katz and Doron A. Peled},
  journal={Theor. Comput. Sci.},
  year={1992},
  volume={101},
  pages={337-359}
}
Certified normalization of generalized traces
TLDR
This work generalizes two classical normal forms and the corresponding normalization algorithms for Mazurkiewicz traces for Sassone et al.
Dependence Orders for Computations of Concurrent Automata
TLDR
Two graphtheoretic representations of the equivalence classes of computation sequences are investigated and obtained that under suitable assumptions on A they are isomorphic and the graphs are shown to carry a monoid operation reflecting precisely the composition of computations.
Verification of distributed programs using representative interleaving sequences
TLDR
A formal proof method for distributed programs that explicitly identifies equivalence classes of execution sequences which are equivalent up to permuting commutative operations using the temporal logic ISTL.
Specifying and proving serializability in temporal logic
TLDR
A formal verification system for serializability that uses classical logic reasoning is provided and Serializability for the multiversion-timestamp algorithm is verified.
Labelled Domains and Automata with Concurrency
Partial Order Reductions
  • D. Peled
  • Mathematics, Computer Science
  • 2000
Partial order reductions are a family of techniques for diminishing the statespace explosion problem for model-checking concurrent programs. They are based on the Observation that execution sequences
Model Checking Reductions to Convenient Computations
TLDR
A general framework is presented in which, given a model and additional information including a description of the convenient computations and of the operations’ independence, an augmented model using a transducer and temporal logic assertions for it are automatically defined and model checked, and every computation can be reduced to a convenient one.
Certified Foata Normalization for Generalized Traces
Mazurkiewicz traces are a well-known model of concurrency with a notion of equivalence for interleaving executions. Interleaving executions of a concurrent system are represented as strings over an
Mechanizing Proofs of Computation Equivalence (extended Abstract)
TLDR
A proof-theoretic mechanized veriication environment that allows taking advantage of the "convenient computations" method by separating two diierent concerns: proving that certain convenient computations satisfy the property, and proving that every computation is related to a convenient one by a relation which preserves the property.
...
...

References

SHOWING 1-10 OF 49 REFERENCES
Specifying and proving serializability in temporal logic
TLDR
A formal verification system for serializability that uses classical logic reasoning is provided and Serializability for the multiversion-timestamp algorithm is verified.
Concurrency, Automata and Domains
  • M. Droste
  • Computer Science, Mathematics
    ICALP
  • 1990
TLDR
An operational model of concurrent systems, called concurrent automata, is introduced in which the event set is endowed with a collection of symmetric binary relations which describe when two events at a particular state of A commute; it is shown that these concurrency relations depend (in a natural way) locally on each other, but not globally.
An efficient verification method for parallel and distributed programs
TLDR
A formal proof method based on a partial order semantics for parallel or distributed programs which allows concluding the correctness of certain classes of properties for all execution sequences, even though the property is only demonstrated directly for a subset of the execution sequences.
Fairness for non-interleaving concurrency
TLDR
A topological characterization of behavioural properties which includes safety, progress and fairness properties has been provided in a non-interleaving semantic model for concurrency.
Modeling concurrency by partial orders and nonlinear transition systems
TLDR
The avoidance of deadlock by an implementation can be defined and proved, and formally what it means for an implementation to involve loss of parallelism shows in the form of extra order constraints that have to be added to core members of the original process.
Guarded commands, nondeterminacy and formal derivation of programs
So-called “guarded commands” are introduced as a building block for alternative and repetitive constructs that allow nondeterministic program components for which at least the activity evoked, but
Proving Assertions about Parallel Programs
How to cook a temporal proof system for your pet language
TLDR
An abstract temporal proof system is presented whose program-dependent part has a high-level interface with the programming language actually studied, and is shown to be relatively complete with respect to pure first-order temporal logic.
Semi-Commutation and Deterministic Petri Nets
TLDR
The present approach is a generalization of the well-known Mazurkiewicz's [7] trace model, where Behaviours of Petri nets are represented by sets of semitraces, mainly concerning determinism.
...
...