Costs and rewards in priced timed automata

Costs and rewards in priced timed automata

Show other versions (1)

We consider Pareto analysis of reachable states of multi-priced timed automata (MPTA): timed automata equipped with multiple observers that keep track of costs (to be minimised) and rewards (to be maximised) along a computation. Each observer has a constant non-negative derivative which may depend o...

书目详细资料
Main Authors:	Fränzle, M, Shirmohammadi, M, Swaminathan, M, Worrell, J
格式:	Journal article
语言:	English
出版:	Schloss Dagstuhl 2018

相似书籍

Costs and rewards in priced timed automata
由: Fränzle, M, et al.
出版: (2020)

Revisiting reachability in timed automata
由: Quaas, K, et al.
出版: (2017)

Concavely−Priced Timed Automata
由: Jurdzinski, M, et al.
出版: (2008)

CONCAVELY−PRICED PROBABILISTIC TIMED AUTOMATA
由: Jurdzinski, M, et al.
出版: (2009)

Alternating Timed Automata over Bounded Time
由: Jenkins, M, et al.
出版: (2010)

Alternating Timed Automata over Bounded Time
由: Jenkins, M, et al.
出版: (2010)

On Nonlinear Prices in Timed Automata
由: Devendra Bhave, et al.
出版: (2016-12-01)

Undecidability of universality for timed automata with minimal resources
由: Adams, S, et al.
出版: (2007)

Undecidability of Universality for Timed Automata with Minimal Resources
由: Adams, S, et al.
出版: (2007)

Concavely−Priced Probabilistic Timed Automata
由: Kwiatkowska, G, et al.
出版: (2009)

On the relationship between reachability problems in timed and counter automata
由: Haase, C, et al.
出版: (2012)

On the Relationship between Reachability Problems in Timed and Counter Automata
由: Haase, C, et al.
出版: (2012)

Universality Analysis for One-Clock Timed Automata
由: Abdulla, P, et al.
出版: (2008)

On reachability for hybrid automata over bounded time
由: Brihaye, T, et al.
出版: (2011)

Polynomial automata: zeroness and applications
由: Benedikt, M, et al.
出版: (2017)

Synchronizing Data Words for Register Automata
由: Shirmohammadi, M, et al.
出版: (2016)

Branching-time model checking of parametric one-counter automata
由: Göller, S, et al.
出版: (2012)

Branching−Time Model Checking of Parametric One−Counter Automata
由: Göller, S, et al.
出版: (2012)

Decidability and complexity results for timed automata via channel machines
由: Abdulla, P, et al.
出版: (2005)

Zone-based universality analysis for single-clock timed automata
由: Abdulla, P, et al.
出版: (2007)

Revisiting the Equivalence Problem for Finite Multitape Automata
由: Worrell, J
出版: (2013)

Model Checking One-clock Priced Timed Automata
由: Patricia Bouyer, et al.
出版: (2008-06-01)

Minimisation of multiplicity tree automata
由: Worrell, J, et al.
出版: (2017)

Symbolic verification and strategy synthesis for linearly-priced probabilistic timed automata
由: Kwiatkowska, M, et al.
出版: (2017)

Probabilistic automata of bounded ambiguity
由: Fijalkow, N, et al.
出版: (2017)

Bayesian Hybrid Automata: A Formal Model of Justified Belief in Interacting Hybrid Systems Subject to Imprecise Observation
由: Kröger, Paul, et al.
出版: (2022-12-01)

UPPAAL-SMC: Statistical Model Checking for Priced Timed Automata
由: Peter Bulychev, et al.
出版: (2012-07-01)

Complexity of equivalence and learning for multiplicity tree automata
由: Marusic, I, et al.
出版: (2015)

Minimisation of Multiplicity Tree Automata
由: Stefan Kiefer, et al.
出版: (2017-03-01)

Language equivalence for probabilistic automata
由: Kiefer, S, et al.
出版: (2011)

Markov chains and unambiguous automata
由: Baier, C, et al.
出版: (2023)

Algebraic invariants for linear hybrid automata
由: Majumdar, R, et al.
出版: (2020)

When is containment decidable for probabilistic automata?
由: Daviaud, L, et al.
出版: (2018)

Reachability in Succinct and Parametric One−Counter Automata
由: Haase, C, et al.
出版: (2009)

Reachability in Succinct and Parametric One-Counter Automata
由: Haase, C, et al.
出版: (2009)

The Complexity of Computing a Bisimilarity Pseudometric on Probabilistic Automata
由: van Breugel, F, et al.
出版: (2014)

On the Complexity of the Equivalence Problem for Probabilistic Automata
由: Kiefer, S, et al.
出版: (2012)

Markov chains and unambiguous Büchi automata
由: Baier, C, et al.
出版: (2016)

Markov Chains and Unambiguous Büchi Automata
由: Kiefer, S, et al.
出版: (2016)

When are emptiness and containment decidable for probabilistic automata?
由: Daviaud, L, et al.
出版: (2021)