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 174185.
ACM Press, January 1980.

[Lam83]  Leslie Lamport.
What good is Temporal Logic?.
In WCC'83,
pages 657668.
NorthHolland/IFIP, September 1983.

[Lam87]  Leslie Lamport.
A Fast Mutual Exclusion Algorithm.
ACM Transactions on Computer Systems 5(1):111. ACM Press, February 1987.

[Lan02]  Martin Lange.
Local Model Checking Games for Fixed Point Logic
with Chop.
In CONCUR'02,
Lecture Notes in Computer Science 2421, pages 240254. SpringerVerlag, August 2002.

[Lan02]  Martin Lange.
Alternating ContextFree Languages and Linear Time
μcalculus with Sequential Composition.
In EXPRESS'02,
Electronic Notes in Theoretical Computer Science 68(2), pages 7187. Elsevier, August 2002.

[Lan05]  Martin Lange.
Weak Automata for the Linear Time
μCalculus.
In VMCAI'05,
Lecture Notes in Computer Science 3385, pages 267281. SpringerVerlag, January 2005.

[Lan07]  Martin Lange.
LinearTime Logics Around PSL: Complexity,
Expressiveness, and a Little Bit of Succinctness.
In CONCUR'07,
Lecture Notes in Computer Science 4703, pages 90104. SpringerVerlag, September 2007.

[Lan08]  Martin Lange.
A purely modeltheoretic proof of the exponential
succinctness gap between CTL+ and CTL.
Information Processing Letters 108(5):308312. Elsevier, November 2008.

[Lar86]  Kim Guldstrand Larsen. Contextdependent bisimulation between processes. PhD thesis, School of Informatics, University of Edinburgh, UK, 1986. 
[Lar90]  Kim Guldstrand Larsen.
Modal Specifications.
In AVMFSS'89,
Lecture Notes in Computer Science 407, pages 232246. SpringerVerlag, 1990.

[Lar92]  Kim Skak Larsen.
Length of Maximal Common Subsequences.
Technical Report PB426, DAIMI, Faculty of Science, University of Aarhus,
Denmark,
October 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):343345. Elsevier, June 1995.

[Las02]  Sławomir Lasota.
Decidability of Strong Bisimilarity for Timed BPP.
In CONCUR'02,
Lecture Notes in Computer Science 2421, pages 562579. SpringerVerlag, August 2002.

[LBB+01]  Kim Guldstrand Larsen, Gerd Behrmann, Ed Brinksma, Ansgar Fehnker, Thomas Hune, Paul Pettersson, and Judi Romijn. As Cheap as Possible: Efficient CostOptimal Reachability for Priced Timed Automata. In CAV'01, Lecture Notes in Computer Science 2102, pages 493505. SpringerVerlag, July 2001. 
[LD03]  Cullen Linn and
Saumya Debray.
Obfuscation of Executable Code to Improve Resistance
to Static Disassembly.
In CCS'03,
pages 290299.
ACM Press, October 2003.

[LDW+19]  Vincent Langenfeld, Daniel Dietsch, Bernd Westphal, Jochen Hoenicke, and Amalinda Post. Scalable Analysis of RealTime Requirements. In RE'19, pages 234244. IEEE Comp. Soc. Press, September 2019. 
[Lei81]  Ernst Leiss.
Succinct representation of regular languages by
boolean automata.
Theoretical Computer Science 13(3):323330. 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,
December 2003.

[LFM+16]  Adrien Le Coënt, Laurent Fribourg, Nicolas Markey, Florian De Vuyst, and Ludovic Chamoin. Distributed Synthesis of StateDependent Switching Control. In RP'16, Lecture Notes in Computer Science 9899, pages 119133. SpringerVerlag, September 2016. 
[LFM+18]  Adrien Le Coënt, Laurent Fribourg, Nicolas Markey, Florian De Vuyst, and Ludovic Chamoin. Distributed Synthesis of StateDependent Switching Control. Theoretical Computer Science 750:5368. Elsevier, November 2018. 
[Lim05]  Nutan Limaye.
Parallel Complexity Classes Centered around
LOGCFL.
Master's thesis,
Anna University, Chennai, India,
April 2005.

[LL98]  François Laroussinie and
Kim Guldstrand Larsen.
CMC: A Tool for Compositional ModelChecking of
RealTime Systems.
In FORTE/PSTV'98,
IFIP Conference Proceedings 135, pages 439456. Kluwer Academic, October 1998.

[LLH18]  Stéphane Lafortune, Feng Lin, and Christoforos N. Hadjicostis. On the history of diagnosability and opacity in discrete event systems. Annual Reviews in Control 45:257266. Elsevier, 2018. 
[LLP+97]  Kim Guldstrand Larsen,
Fredrik Larsson,
Paul Pettersson, and
Wang Yi.
Efficient verification of realtime systems: compact
data structure and statespace reduction.
In RTSS'97,
pages 1424.
IEEE Comp. Soc. Press, December 1997.

[LLT+14]  Kim Guldstrand Larsen, Axel Legay, LouisMarie Traonouez, and Andrzej Wąsowski. Robust synthesis for realtime systems. Theoretical Computer Science 515:96122. Elsevier, January 2014. 
[LLW95]  François Laroussinie, Kim Guldstrand Larsen, and Carsten Weise. From Timed Automata to Logic – and Back. In MFCS'95, Lecture Notes in Computer Science 969, pages 529539. SpringerVerlag, August 1995. 
[LLZ15]  Kim Guldstrand Larsen,
Simon Laursen, and
Martin Zimmermann.
Limit Your Consumption! Finding Bounds in
Averageenergy Games.
Research Report 1510.05774, arXiv,
October 2015.

[LM02]  Christopher Lynch and
Barbara Morawska.
Automatic Decidability.
In LICS'02,
pages 916.
IEEE Comp. Soc. Press, July 2002.

[LM13]  François Laroussinie and Nicolas Markey. Satisfiability of ATL with strategy contexts. In GandALF'13, Electronic Proceedings in Theoretical Computer Science 119, pages 208223. August 2013. 
[LM14]  François Laroussinie and Nicolas Markey. Quantified CTL: expressiveness and complexity. Logical Methods in Computer Science 10(4). December 2014. 
[LM15]  François Laroussinie and Nicolas Markey. Augmenting ATL with strategy contexts. Information and Computation 245:98123. Elsevier, December 2015. 
[LMG04]  Thomas Lévy,
Olivier Marcé, and
Damien Galand.
Embedded BGP Routing Monitoring.
In HSNMC'04,
Lecture Notes in Computer Science 3079, pages 348359. SpringerVerlag, June 2004.

[LMN04]  Kim Guldstrand Larsen, Marius Mikučionis, and Brian Nielsen. Online Testing of Realtime Systems Using Uppaal. In FATES'04, Lecture Notes in Computer Science 3395, pages 7994. SpringerVerlag, September 2004. 
[LMO06]  François Laroussinie, Nicolas Markey, and Ghassan Oreiby. ModelChecking Timed ATL for Durational Concurrent Game Structures. In FORMATS'06, Lecture Notes in Computer Science 4202, pages 245259. SpringerVerlag, September 2006. 
[LMO07]  François Laroussinie, Nicolas Markey, and Ghassan Oreiby. On the Expressiveness and Complexity of ATL. In FoSSaCS'07, Lecture Notes in Computer Science 4423, pages 243257. SpringerVerlag, March 2007. 
[LMO08]  François Laroussinie, Nicolas Markey, and Ghassan Oreiby. On the Expressiveness and Complexity of ATL. Logical Methods in Computer Science 4(2). May 2008. 
[LMS01]  François Laroussinie, Nicolas Markey, and Philippe Schnoebelen. Model Checking CTL+ and FCTL is hard. In FoSSaCS'01, Lecture Notes in Computer Science 2030, pages 318331. SpringerVerlag, April 2001. 
[LMS02]  François Laroussinie, Nicolas Markey, and Philippe Schnoebelen. On Model Checking Durational Kripke Structures (Extended Abstract). In FoSSaCS'02, Lecture Notes in Computer Science 2303, pages 264279. SpringerVerlag, April 2002. 
[LMS02]  François Laroussinie, Nicolas Markey, and Philippe Schnoebelen. Temporal Logic with Forgettable Past. In LICS'02, pages 383392. IEEE Comp. Soc. Press, July 2002. 
[LMS04]  François Laroussinie, Nicolas Markey, and Philippe Schnoebelen. Model Checking Timed Automata with One or Two Clocks. In CONCUR'04, Lecture Notes in Computer Science 3170, pages 387401. SpringerVerlag, August 2004. 
[LMS06]  François Laroussinie, Nicolas Markey, and Philippe Schnoebelen. Efficient timed model checking for discretetime systems. Theoretical Computer Science 353(13):249271. Elsevier, March 2006. 
[LMS15]  François Laroussinie, Nicolas Markey, and Arnaud Sangnier. ATLsc with partial observation. In GandALF'15, Electronic Proceedings in Theoretical Computer Science 193, pages 4357. September 2015. 
[LMS+99]  Clemens Lautermann,
Pierre McKenzie,
Thomas Schwentick, and
Heribert Vollmer.
The Descriptive Complexity Approach to LOGCFL.
In STACS'99,
Lecture Notes in Computer Science 1563, pages 444454. SpringerVerlag, March 1999.

[LN00]  Salvatore La Torre and
Margherita Napoli.
A Decidable Dense Branchingtime Temporal Logic.
In FSTTCS'00,
Lecture Notes in Computer Science 1974, pages 139150. SpringerVerlag, December 2000.

[LN01]  Salvatore La Torre and
Margherita Napoli.
Timed tree automata with an application to temporal
logic.
Acta Informatica 38(2):89116. SpringerVerlag, 2001.

[LNZ04]  Denis Lugiez,
Peter Niebert, and
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 296311. SpringerVerlag, March 2004.

[LNZ05]  Denis Lugiez,
Peter Niebert, and
Sarah Zennou.
A partial order semantics approach to the clock
explosion problem of timed automata.
Theoretical Computer Science 345(1):2759. Elsevier, November 2005.

[Lod01]  Christof Löding.
Efficient minimization of deterministic weak
ωautomata.
Information Processing Letters 79(3):105109. Elsevier, July 2001.

[Lod21]  Christof Löding. Automata on infinite trees. In JeanÉric Pin (eds.), Handbook of automata theory. EMS Press, 2021. 
[Loh05]  Markus Lohrey.
Model Checking Hierarchical Structures.
In LICS'05,
pages 168 177.
IEEE Comp. Soc. Press, July 2005.

[LP85]  Orna Lichtenstein and
Amir Pnueli.
Checking that Finite State Concurrent Programs
Satisfy their Linear Specifiction.
In POPL'85,
pages 97107.
ACM Press, January 1985.

[LP06]  Kamal Lodaya and
Paritosh K. Pandya.
A Dose of Timed Logic, in Guarded Measure.
In FORMATS'06,
Lecture Notes in Computer Science 4202, pages 260273. SpringerVerlag, September 2006.

[LP07]  Yuri M. Lifshits and
Dmitri S. Pavlov.
Potential Theory for Mean Payoff Games.
Journal of Mathematical Science 145(3):49674974. SpringerVerlag, September 2007.

[LP14]  Jun Liu and Pavithra Prabhakar. Switching control of dynamical systems from metric temporal logic specifications. In ICRA'01, pages 53335338. IEEE Robotics & Automation Soc., May 2014. 
[LPS04]  Banjamin Lynn,
Manoj Prabhakaran, and
Amit Sahai.
Positive Results and Techniques for Obfuscation.
In EUROCRYPT'04,
Lecture Notes in Computer Science 3027, pages 2039. SpringerVerlag, August 2004.

[LPT09]  Kai Lampka, Simon Perathoner, and Lothar Thiele. Analytic Realtime Analysis and Timed Automata: A Hybrid Method for Analyzing Embedded Realtime Systems. In EMSOFT'09, pages 107116. ACM Press, October 2009. 
[LPW+99]  Kim Guldstrand Larsen,
Justin Pearson,
Carsten Weise, and
Wang Yi.
Clock Difference Diagrams.
Nordic Journal of Computing 6(3):271298. Publishing Association Nordic Journal of Computing, 1999.

[LPY97]  Kim Guldstrand Larsen,
Paul Pettersson, and
Wang Yi.
Uppaal in a nutshell.
International Journal on Software Tools for
Technology Transfer 1(12):134152. SpringerVerlag, October 1997.

[LPZ85]  Orna Lichtenstein,
Amir Pnueli, and
Lenore D. Zuck.
The Glory of the Past.
In CLP'85,
Lecture Notes in Computer Science 193, pages 413424. SpringerVerlag, June 1985.

[LR03]  Christof Löding and
Philipp Rohde.
Solving the Sabotage Game is PSPACEhard.
In MFCS'03,
Lecture Notes in Computer Science 2747, pages 531540. SpringerVerlag, August 2003.

[LR05]  Kim Guldstrand Larsen and
Jacob Illum Rasmussen.
Optimal Conditional reachability for MultiPriced
Timed Automata.
In FoSSaCS'05,
Lecture Notes in Computer Science 3441, pages 234249. SpringerVerlag, April 2005.

[LR08]  Kim Guldstrand Larsen and
Jacob Illum Rasmussen.
Optimal Conditional reachability for MultiPriced
Timed Automata.
Theoretical Computer Science 390(23):197213. Elsevier, January 2008.

[LR16]  Anthony W. Lin and Philipp Rümmer. Liveness of Randomised Parameterised Systems under Arbitrary Schedulers. In CAV'16, Lecture Notes in Computer Science 9779, pages 112133. SpringerVerlag, July 2016. 
[LRL98]  Zhiming Liu,
Anders P. Ravn, and
Xiaochan Li.
Verifying Duration Properties of Timed Transition
Systems.
In PROCOMET'98,
IFIP Conference Proceedings 125, pages 327345. Chapman & Hall, June 1998.

[LS92]  Nancy Lynch and
Nir Shavit.
TimingBased Mutual Exclusion.
In RTSS'92,
pages 211.
IEEE Comp. Soc. Press, December 1992.

[LS94]  François Laroussinie and
Philippe Schnoebelen.
A Hierarchy of Temporal Logics with Past.
In STACS'94,
Lecture Notes in Computer Science 775, pages 4758. SpringerVerlag, February 1994.

[LS95]  François Laroussinie and
Philippe Schnoebelen.
A Hierarchy of Temporal Logics with Past.
Theoretical Computer Science 148(2):303324. Elsevier, September 1995.

[LS98]  Xinxin Liu and
Scott A. Smolka.
Simple LinearTime Algorithms for Minimal Fixed
Points.
In ICALP'98,
Lecture Notes in Computer Science 1443, pages 5366. SpringerVerlag, July 1998.

[LS00]  François Laroussinie and
Philippe Schnoebelen.
Specification in CTL+Past for Verification in
CTL.
Information and Computation 156(12):236263. Academic Press, January 2000.

[LS00]  François Laroussinie and Philippe Schnoebelen. The StateExplosion Problem from Trace to Bisimulation Equivalence. In FoSSaCS'00, Lecture Notes in Computer Science 1784, pages 192207. SpringerVerlag, March 2000. 
[LS01]  Jan Lunze and Jochen Schröder. State observation and diagnosis of discreteevent systems described by stochastic automata. Discrete Event Dynamic Systems 11(4):319369. Kluwer Academic, October 2001. 
[LS02]  Martin Lange and
Colin Stirling.
Model Checking Fixed Point Logic with Chop.
In FoSSaCS'02,
Lecture Notes in Computer Science 2303, pages 250263. SpringerVerlag, April 2002.

[LS09]  Martin Leucker and Christian Schallart. A brief account of runtime verification. Journal of Logic and Algebraic Programming 78(5):293303. Elsevier, May 2009. 
[LST00]  François Laroussinie,
Philippe Schnoebelen, and
Mathieu Turuani.
On the Expressive and Complexity of Quantitative
BranchingTime Temporal Logics.
In LATIN'00,
Lecture Notes in Computer Science 1776, pages 437446. SpringerVerlag, April 2000.

[LST03]  François Laroussinie,
Philippe Schnoebelen, and
Mathieu Turuani.
On the expressivity and complexity of quantitative
branchingtime temporal logics.
Theoretical Computer Science 297(13):297315. Elsevier, March 2003.

[LSW01]  Carsten Lutz,
Ulrike Sattler, and
Frank Wolter.
Modal Logic and the TwoVariable Fragment.
In CSL'01,
Lecture Notes in Computer Science 2142, pages 247261. SpringerVerlag, September 2001.

[LT00]  Christof Löding and Wolfgang Thomas. Alternating Automata and Logics over Infinite Words. In IFIPTCS'00, Lecture Notes in Computer Science 1872, pages 521535. SpringerVerlag, August 2000. 
[Lug03]  Denis Lugiez.
Counting and Equality Constraints for Multitree
Automata.
In FoSSaCS'03,
Lecture Notes in Computer Science 2620, pages 328342. SpringerVerlag, April 2003.

[Lut08]  Michael Luttenberger.
Strategy Iteration using NonDeterministic
Strategies for Solving Parity Games.
Research Report cs.GT/0806.2923, arXiv,
June 2008.

[LV99]  Richard J. Lipton and
Anastasios Viglas.
On the Complexity of SAT.
In FOCS'99,
pages 459464.
IEEE Comp. Soc. Press, November 1999.

[LW05]  Sławomir Lasota and
Igor Walukiewicz.
Alternating Timed Automata.
In FoSSaCS'05,
Lecture Notes in Computer Science 3441, pages 250265. SpringerVerlag, April 2005.

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

[LWW07]  Carsten Lutz, Dirk Walther, and Frank Wolter. Quantitative temporal logics over the reals: PSPACE and below. Information and Computation 205(1):99123. Elsevier, January 2007. 
[LY94]  Kim Guldstrand Larsen and
Wang Yi.
Time Abstracted Bisimiulation: Implicit
Specifications and Decidability.
In MFPS'93,
Lecture Notes in Computer Science 802, pages 160176. SpringerVerlag, 1994.

[LZ20]  Karoliina Lehtinen and Martin Zimmermann. Goodforgames ωpushdown automata. In LICS'20, pages 689702. IEEE Comp. Soc. Press, July 2020. 
Search
Displayed 87 resultsList of authors
 1
 1
 2
 2
 1
 1
 1
 2
 1
 1
 1
 1
 1
 4
 3
 1
 1
 3
 6
 1
 22
 14
 1
 1
 3
 1
 1
 2
 1
 1
 1
 1
 1
 1
 2
 1
 1
 1
 1
 1
 1
 1
 1
 1
 1
 1
 3
 1
 1
 2
 1
 1
 1
 1
 14
 1
 1
 1
 2
 2
 1
 3
 1
 1
 1
 1
 3
 2
 1
 1
 1
 1
 2
 1
 1
 1
 1
 1
 1
 1
 11
 1
 1
 1
 1
 1
 1
 1
 1
 2
 1
 1
 1
 1
 2
 2
 1
 2
 4
 2
 2
 1