Author of the publication

copy delete add this publication to your clipboard
community post
history of this post
URL
DOI
BibTeX
EndNote
APA
Chicago
DIN 1505
Harvard
MSOffice XML

Timed Automata Can Always Be Made Implementable.

P. Bouyer, K. Larsen, N. Markey, O. Sankur, and C. Thrane. CONCUR, volume 6901 of Lecture Notes in Computer Science, page 76-91. Springer, (2011)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Nicolas Dumerat University of Stuttgart

Nicolas Möbs University of Stuttgart

Nicolas Kroneberg University of Stuttgart

Nicolas Huber University of Stuttgart

Nicolas Schneider University of Stuttgart

Other publications of authors with the same name

On the semantics of Strategy Logic.P. Bouyer, P. Gardy, and N. Markey. Inf. Process. Lett., 116 (2): 75-79 (2016)Nash equilibria in symmetric graph games with partial observation.P. Bouyer, N. Markey, and S. Vester. Inf. Comput., (2017)Optimal and Robust Controller Synthesis - Using Energy Timed Automata with Uncertainty.G. Bacci, P. Bouyer, U. Fahrenberg, K. Larsen, N. Markey, and P. Reynier. FM, volume 10951 of Lecture Notes in Computer Science, page 203-221. Springer, (2018)On Expressiveness and Complexity in Real-Time Model Checking.P. Bouyer, N. Markey, J. Ouaknine, and J. Worrell. ICALP (2), volume 5126 of Lecture Notes in Computer Science, page 124-135. Springer, (2008)Bounding Average-Energy Games.P. Bouyer, P. Hofman, N. Markey, M. Randour, and M. Zimmermann. FoSSaCS, volume 10203 of Lecture Notes in Computer Science, page 179-195. (2017)Quantitative Verification of Weighted Kripke Structures.P. Bouyer, P. Gardy, and N. Markey. ATVA, volume 8837 of Lecture Notes in Computer Science, page 64-80. Springer, (2014)Satisfiability of ATL with strategy contexts.F. Laroussinie, and N. Markey. GandALF, volume 119 of EPTCS, page 208-223. (2013)Symbolic Optimal Reachability in Weighted Timed Automata.P. Bouyer, M. Colange, and N. Markey. CAV (1), volume 9779 of Lecture Notes in Computer Science, page 513-530. Springer, (2016)Language Preservation Problems in Parametric Timed Automata.É. André, D. Lime, and N. Markey. CoRR, (2018)On the Expressiveness and Complexity of ATL.F. Laroussinie, N. Markey, and G. Oreiby. Logical Methods in Computer Science, (2008)