L | |
---|---|

[La01] | Salvatore La Torre. Verification of Reactive Systems and Decision Problems in Temporal Logics. PhD thesis, University of Pennsylvania, 2001. |

[Lam80] | Leslie Lamport. ``Sometimes'' is sometimes ``Not Never''. In POPL'80, pages 174-185. ACM Press, janvier 1980. |

[Lam83] | Leslie Lamport. What good is Temporal Logic?. In WCC'83, pages 657-668. North-Holland/IFIP, septembre 1983. |

[Lam87] | Leslie Lamport. A Fast Mutual Exclusion Algorithm. ACM Transactions on Computer Systems 5(1):1-11. ACM Press, février 1987. |

[Lan02] | Martin Lange. Local Model Checking Games for Fixed Point Logic with Chop. In CONCUR'02, Lecture Notes in Computer Science 2421, pages 240-254. Springer-Verlag, août 2002. |

[Lan02] | Martin Lange. Alternating Context-Free Languages and Linear Time μ-calculus with Sequential Composition. In EXPRESS'02, Electronic Notes in Theoretical Computer Science 68(2), pages 71-87. Elsevier, août 2002. |

[Lan05] | Martin Lange. Weak Automata for the Linear Time μ-Calculus. In VMCAI'05, Lecture Notes in Computer Science 3385, pages 267-281. Springer-Verlag, janvier 2005. |

[Lan07] | Martin Lange. Linear-Time Logics Around PSL: Complexity, Expressiveness, and a Little Bit of Succinctness. In CONCUR'07, Lecture Notes in Computer Science 4703, pages 90-104. Springer-Verlag, septembre 2007. |

[Lan08] | Martin Lange. A purely model-theoretic proof of the exponential succinctness gap between CTL+ and CTL. Information Processing Letters 108(5):308-312. Elsevier, novembre 2008. |

[Lar90] | Kim Guldstrand Larsen. Modal Specifications. In AVMFSS'89, Lecture Notes in Computer Science 407, pages 232-246. Springer-Verlag, 1990. |

[Lar92] | Kim Skak Larsen. Length of Maximal Common Subsequences. Technical Report PB-426, DAIMI, Faculty of Science, University of Aarhus, Denmark, Octobre 1992. |

[Lar94] | François Laroussinie. Logiques temporelles avec passé pour la spécification et la vérification des systèmes réactifs. Thèse de doctorat, INPG, 1994. |

[Lar95] | François Laroussinie. About the Expressive Power of CTL Combinators. Information Processing Letters 54(6):343-345. Elsevier, juin 1995. |

[Las02] | Sławomir Lasota. Decidability of Strong Bisimilarity for Timed BPP. In CONCUR'02, Lecture Notes in Computer Science 2421, pages 562-579. Springer-Verlag, août 2002. |

[LBB+01] | Kim Guldstrand Larsen, Gerd Behrmann, Ed Brinksma, Ansgar Fehnker, Thomas Hune, Paul Pettersson et Judi Romijn. As Cheap as Possible: Efficient Cost-Optimal Reachability for Priced Timed Automata. In CAV'01, Lecture Notes in Computer Science 2102, pages 493-505. Springer-Verlag, juillet 2001. |

[LD03] | Cullen Linn et Saumya Debray. Obfuscation of Executable Code to Improve Resistance to Static Disassembly. In CCS'03, pages 290-299. ACM Press, octobre 2003. |

[Lei81] | Ernst Leiss. Succinct representation of regular languages by boolean automata. Theoretical Computer Science 13(3):323-330. Elsevier, 1981. |

[Ler03] | Jérôme Leroux. Algorithmique de la vérification des systèmes à compteurs. Approximation et accélération. Implémentation de l'outil FAST. Thèse de doctorat, Lab. Spécification & Vérification, ENS Cachan, France, Décembre 2003. |

[LFM+16] | Adrien Le Coënt, Laurent Fribourg, Nicolas Markey, Florian De Vuyst et Ludovic Chamoin. Distributed Synthesis of State-Dependent Switching Control. In RP'16, Lecture Notes in Computer Science 9899, pages 119-133. Springer-Verlag, septembre 2016. |

[LFM+18] | Adrien Le Coënt, Laurent Fribourg, Nicolas Markey, Florian De Vuyst et Ludovic Chamoin. Distributed Synthesis of State-Dependent Switching Control. Theoretical Computer Science 750:53-68. Elsevier, novembre 2018. |

[Lim05] | Nutan Limaye. Parallel Complexity Classes Centered around LOGCFL. Master's thesis, Anna University, Chennai, India, Avril 2005. |

[LL98] | François Laroussinie et Kim Guldstrand Larsen. CMC: A Tool for Compositional Model-Checking of Real-Time Systems. In FORTE/PSTV'98, IFIP Conference Proceedings 135, pages 439-456. Kluwer Academic, octobre 1998. |

[LLH18] | Stéphane Lafortune, Feng Lin et Christoforos N. Hadjicostis. On the history of diagnosability and opacity in discrete event systems. Annual Reviews in Control 45:257-266. Elsevier, 2018. |

[LLP+97] | Kim Guldstrand Larsen, Fredrik Larsson, Paul Pettersson et Wang Yi. Efficient verification of real-time systems: compact data structure and state-space reduction. In RTSS'97, pages 14-24. IEEE Comp. Soc. Press, décembre 1997. |

[LLT+14] | Kim Guldstrand Larsen, Axel Legay, Louis-Marie Traonouez et Andrzej Wąsowski. Robust synthesis for real-time systems. Theoretical Computer Science 515:96-122. Elsevier, janvier 2014. |

[LLW95] | François Laroussinie, Kim Guldstrand Larsen et Carsten Weise. From Timed Automata to Logic – and Back. In MFCS'95, Lecture Notes in Computer Science 969, pages 529-539. Springer-Verlag, août 1995. |

[LLZ15] | Kim Guldstrand Larsen, Simon Laursen et Martin Zimmermann. Limit Your Consumption! Finding Bounds in Average-energy Games. Research Report 1510.05774, arXiv, Octobre 2015. |

[LM02] | Christopher Lynch et Barbara Morawska. Automatic Decidability. In LICS'02, pages 9-16. IEEE Comp. Soc. Press, juillet 2002. |

[LM13] | François Laroussinie et Nicolas Markey. Satisfiability of ATL with strategy contexts. In GandALF'13, Electronic Proceedings in Theoretical Computer Science 119, pages 208-223. Août 2013. |

[LM14] | François Laroussinie et Nicolas Markey. Quantified CTL: expressiveness and complexity. Logical Methods in Computer Science 10(4). Décembre 2014. |

[LM15] | François Laroussinie et Nicolas Markey. Augmenting ATL with strategy contexts. Information and Computation 245:98-123. Elsevier, décembre 2015. |

[LMG04] | Thomas Lévy, Olivier Marcé et Damien Galand. Embedded BGP Routing Monitoring. In HSNMC'04, Lecture Notes in Computer Science 3079, pages 348-359. Springer-Verlag, juin 2004. |

[LMN04] | Kim Guldstrand Larsen, Marius Mikučionis et Brian Nielsen. Online Testing of Real-time Systems Using Uppaal. In FATES'04, Lecture Notes in Computer Science 3395, pages 79-94. Springer-Verlag, septembre 2004. |

[LMO06] | François Laroussinie, Nicolas Markey et Ghassan Oreiby. Model-Checking Timed ATL for Durational Concurrent Game Structures. In FORMATS'06, Lecture Notes in Computer Science 4202, pages 245-259. Springer-Verlag, septembre 2006. |

[LMO07] | François Laroussinie, Nicolas Markey et Ghassan Oreiby. On the Expressiveness and Complexity of ATL. In FoSSaCS'07, Lecture Notes in Computer Science 4423, pages 243-257. Springer-Verlag, mars 2007. |

[LMO08] | François Laroussinie, Nicolas Markey et Ghassan Oreiby. On the Expressiveness and Complexity of ATL. Logical Methods in Computer Science 4(2). Mai 2008. |

[LMS01] | François Laroussinie, Nicolas Markey et Philippe Schnoebelen. Model Checking CTL+ and FCTL is hard. In FoSSaCS'01, Lecture Notes in Computer Science 2030, pages 318-331. Springer-Verlag, avril 2001. |

[LMS02] | François Laroussinie, Nicolas Markey et Philippe Schnoebelen. On Model Checking Durational Kripke Structures (Extended Abstract). In FoSSaCS'02, Lecture Notes in Computer Science 2303, pages 264-279. Springer-Verlag, avril 2002. |

[LMS02] | François Laroussinie, Nicolas Markey et Philippe Schnoebelen. Temporal Logic with Forgettable Past. In LICS'02, pages 383-392. IEEE Comp. Soc. Press, juillet 2002. |

[LMS04] | François Laroussinie, Nicolas Markey et Philippe Schnoebelen. Model Checking Timed Automata with One or Two Clocks. In CONCUR'04, Lecture Notes in Computer Science 3170, pages 387-401. Springer-Verlag, août 2004. |

[LMS06] | François Laroussinie, Nicolas Markey et Philippe Schnoebelen. Efficient timed model checking for discrete-time systems. Theoretical Computer Science 353(1-3):249-271. Elsevier, mars 2006. |

[LMS15] | François Laroussinie, Nicolas Markey et Arnaud Sangnier. ATLsc with partial observation. In GandALF'15, Electronic Proceedings in Theoretical Computer Science 193, pages 43-57. Septembre 2015. |

[LMS+99] | Clemens Lautermann, Pierre McKenzie, Thomas Schwentick et Heribert Vollmer. The Descriptive Complexity Approach to LOGCFL. In STACS'99, Lecture Notes in Computer Science 1563, pages 444-454. Springer-Verlag, mars 1999. |

[LN00] | Salvatore La Torre et Margherita Napoli. A Decidable Dense Branching-time Temporal Logic. In FSTTCS'00, Lecture Notes in Computer Science 1974, pages 139-150. Springer-Verlag, décembre 2000. |

[LN01] | Salvatore La Torre et Margherita Napoli. Timed tree automata with an application to temporal logic. Acta Informatica 38(2):89-116. Springer-Verlag, 2001. |

[LNZ04] | Denis Lugiez, Peter Niebert et Sarah Zennou. A partial order semantics approach to the clock explosion problem of timed automata. In TACAS'04, Lecture Notes in Computer Science 2988, pages 296-311. Springer-Verlag, mars 2004. |

[LNZ05] | Denis Lugiez, Peter Niebert et Sarah Zennou. A partial order semantics approach to the clock explosion problem of timed automata. Theoretical Computer Science 345(1):27-59. Elsevier, novembre 2005. |

[Lod01] | Christof Löding. Efficient minimization of deterministic weak ω-automata. Information Processing Letters 79(3):105-109. Elsevier, juillet 2001. |

[Loh05] | Markus Lohrey. Model Checking Hierarchical Structures. In LICS'05, pages 168- 177. IEEE Comp. Soc. Press, juillet 2005. |

[LP85] | Orna Lichtenstein et Amir Pnueli. Checking that Finite State Concurrent Programs Satisfy their Linear Specifiction. In POPL'85, pages 97-107. ACM Press, janvier 1985. |

[LP06] | Kamal Lodaya et Paritosh K. Pandya. A Dose of Timed Logic, in Guarded Measure. In FORMATS'06, Lecture Notes in Computer Science 4202, pages 260-273. Springer-Verlag, septembre 2006. |

[LP07] | Yuri M. Lifshits et Dmitri S. Pavlov. Potential Theory for Mean Payoff Games. Journal of Mathematical Science 145(3):4967-4974. Springer-Verlag, septembre 2007. |

[LP14] | Jun Liu et Pavithra Prabhakar. Switching control of dynamical systems from metric temporal logic specifications. In ICRA'01, pages 5333-5338. IEEE Robotics & Automation Soc., mai 2014. |

[LPS04] | Banjamin Lynn, Manoj Prabhakaran et Amit Sahai. Positive Results and Techniques for Obfuscation. In EUROCRYPT'04, Lecture Notes in Computer Science 3027, pages 20-39. Springer-Verlag, août 2004. |

[LPT09] | Kai Lampka, Simon Perathoner et Lothar Thiele. Analytic Real-time Analysis and Timed Automata: A Hybrid Method for Analyzing Embedded Real-time Systems. In EMSOFT'09, pages 107-116. ACM Press, octobre 2009. |

[LPW+99] | Kim Guldstrand Larsen, Justin Pearson, Carsten Weise et Wang Yi. Clock Difference Diagrams. Nordic Journal of Computing 6(3):271-298. Publishing Association Nordic Journal of Computing, 1999. |

[LPY97] | Kim Guldstrand Larsen, Paul Pettersson et Wang Yi. Uppaal in a nutshell. International Journal on Software Tools for Technology Transfer 1(1-2):134-152. Springer-Verlag, octobre 1997. |

[LPZ85] | Orna Lichtenstein, Amir Pnueli et Lenore D. Zuck. The Glory of the Past. In CLP'85, Lecture Notes in Computer Science 193, pages 413-424. Springer-Verlag, juin 1985. |

[LR03] | Christof Löding et Philipp Rohde. Solving the Sabotage Game is PSPACE-hard. In MFCS'03, Lecture Notes in Computer Science 2747, pages 531-540. Springer-Verlag, août 2003. |

[LR05] | Kim Guldstrand Larsen et Jacob Illum Rasmussen. Optimal Conditional reachability for Multi-Priced Timed Automata. In FoSSaCS'05, Lecture Notes in Computer Science 3441, pages 234-249. Springer-Verlag, avril 2005. |

[LR08] | Kim Guldstrand Larsen et Jacob Illum Rasmussen. Optimal Conditional reachability for Multi-Priced Timed Automata. Theoretical Computer Science 390(2-3):197-213. Elsevier, janvier 2008. |

[LR16] | Anthony W. Lin et Philipp Rümmer. Liveness of Randomised Parameterised Systems under Arbitrary Schedulers. In CAV'16, Lecture Notes in Computer Science 9779, pages 112-133. Springer-Verlag, juillet 2016. |

[LRL98] | Zhiming Liu, Anders P. Ravn et Xiaochan Li. Verifying Duration Properties of Timed Transition Systems. In PROCOMET'98, IFIP Conference Proceedings 125, pages 327-345. Chapman & Hall, juin 1998. |

[LS92] | Nancy Lynch et Nir Shavit. Timing-Based Mutual Exclusion. In RTSS'92, pages 2-11. IEEE Comp. Soc. Press, décembre 1992. |

[LS94] | François Laroussinie et Philippe Schnoebelen. A Hierarchy of Temporal Logics with Past. In STACS'94, Lecture Notes in Computer Science 775, pages 47-58. Springer-Verlag, février 1994. |

[LS95] | François Laroussinie et Philippe Schnoebelen. A Hierarchy of Temporal Logics with Past. Theoretical Computer Science 148(2):303-324. Elsevier, septembre 1995. |

[LS98] | Xinxin Liu et Scott A. Smolka. Simple Linear-Time Algorithms for Minimal Fixed Points. In ICALP'98, Lecture Notes in Computer Science 1443, pages 53-66. Springer-Verlag, juillet 1998. |

[LS00] | François Laroussinie et Philippe Schnoebelen. Specification in CTL+Past for Verification in CTL. Information and Computation 156(1-2):236-263. Academic Press, janvier 2000. |

[LS00] | François Laroussinie et Philippe Schnoebelen. The State-Explosion Problem from Trace to Bisimulation Equivalence. In FoSSaCS'00, Lecture Notes in Computer Science 1784, pages 192-207. Springer-Verlag, mars 2000. |

[LS01] | Jan Lunze et Jochen Schröder. State observation and diagnosis of discrete-event systems described by stochastic automata. Discrete Event Dynamic Systems 11(4):319-369. Kluwer Academic, octobre 2001. |

[LS02] | Martin Lange et Colin Stirling. Model Checking Fixed Point Logic with Chop. In FoSSaCS'02, Lecture Notes in Computer Science 2303, pages 250-263. Springer-Verlag, avril 2002. |

[LS09] | Martin Leucker et Christian Schallart. A brief account of runtime verification. Journal of Logic and Algebraic Programming 78(5):293-303. Elsevier, mai 2009. |

[LST00] | François Laroussinie, Philippe Schnoebelen et Mathieu Turuani. On the Expressive and Complexity of Quantitative Branching-Time Temporal Logics. In LATIN'00, Lecture Notes in Computer Science 1776, pages 437-446. Springer-Verlag, avril 2000. |

[LST03] | François Laroussinie, Philippe Schnoebelen et Mathieu Turuani. On the expressivity and complexity of quantitative branching-time temporal logics. Theoretical Computer Science 297(1-3):297-315. Elsevier, mars 2003. |

[LSW01] | Carsten Lutz, Ulrike Sattler et Frank Wolter. Modal Logic and the Two-Variable Fragment. In CSL'01, Lecture Notes in Computer Science 2142, pages 247-261. Springer-Verlag, septembre 2001. |

[LT00] | Christof Löding et Wolfgang Thomas. Alternating Automata and Logics over Infinite Words. In IFIPTCS'00, Lecture Notes in Computer Science 1872, pages 521-535. Springer-Verlag, août 2000. |

[Lug03] | Denis Lugiez. Counting and Equality Constraints for Multitree Automata. In FoSSaCS'03, Lecture Notes in Computer Science 2620, pages 328-342. Springer-Verlag, avril 2003. |

[Lut08] | Michael Luttenberger. Strategy Iteration using Non-Deterministic Strategies for Solving Parity Games. Research Report cs.GT/0806.2923, arXiv, Juin 2008. |

[LV99] | Richard J. Lipton et Anastasios Viglas. On the Complexity of SAT. In FOCS'99, pages 459-464. IEEE Comp. Soc. Press, novembre 1999. |

[LW05] | Sławomir Lasota et Igor Walukiewicz. Alternating Timed Automata. In FoSSaCS'05, Lecture Notes in Computer Science 3441, pages 250-265. Springer-Verlag, avril 2005. |

[LW08] | Sławomir Lasota et Igor Walukiewicz. Alternating Timed Automata. ACM Transactions on Computational Logic 9(2). ACM Press, mars 2008. |

[LWW07] | Carsten Lutz, Dirk Walther et Frank Wolter. Quantitative temporal logics over the reals: PSPACE and below. Information and Computation 205(1):99-123. Elsevier, janvier 2007. |

[LY94] | Kim Guldstrand Larsen et Wang Yi. Time Abstracted Bisimiulation: Implicit Specifications and Decidability. In MFPS'93, Lecture Notes in Computer Science 802, pages 160-176. Springer-Verlag, 1994. |