Carnegie Mellon University
Browse
- No file added yet -

Unbounded, Fully Symbolic Model Checking of Timed Automata using Boolean Methods

journal contribution
posted on 2003-01-01, 00:00 authored by Sanjit A. Seshia, Randal BryantRandal Bryant
Institute for Software Research

History

Publisher Statement

All Rights Reserved

Date

2003-01-01

Usage metrics

    Exports

    RefWorks
    BibTeX
    Ref. manager
    Endnote
    DataCite
    NLM
    DC