SIGN IN
SIGN UP
Durations and parametric model-checking in timed automata
Full Text:
Pdf
Buy this Article
Authors:
Véronique Bruyère
Université de Mons-Hainaut, Mons, Belgium
Emmanuel Dall'olio
Université Libre de Bruxelles, Bruxelles, Belgium
Jean-François Raskin
Université Libre de Bruxelles, Bruxelles, Belgium
Published in:
· Journal
ACM Transactions on Computational Logic (TOCL)
TOCL Homepage
archive
Volume 9 Issue 2, March 2008
Article No. 12
ACM
New York, NY
, USA
table of contents
doi>
10.1145/1342991.1342996
2008 Article
Research
Refereed
Bibliometrics
· Downloads (6 Weeks): 0
· Downloads (12 Months): 8
· Downloads (cumulative): 206
· Citation Count: 4
Tools and Resources
Buy this Article
Request Permissions
TOC Service:
Email
RSS
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Share:
|
Tags:
mathematical logic
model-checking
presburger arithmetic
software/program verification
specifying and verifying and reasoning about programs
theory
timed automata
verification
Feedback
|
Switch to
single page view
(no tabs)
**Javascript is not enabled and is required for the "tabbed view" or switch to the
single page view
**
Powered by
The ACM Guide to Computing Literature
All Tags
Export Formats
Save to Binder