Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

95

Voted

IEICET
2010

142views more IEICET 2010»

An Abstraction Refinement Technique for Timed Automata Based on Counterexample-Guided Abstraction Refinement Loop

15 years 1 months ago

An Abstraction Refinement Technique for Timed Automata Based on Counterexample-Guided Abstraction Refinement Loop

Download www-infosec.ist.osaka-u.ac.jp

Takeshi Nagaoka, Kozo Okano, Shinji Kusumoto

Real-time Traffic

IEICET 2010 |

claim paper

Related Content

» Counterexample Guided Path Reduction for Static Program Analysis

» Synchronization Verification in SystemLevel Design with ILP Solvers

» Abstractions from proofs

» Efficient Craig Interpolation for Linear Diophantine DisEquations and Linear Modular Equat...

» Combining Symbolic Representations for Solving Timed Games

» Safety Verification of an Aircraft Landing Protocol A Refinement Approach

» Approximating Continuous Systems by Timed Automata

» A Decision Procedure for Detecting Atomicity Violations for Communicating Processes with L...

» Computing OverApproximations with Bounded Model Checking

Post Info
More Details (n/a)

Added	26 Jan 2011
Updated	26 Jan 2011
Type	Journal
Year	2010
Where	IEICET
Authors	Takeshi Nagaoka, Kozo Okano, Shinji Kusumoto

Comments (0)