Safraless Procedures for Timed Specifications

13 years 2 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

» Changes in Cerebellomotor Connectivity during Procedural Learning by Actual Execution and ...

» Specification and Analysis of RealTime Systems Using RealTime Maude

» A TaskSpecific Ontology for the Application and Critiquing of TimeOriented Clinical Guidel...

» Controller Implementation by Communicating Asynchronous Sequential Circuits Generated from...

» A Symbolic Model Checker for Testing ASTRAL RealTime Specifications

» A Survey of Ontology Learning Procedures

» Critical assessment of alignment procedures for LCMS proteomics and metabolomics measureme...

» Procedures and tools for analysis of network traffic measurements

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)

Sciweavers

Safraless Procedures for Timed Specifications

Algorithms | Formal Methods | FORMATS 2010 | Infinite Timed Words | Paper |

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers