Amanote Research

Amanote Research

    RegisterSign In

Optimal Strategies in Priced Timed Game Automata

Lecture Notes in Computer Science - Germany
doi 10.1007/978-3-540-30538-5_13
Full Text
Open PDF
Abstract

Available in full text

Categories
Computer ScienceTheoretical Computer Science
Date

January 1, 2004

Authors
Patricia BouyerFranck CassezEmmanuel FleuryKim G. Larsen
Publisher

Springer Berlin Heidelberg


Related search

Quantitative Analysis of Real-Time Systems Using Priced Timed Automata

Communications of the ACM
Computer Science
2011English

Robust Reachability in Timed Automata: A Game-Based Approach

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2012English

Statistical Approximation of Optimal Schedulers for Probabilistic Timed Automata

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2016English

Robustness in Timed Automata

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2013English

Fuzzy-Timed Automata

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2010English

Discrete Timed Automata

English

Frequencies in Forgetful Timed Automata

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2012English

Timed Unfoldings for Networks of Timed Automata

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2006English

Robust Safety of Timed Automata

Formal Methods in System Design
HardwareTheoretical Computer ScienceArchitectureSoftware
2008English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2025 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy