Model-Checking One-Clock Priced Timed Automata

DOI10.1007/978-3-540-71389-0_9MaRDI QIDQ5758051zbMATH OpenOpenAlexFDO

Authors Patricia Bouyer, Nicolas Markey, Kim G. Larsen

Publication date 7 September 2007

Published in Foundations of Software Science and Computational Structures (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-71389-0_9

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• Model Checking One-clock Priced Timed Automata
• Model checking logic WCTL with multi constrained modalities on one clock priced timed automata
• CONCUR 2004 - Concurrency Theory
• Costs Are Expensive!
• Model checking weighted integer reset timed automata

Cited in

(14)

• Costs Are Expensive!
• Model Checking One-clock Priced Timed Automata
• Infinite Runs in Weighted Timed Automata with Energy Constraints
• One-Clock Deterministic Timed Automata Are Efficiently Identifiable in the Limit
• Model checking logic WCTL with multi constrained modalities on one clock priced timed automata
• A survey of timed automata for the development of real-time systems
• Model Checking Metric Temporal Logic over Automata with One Counter
• Model-checking timed temporal logics
• On parametric timed automata and one-counter machines
• CONCUR 2004 - Concurrency Theory
• Model checking weighted integer reset timed automata
• A Kleene-Schützenberger Theorem for Weighted Timed Automata
• A Kleene-Schützenberger theorem for weighted timed automata
• Weighted o-minimal hybrid systems

This page was built for publication: Model-Checking One-Clock Priced Timed Automata

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5758051)