BRÁZDIL, Tomáš, Krishnendu CHATTERJEE, Antonín KUČERA and Petr NOVOTNÝ. Efficient Controller Synthesis for Consumption Games with Multiple Resource Types. In Computer Aided Verification - 24th International Conference, CAV 2012. Berlin: Springer, 2012, p. 23-38. ISBN 978-3-642-31423-0. Available from: https://dx.doi.org/10.1007/978-3-642-31424-7_8.
Other formats:   BibTeX LaTeX RIS
Basic information
Original name Efficient Controller Synthesis for Consumption Games with Multiple Resource Types
Authors BRÁZDIL, Tomáš (203 Czech Republic, belonging to the institution), Krishnendu CHATTERJEE (356 India), Antonín KUČERA (203 Czech Republic, guarantor, belonging to the institution) and Petr NOVOTNÝ (203 Czech Republic, belonging to the institution).
Edition Berlin, Computer Aided Verification - 24th International Conference, CAV 2012, p. 23-38, 16 pp. 2012.
Publisher Springer
Other information
Original language English
Type of outcome Proceedings paper
Field of Study 10201 Computer sciences, information science, bioinformatics
Country of publisher Germany
Confidentiality degree is not subject to a state or trade secret
Publication form printed version "print"
Impact factor Impact factor: 0.402 in 2005
RIV identification code RIV/00216224:14330/12:00057576
Organization unit Faculty of Informatics
ISBN 978-3-642-31423-0
ISSN 0302-9743
Doi http://dx.doi.org/10.1007/978-3-642-31424-7_8
Keywords in English graph games; resource dependent systems
Tags best1, formela-conference
Tags International impact, Reviewed
Changed by Changed by: RNDr. Pavel Šmerk, Ph.D., učo 3880. Changed: 23/4/2013 13:15.
Abstract
We introduce consumption games, a model for discrete interactive system with multiple resources that are consumed or reloaded independently. We consider several natural algorithmic problems about consumption games, and show that although these problems are computationally hard in general, they are efficiently solvable if the number of resource types is fixed.
Abstract (in Czech)
V článku představujeme formalismus konzumních her, který je možné využít k modelování diskrétních interaktivních systémů závislých na více typech zdrojů. Zabýváme se několika základními výpočetními problémy z oblasti konzumních her a ukazujeme, že ačkoliv jsou tyto problémy obecně výpočetně těžké, jsou efektivně řešitelné pro konzumní hry s fixním počtem zdrojů.
Links
GAP202/10/1469, research and development projectName: Formální metody pro analýzu a verifikaci komplexních systémů
Investor: Czech Science Foundation
MUNI/A/0914/2009, interní kód MUName: Rozsáhlé výpočetní systémy: modely, aplikace a verifikace (Acronym: SV-FI MAV)
Investor: Masaryk University, Category A
PrintDisplayed: 25/4/2024 00:51