Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 3 of 3 for “"Deadlock analysis"”.

  1. Analysis of Parameterized-Chain Networks: The Dependency Graph and Its Full, Consistent Subgraphs

    This thesis studies algorithmic aspects of deadlock analysis for parameterized networks of discrete-event systems. A parameterized network consists of a finite, but arbitrarily large, number of interacting finite-state subsystems, each within one of a fixed, finite number of isomorphism classes. …

    waterloo Repository record for Analysis of Parameterized-Chain Networks: The Dependency Graph and Its Full, Consistent Subgraphs (opens in a new tab)

  2. Lock correctness

    … the locks. This amounts to avoiding data races, deadlocks, and other errors in using the locking primitives, such as unlocking a lock that is not currently held.</p> <p>On the transformation level, the compiler needs to correctly optimise the program and correctly map its operations to machine …

    oxford Repository record for Lock correctness (opens in a new tab)

  3. Weak invariant simulation and analysis of parameterized networks

    … of these networks, such as nonblocking and deadlock-freedom, are undecidable. Moreover, mathematical tools supporting analysis of these networks are limited. This thesis introduces a novel mathematical notion, weak invariant simulation and proposes an efficient method to check whether a …

    waterloo Repository record for Weak invariant simulation and analysis of parameterized networks (opens in a new tab)