Weighted O-Minimal Hybrid Systems Are More Decidable Than Weighted Timed Automata!

Bouyer, Patricia; Brihaye, Thomas; Chevalier, Fabrice

No full text

Article (Scientific journals)

Weighted O-Minimal Hybrid Systems Are More Decidable Than Weighted Timed Automata!

Bouyer, Patricia; Brihaye, Thomas; Chevalier, Fabrice

2007 • In Lecture Notes in Computer Science

Peer reviewed

Permalink
https://hdl.handle.net/20.500.12907/15799

Files (0)Send to Details Statistics Bibliography Similar publications

Files

Full Text

No document available.

Send to

RIS BibTex APA Chicago Permalink X Linkedin

Details

Research center :

CREMMI - Modélisation mathématique et informatique

Disciplines :

Electrical & electronics engineering

Author, co-author :

Bouyer, Patricia

Brihaye, Thomas ; Université de Mons > Faculté des Sciences > Logique mathématique

Chevalier, Fabrice

Language :

English

Title :

Weighted O-Minimal Hybrid Systems Are More Decidable Than Weighted Timed Automata!

Publication date :

01 June 2007

Journal title :

Lecture Notes in Computer Science

ISSN :

0302-9743

eISSN :

1611-3349

Publisher :

Springer, Heidelberg, Germany

Peer reviewed :

Peer reviewed

Research unit :

S820 - Mathématiques effectives

Research institute :

R150 - Institut de Recherche sur les Systèmes Complexes

Available on ORBi UMONS :

since 08 July 2014

Statistics

Number of views

0 (0 by UMONS)

Number of downloads

0 (0 by UMONS)

More statistics