Robust Reachability in Timed Automata: A Game-Based Approach

Lecture Notes in Computer Science - Germany
doi 10.1007/978-3-642-31585-5_15
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Berlin Heidelberg

Related search

Robust Safety of Timed Automata

Formal Methods in System Design
HardwareTheoretical Computer ScienceArchitectureSoftware
2008English

Optimal Strategies in Priced Timed Game Automata

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2004English

Robust Analysis of Timed Automata via Channel Machines

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2008English

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

Algorithmic Approach to Abstracting Linear Systems by Timed Automata*

IFAC Proceedings Volumes
2011English

Timed Unfoldings for Networks of Timed Automata

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2006English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy