2013 | |
---|---|
[BMS13] | Patricia Bouyer, Nicolas Markey, and Ocan Sankur. Robust Weighted Timed Automata and Games. In FORMATS'13, Lecture Notes in Computer Science 8053, pages 31-46. Springer-Verlag, August 2013. |
[LM13] | François Laroussinie and Nicolas Markey. Satisfiability of ATL with strategy contexts. In GandALF'13, Electronic Proceedings in Theoretical Computer Science 119, pages 208-223. August 2013. |
[SBM+13] | Ocan Sankur, Patricia Bouyer, Nicolas Markey, and Pierre-Alain Reynier. Robust Controller Synthesis in Timed Automata. In CONCUR'13, Lecture Notes in Computer Science 8052, pages 546-560. Springer-Verlag, August 2013. |
[BMS13] | Patricia Bouyer, Nicolas Markey, and Ocan Sankur. Robustness in timed automata. In RP'13, Lecture Notes in Computer Science 8169, pages 1-18. Springer-Verlag, September 2013. |
[ABK13] | Shaull Almagor,
Udi Boker, and
Orna Kupferman.
Formalizing and Reasoning about Quality.
In ICALP'13,
Lecture Notes in Computer Science 7966, pages 15-27. Springer-Verlag, July 2013.
|
[BBF+13] | Aaron Bohy,
Véronique Bruyère,
Emmanuel Filiot, and
Jean-François Raskin.
Synthesis from LTL Specifications with Mean-Payoff
Objectives.
In TACAS'13,
Lecture Notes in Computer Science 7795, pages 169-184. Springer-Verlag, March 2013.
|
[BBL+13] | Giorgio Bacci, Giovanni Bacci, Kim Guldstrand Larsen, and Radu Mardare. Computing Behavioral Distances, Compositionally. In MFCS'13, Lecture Notes in Computer Science 8087, pages 74-85. Springer-Verlag, August 2013. |
[BBL+13] | Giorgio Bacci, Giovanni Bacci, Kim Guldstrand Larsen, and Radu Mardare. The BisimDist Library: Efficient Computation of Bisimilarity Distances for Markovian Models. In QEST'13, pages 278-281. IEEE Comp. Soc. Press, August 2013. |
[BG13] | Nils Bulling and Valentin Goranko. How to Be Both Rich and Happy: Combining Quantitative and Qualitative Strategic Reasoning about Multi-Player Games (Extended Abstract). In SR'13, Electronic Proceedings in Theoretical Computer Science 112, pages 33-41. March 2013. |
[BGH13] | Olivier Bournez, Daniel S. Graça, and Emmanuel Hainry. Computation with perturbed dynamical systems. Journal of Computer and System Sciences 79(5):714-724. Elsevier, August 2013. |
[BKK+13] | Udi Boker, Denis Kuperberg, Orna Kupferman, and Michal Skrzypczak. Nondeterminism in the Presence of a Diverse or Unknown Future. In ICALP'13, Lecture Notes in Computer Science 7966, pages 89-100. Springer-Verlag, July 2013. |
[BRS13] | Marcello Maria Bersani, Matteo Rossi, and Pierluigi San Pietro. Deciding the Satisfiability of MITL Specifications. In GandALF'13, Electronic Proceedings in Theoretical Computer Science 119, pages 64-78. August 2013. |
[Bru13] | Benedikt Brütsch. Synthesizing structured reactive programs via deterministic tree automata. In SR'13, Electronic Proceedings in Theoretical Computer Science 112, pages 107-113. March 2013. |
[CB13] | Franck Cassez and Jean-Luc Béchennec. Timing Analysis of Binary Programs with UPPAAL. In ACSD'13, pages 41-50. IEEE Comp. Soc. Press, July 2013. |
[CBC13] | Christophe Chareton, Julien Brunel, and David Chemouil. Towards an Updatable Strategy Logic. In SR'13, Electronic Proceedings in Theoretical Computer Science 112, pages 91-98. March 2013. |
[CBK+13] | Maximilien Colange, Souheib Baarir, Fabrice Kordon, and Yann Thierry-Mieg. Towards Distributed Software Model-Checking using Decision Diagrams. In CAV'13, Lecture Notes in Computer Science 8044, pages 830-845. Springer-Verlag, July 2013. |
[CDR+13] | Krishnendu Chatterjee,
Laurent Doyen,
Mickael Randour, and
Jean-François Raskin.
Looking at Mean-Payoff and Total-Payoff through
Windows.
In ATVA'13,
Lecture Notes in Computer Science 8172, pages 118-132. Springer-Verlag, October 2013.
|
[CHO+13] | Krishnendu Chatterjee,
Thomas A. Henzinger,
Jan Otop, and
Andreas Pavlogiannis.
Distributed synthesis for LTL fragments.
In FMCAD'13,
pages 18-25.
IEEE Comp. Soc. Press, October 2013.
|
[CHR13] | Pavol Černý, Thomas A. Henzinger, and Arjun Radhakrishna. Quantitative abstraction refinement. In POPL'13, pages 115-128. ACM Press, January 2013. |
[DDL+13] | Alexandre David, Dehui Du, Kim Guldstrand Larsen, Axel Legay, and Marius Mikučionis. Optimizing Control Strategy Using Statistical Model Checking. In NFM'13, Lecture Notes in Computer Science 7871, pages 352-367. Springer-Verlag, May 2013. |
[DJL+13] | Stéphane Demri, Marcin Jurdziński, Oded Lachish, and Ranko Lazić. The covering and boundedness problems for branching vector addition systems. Journal of Computer and System Sciences 79(1):23-38. Elsevier, February 2013. |
[DLL+13] | Alexandre David, Kim Guldstrand Larsen, Axel Legay, and Danny Bøgsted Poulsen. Statistical Model Checking of Dynamic Networks of Stochastic Hybrid Automata. In AVOCS'13, Electronic Communications of the EASST 10. European Association of Software Science and Technology, September 2013. |
[DLM+13] | Peter H. Dalsgaard,
Thibault Le Guilly,
Daniel Middelhede,
Petur Olsen,
Thomas Pedersen,
Anders P. Ravn, and
Arne Skou.
A Toolchain for Home Automation Controller
Development.
In SEAA'13,
pages 122-129.
September 2013.
|
[DV13] | Giuseppe De Giacomo and Moshe Y. Vardi. Linear Temporal Logic and Linear Dynamic Logic on Finite Traces. In IJCAI'13, pages 854-860. IJCAI organization, August 2013. |
[EF13] | Daniel Ejsing-Dunn and Lisa Fontani. Infinite Runs in Recharge Automata. Master's thesis, Computer Science Department, Aalborg University, Denmark, June 2013. |
[EGM13] | Javier Esparza, Pierre Ganty, and Rupak Majumdar. Parameterized verification of asynchronous shared-memory systems. In CAV'13, Lecture Notes in Computer Science 8044, pages 124-140. Springer-Verlag, July 2013. |
[Ehl13] | Rüdiger Ehlers. Symmetric and Efficient Synthesis. PhD thesis, Saarland University, Germany, October 2013. |
[FJ13] | John Fearnley and Marcin Jurdziński. Reachability in two-clock timed automata is PSPACE-complete. In ICALP'13, Lecture Notes in Computer Science 7966, pages 212-223. Springer-Verlag, July 2013. |
[FLL13] | Oliver Friedmann, Martin Lange, and Markus Latte. Satisfiability Games for Branching-Time Logics. Logical Methods in Computer Science 9(4). October 2013. |
[FPS13] | Nathanaël Fijalkow, Sophie Pinchinat, and Olivier Serre. Emptiness Of Alternating Tree Automata Using Games With Imperfect Information. In FSTTCS'13, Leibniz International Proceedings in Informatics 24, pages 299-311. Leibniz-Zentrum für Informatik, December 2013. |
[Gel13] | Marcus Gelderie. Strategy Composition in Compositional Games. In ICALP'13, Lecture Notes in Computer Science 7966, pages 263-274. Springer-Verlag, July 2013. |
[GL13] | Stefan Göller and Markus Lohrey. Branching-time model checking of one-counter processes and timed automata. SIAM Journal on Computing 42(3):884-923. Society for Industrial and Applied Math., 2013. |
[Hen13] | Thomas A. Henzinger. Quantitative reactive modeling and verification. Computer Science – Research and Development 28(4):331-344. November 2013. |
[HIM13] | Thomas Dueholm Hansen,
Rasmus Ibsen-Jensen, and
Peter Bro Miltersen.
A Faster Algorithm for Solving One-Clock Priced
Timed Games.
In CONCUR'13,
Lecture Notes in Computer Science 8052, pages 531-545. Springer-Verlag, August 2013.
|
[HLW13] | Andreas Herzig, Emiliano Lorini, and Dirk Walther. Reasoning about Actions Meets Strategic Logics. In LORI'13, Lecture Notes in Computer Science 8196, pages 162-175. Springer-Verlag, October 2013. |
[HO13] | Thomas A. Henzinger and Jan Otop. From Model Checking to Model Measuring. In CONCUR'13, Lecture Notes in Computer Science 8052, pages 273-287. Springer-Verlag, August 2013. |
[HOW13] | Paul Hunter, Joël Ouaknine, and James Worrell. Expressive Completeness for Metric Temporal Logic. In LICS'13, pages 349-357. IEEE Comp. Soc. Press, June 2013. |
[HSW13] | Frédéric Herbreteau, B. Srivathsan, and Igor Walukiewicz. Lazy Abstractions for Timed Automata. In CAV'13, Lecture Notes in Computer Science 8044, pages 990-1005. Springer-Verlag, July 2013. |
[HSW13] | Chung-Hao Huang, Sven Schewe, and Farn Wang. Model Checking Iterated Games. In TACAS'13, Lecture Notes in Computer Science 7795, pages 154-168. Springer-Verlag, March 2013. |
[Hun13] | Paul Hunter. When is Metric Temporal Logic Expressively Complete?. In CSL'13, Leibniz International Proceedings in Informatics 23, pages 380-394. Leibniz-Zentrum für Informatik, September 2013. |
[JLR13] | Line Juhl, Kim Guldstrand Larsen, and Jean-François Raskin. Optimal Bounds for Multiweighted and Parametrised Energy Games. In Theories of Programming and Formal Methods – Essays Dedicated to Jifeng He on the Occasion of His 70th Birthday, Lecture Notes in Computer Science 8051, pages 244-255. Springer-Verlag, 2013. |
[JLS+13] | Jonas Finnemann Jensen, Kim Guldstrand Larsen, Jiří Srba, and Lars Kærlund Østergaard. Local Model Checking of Weighted CTL with Upper-Bound Constraints. In SPIN'13, Lecture Notes in Computer Science 7976, pages 178-195. Springer-Verlag, July 2013. |
[KBM13] | Jean-François Kempf,
Marius Bozga, and
Oded Maler.
As soon as probable: Optimal scheduling under
stochastic uncertainty.
In TACAS'13,
Lecture Notes in Computer Science 7795, pages 385-400. Springer-Verlag, March 2013.
|
[KR13] | Jim Kurose and Keith Ross. Computer Networks – A top-down approach. Pearson, 2013. |
[MMS13] | Fabio Mogavero, Aniello Murano, and Luigi Sauro. On the Boundary of Behavioral Strategies. In LICS'13, pages 263-272. IEEE Comp. Soc. Press, June 2013. |
[Rei13] | Julien Reichert. On The Complexity of Counter Reachability Games. In RP'13, Lecture Notes in Computer Science 8169, pages 196-208. Springer-Verlag, September 2013. |
[San13] | Ocan Sankur.
Robustness in Timed Automata: Analysis, Synthesis,
Implementation.
Thèse de doctorat,
Lab. Spécification & Vérification, ENS Cachan,
France,
May 2013.
|
[Sch13] | Sylvain Schmitz.
Complexity Hierarchies Beyond Elementary.
Research Report cs.CC/1312.5686, arXiv,
December 2013.
|
[Sip13] | Michael Sipser. Introduction to the theory of computation. Cengage Learning, 2013. |
[SW13] | Chrstoffer Sloth and Rafael Wisniewski. Complete abstractions of dynamical systems by timed automata. Nonlinear Analysis: Hybrid Systems 7(1):80-100. February 2013. |
[UB13] | Michael Ummels and Christel Baier. Computing Quantiles in Markov Reward Models. In FoSSaCS'13, Lecture Notes in Computer Science 7794, pages 353-368. Springer-Verlag, March 2013. |
[Wan13] | Farn Wang. Efficient Model-Checking of Dense-Time Systems with Time-Convexity Analysis. Theoretical Computer Science 467:89-108. Elsevier, January 2013. |
[ZL13] | Janan Zaytoon and Stéphane Lafortune. Overview of fault diagnosis methods for Discrete Event Systems. Annual Reviews in Control 37(2):308-320. Elsevier, 2013. |
Search
Displayed 53 resultsList of authors
- 1
- 1
- 1
- 1
- 1
- 2
- 2
- 1
- 1
- 1
- 2
- 1
- 3
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 2
- 1
- 1
- 1
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 4
- 1
- 1
- 1
- 2
- 1
- 1
- 1
- 2
- 1
- 1
- 1
- 2
- 1
- 1
- 1
- 1
- 1
- 6
- 1
- 1
- 1
- 2
- 1
- 1
- 1
- 1
- 2
- 4
- 1
- 1
- 1
- 1
- 1
- 1
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 3
- 1
- 1
- 1
- 1
- 1
- 1
- 4
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 2
- 1
- 1
- 1