Statistical Approximation of Optimal Schedulers for Probabilistic Timed Automata

Lecture Notes in Computer Science - Germany
doi 10.1007/978-3-319-33693-0_7
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer International Publishing

Related search

Model Checking for Probabilistic Timed Automata

Formal Methods in System Design
HardwareTheoretical Computer ScienceArchitectureSoftware
2012English

Optimal Strategies in Priced Timed Game Automata

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2004English

Timed Unfoldings for Networks of Timed Automata

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2006English

Fuzzy-Timed Automata

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2010English

Pumping Lemmas for Timed Automata

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1998English

Discrete Timed Automata

English

State Identification Problems for Timed Automata

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2005English

Robustness in Timed Automata

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2013English

Robust Safety of Timed Automata

Formal Methods in System Design
HardwareTheoretical Computer ScienceArchitectureSoftware
2008English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy