Timed Parity Games: Complexity and Robustness

Logical Methods in Computer Science - Germany
doi 10.2168/lmcs-7(4:8)2011
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Logical Methods in Computer Science e.V.

Related search

The Descriptive Complexity of Parity Games

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
English

Robustness in Timed Automata

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2013English

Symbolic Quantitative Robustness Analysis of Timed Automata

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2015English

Mean-Payoff Parity Games

English

On Promptness in Parity Games*†

Fundamenta Informaticae
Information SystemsAlgebraNumber TheoryMathematicsComputational TheoryTheoretical Computer Science
2015English

Algorithms for Stochastic Parity Games

2005English

Parity Games of Bounded Tree- And Clique-Width

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2015English

Real-Time Control With Parametric Timed Reachability Games

IFAC Proceedings Volumes
2012English

Perfect-Information Stochastic Mean-Payoff Parity Games

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2014English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy