Zobrazeno 1 - 10
of 20
pro vyhledávání: '"Raffaella Gentilini"'
Publikováno v:
Logical Methods in Computer Science, Vol Volume 11, Issue 3 (2015)
A weighted automaton is functional if any two accepting runs on the same finite word have the same value. In this paper, we investigate functional weighted automata for four different measures: the sum, the mean, the discounted sum of weights along e
Externí odkaz:
https://doaj.org/article/c3477a836cd743e49042e9c569d5c10d
Publikováno v:
IEEE Transactions on Parallel and Distributed Systems. 32:2970-2982
Modeling the consumption of limited resources, e.g., time or energy, plays a central role on the design of reactive systems such as embedded controllers. To this aim, quantitative objectives are defined on game arenas that can be easily modeled as we
Publikováno v:
IA3@SC
Quantitative games, where quantitative objectives are defined on weighted game arenas, provide natural tools for designing faithful models of embedded controllers. Instances of these games that recently gained interest are the so called Energy Games.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::acba5d4eec7dbaed6a2b0a1ffda437a2
http://arxiv.org/abs/1710.03647
http://arxiv.org/abs/1710.03647
Autor:
Raffaella Gentilini
Publikováno v:
Information Processing Letters. 114:382-386
We consider the problem of designing approximation schemes for the values of mean-payoff games. It was recently shown that (1) mean-payoff with rational weights scaled on [-1,1] admit additive fully-polynomial approximation schemes, and (2) mean-payo
Publikováno v:
Journal of Automated Reasoning. 31:73-103
The notions of bisimulation and simulation are used for graph reduction and are widely employed in many areas: modal logic, concurrency theory, set theory, formal verification, and so forth. In particular, in the context of formal verification they a
Publikováno v:
Electronic Notes in Theoretical Computer Science. 67:166-183
In this paper we propose an efficient symbolic algorithm for the problem of determining the maximum bisimulation on a finite structure. The starting point is an algorithm, on explicit representation of graphs, which saves both time and space exploiti
Publikováno v:
[Technical Report] 2011, pp.27
Concurrency Theory (CONCUR)
Concurrency Theory (CONCUR), 2012, Unknown, Unknown Region. pp.132-146
Lecture Notes in Computer Science ISBN: 9783642329395
CONCUR
Logical methods in computer science, 11 (3
Lecture Notes in Computer Science
Concurrency Theory (CONCUR)
Concurrency Theory (CONCUR), 2012, Unknown, Unknown Region. pp.132-146
Lecture Notes in Computer Science ISBN: 9783642329395
CONCUR
Logical methods in computer science, 11 (3
Lecture Notes in Computer Science
A weighted automaton is functional if any two accepting runs on the same finite word have the same value. In this paper, we investigate functional weighted automata for four different measures: the sum, the mean, the discounted sum of weights along e
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::8ad95d615c52fc835465fef76a50de45
https://hal.inria.fr/inria-00626216
https://hal.inria.fr/inria-00626216
Publikováno v:
Computer Science Logic ISBN: 9783642152047
CSL
CSL
We consider two-player games with imperfect information and quantitative objective. The game is played on a weighted graph with a state space partitioned into classes of indistinguishable states, giving players partial knowledge of the state. In an e
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::62ee5dcb1bf4b9b6829a5dcbdcb699a6
https://doi.org/10.1007/978-3-642-15205-4_22
https://doi.org/10.1007/978-3-642-15205-4_22