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 5 of 5 for “"Buchi automata"”.

  1. Buchi containment and size-change termination

    … compare tools for complementing nondeterministic Buchi automata with a recent termination-analysis algorithm. Complementation of Buchi automata is a well-explored problem in program verification. Early solutions using a Ramsey-based combinatorial argument have been supplanted by rank-based …

    rice Repository record for Buchi containment and size-change termination (opens in a new tab)

  2. An automata-based automatic verification environment

    … of the algorithm for translating LTL into Buchi automata. The original translation algorithm is presented in Gerth et al and is the basis of model checkers such as SPIN. We also provide a formal proof of the termination and correctness of this algorithm. All definitions and proofs have been …

    njit Repository record for An automata-based automatic verification environment (opens in a new tab)

  3. Improved Symbolic Model Checking of Real-Time Systems

    … and have been applied to encode closed timed automata and Stateful Timed CSP modeling languages. With regard to model checking algorithms, interesting problems are reachability analysis and emptiness checking. In the second part of the thesis, we aim to improve the current state-of-the-art …

    nus Repository record for Improved Symbolic Model Checking of Real-Time Systems (opens in a new tab)

  4. Using Live Sequence Chart Specifications for Formal Verification

    <p>Formal methods play an important part in the development as well as testing stages of software and hardware systems. A significant and often overlooked part of the process is the development of specifications and correctness requirements for the system under test. Traditionally, English has been …

    byu Repository record for Using Live Sequence Chart Specifications for Formal Verification (opens in a new tab)

  5. Definability and decidability for expansions of arithmetic by sets definable from positional numeration systems

    Submission original under an indefinite embargo labeled 'Open Access'. The submission was exported from vireo on 2023-12-04 without embargo terms

    uiuc Repository record for Definability and decidability for expansions of arithmetic by sets definable from positional numeration systems (opens in a new tab)