Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
Sci2ools
International Keyboard
Graphical Social Symbols
CSS3 Style Generator
OCR
Web Page to Image
Web Page to PDF
Merge PDF
Split PDF
Latex Equation Editor
Extract Images from PDF
Convert JPEG to PS
Convert Latex to Word
Convert Word to PDF
Image Converter
PDF Converter
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools
25
click to vote
FORMATS
2010
Springer
favorite
Email
discuss
report
96
views
Formal Methods
»
more
FORMATS 2010
»
Safraless Procedures for Timed Specifications
13 years 9 months ago
Download
www.ulb.ac.be
This paper presents extensions of Safraless algorithms proposed in the literature for automata on infinite untimed words to the case of automata on infinite timed words.
Barbara Di Giampaolo, Gilles Geeraerts, Jean-Fran&
Real-time Traffic
Algorithms
|
Formal Methods
|
FORMATS 2010
|
Infinite Timed Words
|
Paper
|
claim paper
Post Info
More Details (n/a)
Added
11 Feb 2011
Updated
11 Feb 2011
Type
Journal
Year
2010
Where
FORMATS
Authors
Barbara Di Giampaolo, Gilles Geeraerts, Jean-François Raskin, Nathalie Sznajder
Comments
(0)
Researcher Info
Formal Methods Study Group
Computer Vision