


default search action
Cassting/SynCoP 2016: Eindhoven, The Netherlands
- Thomas Brihaye, Benoît Delahaye
, Loïg Jezequel
, Nicolas Markey, Jirí Srba:
Proceedings Cassting Workshop on Games for the Synthesis of Complex Systems and 3rd International Workshop on Synthesis of Complex Parameters, Cassting/SynCoP 2016, Eindhoven, The Netherlands, April 2-3, 2016. EPTCS 220, 2016 - Thomas Brihaye, Amit Kumar Dhar, Gilles Geeraerts, Axel Haddad, Benjamin Monmege
:
Efficient Energy Distribution in a Smart Grid using Multi-Player Games. 1-12 - Benedikt Brütsch, Wolfgang Thomas:
Playing Games in the Baire Space. 13-25 - Milka Hutagalung, Norbert Hundeshagen, Dietrich Kuske, Martin Lange, Étienne Lozes:
Two-Buffer Simulation Games. 27-38 - Sotiris Moschoyiannis, Nicholas Elia, Alexandra S. Penn
, David J. B. Lloyd, Christopher J. K. Knight:
A Web-based Tool for Identifying Strategic Intervention Points in Complex Systems. 39-52 - Camille Coti:
Parametric, Probabilistic, Timed Resource Discovery System. 53-62 - Louise Foshammer, Kim Guldstrand Larsen
, Anders Mariegaard:
Weighted Branching Simulation Distance for Parametric Weighted Kripke Structures. 63-75 - Bharath Siva Kumar Tati, Markus Siegle
:
Rate Reduction for State-labelled Markov Chains with Upper Time-bounded CSL Requirements. 77-89

manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.