Hybrid Systems: Computation and Control

DOI10.1007/b96398zbMath1135.93352OpenAlexW2476491145MaRDI QIDQ5307469

Patricia Bouyer, Ed Brinksma, Kim Guldstrand Larsen

Publication date: 25 September 2007

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/b96398

zbMATH Keywords

infinite schedules for timed automataoptimal mean-cycles in finite graph corner-point abstraction

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Control/observation systems involving computers (process control, etc.) (93C83)

Related Items

Expected reachability-time games ⋮ Model Checking Real-Time Systems ⋮ On the optimal reachability problem of weighted timed automata ⋮ Optimal strategy synthesis for request-response games ⋮ Synthesis of memory-efficient, clock-memory free, and non-Zeno safety controllers for timed systems ⋮ Model-Based Verification, Optimization, Synthesis and Performance Evaluation of Real-Time Systems ⋮ Weighted o-minimal hybrid systems ⋮ Dwell time and average dwell time methods based on the cycle ratio of the switching graph ⋮ Comparing the Expressiveness of Timed Automata and Timed Extensions of Petri Nets ⋮ Infinite Runs in Weighted Timed Automata with Energy Constraints ⋮ Multi-weighted automata and MSO logic ⋮ Optimal infinite scheduling for multi-priced timed automata ⋮ Discount-Optimal Infinite Runs in Priced Timed Automata ⋮ Quantitative analysis of weighted transition systems ⋮ Optimal run problem for weighted register automata ⋮ Model Checking Logic WCTL with Multi Constrained Modalities on One Clock Priced Timed Automata