Sciweavers

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

11

FTRTFT
1998
Springer

favoriteEmaildiscussreport

105views Formal Methods» more FTRTFT 1998»

An Algorithm for the Approximative Analysis of Rectangular Automata

13 years 8 months ago

An Algorithm for the Approximative Analysis of Rectangular Automata

Download www.cs.berkeley.edu

Jörg Preußig, Stefan Kowalewski, Howard

Real-time Traffic

Formal Methods | FTRTFT 1998 |

claim paper

Related Content

» Approximating corridors and tours via restriction and relaxation techniques

» A New Class of Decidable Hybrid Systems

» Model Checking LTL over Controllable Linear Systems Is Decidable

» Reasoning about online algorithms with weighted automata

» Analysis of approximate nearest neighbor searching with clustered point sets

» OnLine DensityBased Appearance Modeling for Object Tracking

» A generic approach to the static analysis of concurrent programs with procedures

» QuasiBirthDeath Processes TreeLike QBDs Probabilistic 1Counter Automata and Pushdown Syste...

» Algorithmic Algebraic Model Checking IV Characterization of Metabolic Networks

Post Info
More Details (n/a)

Added	05 Aug 2010
Updated	05 Aug 2010
Type	Conference
Year	1998
Where	FTRTFT
Authors	Jörg Preußig, Stefan Kowalewski, Howard Wong-Toi, Thomas A. Henzinger

Comments (0)