LOGIN TO YOUR ACCOUNT

Username
Password
Remember Me
Or use your Academic/Social account:

CREATE AN ACCOUNT

Or use your Academic/Social account:

Congratulations!

You have just completed your registration at OpenAire.

Before you can login to the site, you will need to activate your account. An e-mail will be sent to you with the proper instructions.

Important!

Please note that this site is currently undergoing Beta testing.
Any new content you create is not guaranteed to be present to the final version of the site upon release.

Thank you for your patience,
OpenAire Dev Team.

Close This Message

CREATE AN ACCOUNT

Name:
Username:
Password:
Verify Password:
E-mail:
Verify E-mail:
*All Fields Are Required.
Please Verify You Are Human:
fbtwitterlinkedinvimeoflicker grey 14rssslideshare1

CASSTING

Title
Collective Adaptive System SynThesIs with Non-zero-sum Games
Funding
EC | FP7 | SP1 | ICT
Call
FP7-ICT-2011-9
Contract (GA) number
601148
Start Date
2013/04/01
End Date
2016/04/30
Open Access mandate
no
Special Clause 39
no
Organizations
UMONS, ENORD, Seluxit, ULB, AAU, RWTH AACHEN, CNRS
More information
Detailed project information (CORDIS)

 

  • Simple Priced Timed Games are not That Simple

    Brihaye, Thomas; Geeraerts, Gilles; Haddad, Axel; Lefaucheux, Engel; Monmege, Benjamin (2015)
    Projects: EC | CASSTING (601148)
    International audience; Priced timed games are two-player zero-sum games played on priced timed automata (whose locations and transitions are labeled by weights modeling the costs of spending time in a state and executing an action, respectively). The goals of the players are to minimise and maximise the cost to reach a target location, respectively. We consider priced timed games with one clock and arbitrary (positive and negative) weights and show that, for an important subclass of theirs (...

    To Reach or not to Reach? Efficient Algorithms for Total-Payoff Games

    Brihaye , Thomas; Geeraerts , Gilles; Haddad , Axel; Monmege , Benjamin (2015)
    Projects: EC | CASSTING (601148)
    Quantitative games are two-player zero-sum games played on directed weighted graphs. Total-payoff games (that can be seen as a refinement of the well-studied mean-payoff games) are the variant where the payoff of a play is computed as the sum of the weights. Our aim is to describe the first pseudo-polynomial time algorithm for total-payoff games in the presence of arbitrary weights. It consists of a non-trivial application of the value iteration paradigm. Indeed, it requires to study, as a mi...

    Real-time Synthesis is Hard!

    Brihaye , Thomas; Estiévenart , Morgane; Geeraerts , Gilles; Ho , Hsi-Ming; Monmege , Benjamin; Sznajder , Nathalie (2016)
    Projects: EC | CASSTING (601148)
    International audience; We study the reactive synthesis problem (RS) for specifications given in Metric Interval Temporal Logic (MITL). RS is known to be undecidable in a very general setting, but on infinite words only; and only the very restrictive BResRS subcase is known to be decidable (see D'Souza et al. and Bouyer et al.). In this paper, we precise the decidabil-ity border of MITL synthesis. We show RS is undecidable on finite words too, and present a landscape of restrictions (both on ...

    Games with recurring certainty

    Berwanger, Dietmar; Mathew, Anup Basil (2014)
    Projects: EC | CASSTING (601148)
    Infinite games where several players seek to coordinate under imperfect information are known to be intractable, unless the information flow is severely restricted. Examples of undecidable cases typically feature a situation where players become uncertain about the current state of the game, and this uncertainty lasts forever. Here we consider games where the players attain certainty about the current state over and over again along any play. For finite-state games, we note that this kind of ...

    Interval Iteration Algorithm for MDPs and IMDPs

    Haddad , Serge; Monmege , Benjamin (2018)
    Projects: EC | CASSTING (601148)
    International audience; Markov Decision Processes (MDP) are a widely used model including both non-deterministic and probabilistic choices. Minimal and maximal probabilities to reach a target set of states, with respect to a policy resolving non-determinism, may be computed by several methods including value iteration. This algorithm, easy to implement and efficient in terms of space complexity, iteratively computes the probabilities of paths of increasing length. However, it raises three iss...

    Reachability in MDPs: Refining Convergence of Value Iteration

    Haddad , Serge; Monmege , Benjamin (2014)
    Projects: EC | CASSTING (601148)
    International audience; Markov Decision Processes (MDP) are a widely used model including both non-deterministic and probabilistic choices. Minimal and maximal probabilities to reach a target set of states, with respect to a policy resolving non-determinism, may be computed by several methods including value iteration. This algorithm, easy to implement and efficient in terms of space complexity, consists in iteratively finding the probabilities of paths of increasing length. However, it raise...

    Deciding the Value 1 Problem for Reachability in 1-Clock Decision Stochastic Timed Automata

    Bertrand , Nathalie; Brihaye , Thomas; Genest , Blaise (2014)
    Projects: EC | CASSTING (601148)
    International audience; We consider reachability objectives on an extension of stochastic timed automata (STA) with nondeterminism. Decision stochastic timed automata (DSTA) are Markov decision processes based on timed automata where delays are chosen randomly and choices between enabled edges are nondeterministic. Given a reachability objective, the value 1 problem asks whether a target can be reached with probability arbitrary close to 1. Simple examples show that the value can be 1 and yet...

    Synthesising Succinct Strategies in Safety Games

    Geeraerts, Gilles; Goossens, Joël; Stainer, Amélie (2014)
    Projects: EC | CASSTING (601148)
    Finite turn-based safety games have been used for very different problems such as the synthesis of linear temporal logic (LTL), the synthesis of schedulers for computer systems running on multiprocessor platforms, and also for the determinisation of timed automata. In these contexts, games are implicitly defined, and their size is at least exponential in the size of the input. Nevertheless, there are natural relations between states of arenas of such games. We first formalise the properties t...

    Efficient Energy Distribution in a Smart Grid using Multi-Player Games

    Brihaye , Thomas ,; Kumar Dhar , Amit ,; Geeraerts , Gilles; Haddad , Axel; Monmege , Benjamin (2016)
    Projects: EC | CASSTING (601148)
    International audience; Algorithms and models based on game theory have nowadays become prominent techniques for the design of digital controllers for critical systems. Indeed, such techniques enable automatic synthesis: given a model of the environment and a property that the controller must enforce, those techniques automatically produce a correct controller, when it exists. In the present paper, we consider a class of concurrent, weighted, multi-player games that are well-suited to model a...

    Quantitative Games under Failures

    Brihaye , Thomas; Geeraerts , Gilles; Haddad , Axel; Monmege , Benjamin; Pérez , Guillermo A.; Renault , Gabriel (2015)
    Projects: EC | CASSTING (601148)
    International audience; We study a generalisation of sabotage games, a model of dynamic network games introduced by van Benthem. The original definition of the game is inherently finite and therefore does not allow one to model infinite processes. We propose an extension of the sabotage games in which the first player (Runner) traverses an arena with dynamic weights determined by the second player (Saboteur). In our model of quantitative sabotage games, Saboteur is now given a budget that he ...
  • No project research data found
  • Scientific Results

    Chart is loading... It may take a bit of time. Please be patient and don't reload the page.

    PUBLICATIONS BY ACCESS MODE

    Chart is loading... It may take a bit of time. Please be patient and don't reload the page.

    Publications in Repositories

    Chart is loading... It may take a bit of time. Please be patient and don't reload the page.

Share - Bookmark

App Box