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

Sanjit A. Seshia and Randal E. Bryant. Unbounded, Fully Symbolic Model Checking of Timed Automata using Boolean Methods. In Proc. 15th International Conference on Computer-Aided Verification (CAV), pp. 154–166, Lecture Notes in Computer Science 2725, July 2003.

Download

[pdf]  [ps] 

Abstract

(unavailable)

BibTeX

@InProceedings{seshia-cav03,
  author = 	 "Sanjit A. Seshia and Randal E. Bryant",
  title = 	 "Unbounded, Fully Symbolic Model Checking of Timed Automata using {B}oolean Methods",
  booktitle = 	 CAV03,
  OPTcrossref =  {},
  OPTkey = 	 {},
  pages = 	 "154--166",
  year = 	 "2003",
  OPTeditor = 	 {},
  volume = 	 "2725",
  OPTnumber = 	 {},
  series = 	 "Lecture Notes in Computer Science",
  OPTaddress = 	 {},
  month = 	 "July",
}

Generated by bib2html.pl (written by Patrick Riley ) on Thu Aug 26, 2010 14:53:28