2005 | |
---|---|
[BCM05] | Patricia Bouyer, Fabrice Chevalier, and Nicolas Markey. On the Expressiveness of TPTL and MTL. In FSTTCS'05, Lecture Notes in Computer Science 3821, pages 432-443. Springer-Verlag, December 2005. |
[AAE05] | Baruch Awerbuch, Yossi Azar, and Amir Epstein. The price of routing unsplittable flow. In STOC'05, pages 57-66. ACM Press, May 2005. |
[ADO+05] | Parosh Aziz Abdulla,
Johann Deneux,
Joël Ouaknine, and
James Worrell.
Decidability and Complexity Results for Timed
Automata via Channel Machines.
In ICALP'05,
Lecture Notes in Computer Science 3580, pages 1089-1101. Springer-Verlag, July 2005.
|
[dAF+05] | Luca de Alfaro,
Marco Faella,
Thomas A. Henzinger,
Rupak Majumdar, and
Mariëlle Stoelinga.
Model checking discounted temporal properties.
Theoretical Computer Science 345(1):139-170. Elsevier, November 2005.
|
[ALM05] | Rajeev Alur, Salvatore La Torre, and Parthasarathy Madhusudan. Perturbed Timed Automata. In HSCC'05, Lecture Notes in Computer Science 3414, pages 70-85. Springer-Verlag, March 2005. |
[AMR+05] | Karine Altisen, Nicolas Markey, Pierre-Alain Reynier, and Stavros Tripakis. Implémentabilité des automates temporisés. In MSR'05, pages 395-406. Hermès, October 2005. |
[AT05] | Karine Altisen and
Stavros Tripakis.
Implementation of Timed Automata: An Issue of
Semantics or Modeling?.
In FORMATS'05,
Lecture Notes in Computer Science 3829, pages 273-288. Springer-Verlag, September 2005.
|
[BBR05] | Thomas Brihaye, Véronique Bruyère, and Jean-François Raskin. On Optimal Timed Strategies. In FORMATS'05, Lecture Notes in Computer Science 3829, pages 49-64. Springer-Verlag, September 2005. |
[BC05] | Patricia Bouyer and
Fabrice Chevalier.
On Conciseness of Extensions of Timed Automata.
Journal of Automata, Languages and Combinatorics 10(4):393-405. 2005.
|
[BCD05] | Patricia Bouyer, Fabrice Chevalier, and Deepak D'Souza. Fault Diagnosis Using Timed Automata. In FoSSaCS'05, Lecture Notes in Computer Science 3441, pages 219-233. Springer-Verlag, April 2005. |
[BG05] | Dietmar Berwanger and
Erich Grädel.
Entanglement – A Measure for the Complexity of
Directed Graphs with Applications to Logic and
Games.
In LPAR'04,
Lecture Notes in Computer Science 3452, pages 209-223. Springer-Verlag, March 2005.
|
[BH05] | Dragan Bosnacki and Gerard J. Holzmann. Improving Spin's Partial-Order Reduction for Breadth-First Search. In SPIN'05, Lecture Notes in Computer Science 3639, pages 91-105. Springer-Verlag, April 2005. |
[BJK+05] | Manfred Broy,
Bengt Jonsson,
Joost-Pieter Katoen,
Martin Leucker, and
Alexander Pretschner.
Model-Based Testing of Reactive Systems – Advanced
lectures.
Lecture Notes in Computer Science 3472.
Springer-Verlag, 2005.
|
[BLR05] | Patricia Bouyer, François Laroussinie, and Pierre-Alain Reynier. Diagonal Constraints in Timed Automata: Forward Analysis of Timed Systems. In FORMATS'05, Lecture Notes in Computer Science 3829, pages 112-126. Springer-Verlag, September 2005. |
[BLR05] | Gerd Behrmann, Kim Guldstrand Larsen, and Jacob Illum Rasmussen. Optimal scheduling using priced timed automata. SIGMETRICS Performance Evaluation Review 32(4):34-40. March 2005. |
[BT05] | Harry Buhrman and
Leen Torenvliet.
A Post's Program for Complexity Theory.
EATCS Bulletin 85:41-51. EATCS, February 2005.
|
[CDF+05] | Franck Cassez, Alexandre David, Emmanuel Fleury, Kim Guldstrand Larsen, and Didier Lime. Efficient On-the-fly Algorithms for the Analysis of Timed Games. In CONCUR'05, Lecture Notes in Computer Science 3653, pages 66-80. Springer-Verlag, August 2005. |
[CHJ05] | Krishnendu Chatterjee, Thomas A. Henzinger, and Marcin Jurdziński. Mean-payoff Parity Games. In LICS'05, pages 178-187. IEEE Comp. Soc. Press, July 2005. |
[CK05] | George Christodoulou and Elias Koutsoupias. The price of anarchy of finite congestion games. In STOC'05, pages 67-73. ACM Press, May 2005. |
[DDR05] | Martin De Wulf,
Laurent Doyen, and
Jean-François Raskin.
Almost ASAP Semantics: From Timed Models to Timed
Implementations.
Formal Aspects of Computing 17(3):319-341. Springer-Verlag, 2005.
|
[Die05] | Henning Dierks.
Finding Optimal Plans for Domains with Continuous
Effects with UPPAAL Cora.
In VV&PS'05.
June 2005.
|
[DP05] | Deepak D'Souza and
Pavithra Prabhakar.
On the Expressiveness of MTL in the Pointwise and
Continuous Semantics.
Technical Report IISc-CSA-TR-2005-7, Indian Institute of Science, Bangalore, India,
May 2005.
|
[EY05] | Kousha Etessami and
Mihalis Yannakakis.
Recursive Markov Decision Processes and Recursive
Stochastic Games.
In ICALP'05,
Lecture Notes in Computer Science 3580, pages 891-903. Springer-Verlag, July 2005.
|
[FKS05] | Dimitris Fotakis, Spyros Kontogiannis, and Paul G. Spirakis. Selfish unsplittable flows. Theoretical Computer Science 348(2-3):226-239. Elsevier, December 2005. |
[FW05] | Carsten Fritz and
Thomas Wilke.
Simulation Relations for Alternating Büchi
Automata.
Theoretical Computer Science 338(1-3):275-314. Elsevier, June 2005.
|
[GC05] | Arie Gurfinkel and
Marsha Chechik.
How Thorough Is Thorough Enough?.
In CHARME'05,
Lecture Notes in Computer Science 3725, pages 65-80. Springer-Verlag, October 2005.
|
[GLM+05] | Guillaume Gardey, Didier Lime, Morgan Magnin, and Olivier H. Roux. Romeo: A Tool for Analyzing Time Petri Nets. In CAV'05, Lecture Notes in Computer Science 3576, pages 418-423. Springer-Verlag, July 2005. |
[Gol05] | Oded Goldreich. On promise problems. Research Report 05-014, Electronic Colloquium on Computational Complexity, August 2005. |
[GRV05] | Gilles Geeraerts,
Jean-François Raskin, and
Laurent Van Begin.
Expand, Enlarge and Check... Made Efficient.
In CAV'05,
Lecture Notes in Computer Science 3576, pages 394-407. Springer-Verlag, July 2005.
|
[GTK05] | Shafi Goldwasser and
Yael Tauman Kalai.
On the Impossibility of Obfuscation with Auxiliary
Input.
In FOCS'05,
pages 553-562.
IEEE Comp. Soc. Press, October 2005.
|
[GV05] | Jaco Geldenhuys and
Antti Valmari.
More Efficient On-the-fly LTL Verification with
Tarjan's Algorithm.
Theoretical Computer Science 345(1):60-82. Elsevier, November 2005.
|
[GZ05] | Hugo Gimbert and Wiesław Zielonka. Games Where You Can Play Optimally Without Any Memory. In CONCUR'05, Lecture Notes in Computer Science 3653, pages 428-442. Springer-Verlag, August 2005. |
[Hal05] | Nicolas Halbwachs. A Synchronous Language at Work: the Story of Lustre. In MEMOCODE'05, pages 3-11. IEEE Comp. Soc. Press, July 2005. |
[Har05] | Aidan Harding.
Symbolic Strategy Synthesis for Games with LTL
Winning Conditions.
PhD thesis,
School of Computer Science, University of
Birmingham, UK,
March 2005.
|
[Hen05] | Thomas A. Henzinger.
Games in system design and verification.
In TARK'05,
pages 1-4.
June 2005.
|
[vdH+05] | Wiebe van der Hoek, Wojciech Jamroga, and Michael Wooldridge. A Logic for Strategic Reasoning. In AAMAS'05, pages 157-164. ACM Press, July 2005. |
[HMP05] | Thomas A. Henzinger,
Rupak Majumdar, and
Vinayak S. Prabhu.
Quantifying Similarities Between Timed Systems.
In FORMATS'05,
Lecture Notes in Computer Science 3829, pages 226-241. Springer-Verlag, September 2005.
|
[Hor05] | Florian Horn.
Streett Games on Finite Graphs.
In GDV'05.
July 2005.
|
[HR05] | Yoram Hirshfeld and Alexander Rabinovich. Timer Formulas and Decidable Metric Temporal Logic. Information and Computation 198(2):148-178. Academic Press, May 2005. |
[HR05] | Ian Hodkinson and
Mark Reynolds.
Separation – Past, Present, and Future.
In Sergei N. Artemov,
Howard Barringer,
Artur S. d'Avila Garcez,
Luís C. Lamb, and
John Woods (eds.),
We Will Show Them – Essays in Honour of
Dov Gabbay.
College Publications, 2005.
|
[HRS05] | Aidan Harding,
Mark D. Ryan, and
Pierre-Yves Schobbens.
A New Algorithm for Strategy Synthesis in LTL
Games.
In TACAS'05,
Lecture Notes in Computer Science 3440, pages 477-492. Springer-Verlag, April 2005.
|
[JD05] | Wojciech Jamroga and
Jürgen Dix.
Do Agents Make Model Checking Explode
(Computationally)?.
In CEEMAS'05,
Lecture Notes in Artificial Intelligence 23690, pages 398-407. Springer-Verlag, September 2005.
|
[JvdH+05] | Wojciech Jamroga,
Wiebe van der Hoek, and
Michael Wooldridge.
Intentions and Strategies in Game-Like Scenarios.
In EPIA'05,
Lecture Notes in Artificial Intelligence 3808, pages 512-523. Springer-Verlag, December 2005.
|
[Kar05] | Jarkko Kari.
Theory of Cellular Automata: A Survey.
Theoretical Computer Science 334(1-3):3-33. Elsevier, April 2005.
|
[KO05] | Ahmed Khoumsi and
Lucien Ouedraogo.
A New Method for Transforming Timed Automata.
In SBMF'04,
Electronic Notes in Theoretical Computer Science 130.
Elsevier, 2005.
|
[KP05] | Yonit Kesten and
Amir Pnueli.
A Compositional Approach to CTL*
Verification.
Theoretical Computer Science 331(2-3):397-428. Elsevier, February 2005.
|
[KP05] | Pavel Krčál and
Radek Pelánek.
On Sampled Semantics of Timed Systems.
In FSTTCS'05,
Lecture Notes in Computer Science 3821, pages 310-321. Springer-Verlag, December 2005.
|
[KS05] | Spyros Kontogiannis and Paul G. Spirakis. Atomic selfish routing in networks: a survey. In WINE'05, Lecture Notes in Computer Science 3828, pages 989-1002. Springer-Verlag, December 2005. |
[KS05] | Antonín Kučera and Jan Strejček. The Stuttering Principle Revisited. Acta Informatica 41(7-8):415-434. Springer-Verlag, June 2005. |
[KS05] | Antonín Kučera and
Jan Strejček.
Characteristic Patterns for LTL.
In SOFSEM'05,
Lecture Notes in Computer Science 3381, pages 239-249. Springer-Verlag, January 2005.
|
[KW05] | Shmuel Tomi Klein and
Yair Wiseman.
Parallel Lempel-Ziv Coding.
Discrete Applied Mathematics 146(2):180-191. Elsevier, March 2005.
|
[Lan05] | Martin Lange.
Weak Automata for the Linear Time
μ-Calculus.
In VMCAI'05,
Lecture Notes in Computer Science 3385, pages 267-281. Springer-Verlag, January 2005.
|
[Lim05] | Nutan Limaye.
Parallel Complexity Classes Centered around
LOGCFL.
Master's thesis,
Anna University, Chennai, India,
April 2005.
|
[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):27-59. Elsevier, November 2005.
|
[Loh05] | Markus Lohrey.
Model Checking Hierarchical Structures.
In LICS'05,
pages 168- 177.
IEEE Comp. Soc. Press, July 2005.
|
[LR05] | Kim Guldstrand Larsen and
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, April 2005.
|
[LW05] | Sławomir Lasota and
Igor Walukiewicz.
Alternating Timed Automata.
In FoSSaCS'05,
Lecture Notes in Computer Science 3441, pages 250-265. Springer-Verlag, April 2005.
|
[Mar05] | Wilfredo R. Marrero.
Using BDDs to Decide CTL.
In TACAS'05,
Lecture Notes in Computer Science 3440, pages 222-236. Springer-Verlag, April 2005.
|
[Mit05] | David G. Mitchell.
A SAT Solver Primer.
EATCS Bulletin 85:112-132. EATCS, February 2005.
|
[MP05] | Filippo Mera and
Giovanni Pighizzini.
Complementing Unary Nondeterministic Automata.
Theoretical Computer Science 330(2):349-360. Elsevier, February 2005.
|
[MRW05] | Peter Bro Miltersen,
Jaikumar Radhakrishnan, and
Ingo Wegener.
On Converting CNF to DNF.
Theoretical Computer Science 347(1-2):325-335. Elsevier, November 2005.
|
[MW05] | Anca Muscholl and
Igor Walukiewicz.
An NP-complete Fragment of LTL.
International Journal of Foundations of Computer
Science 16(4):743-753. August 2005.
|
[OW05] | Joël Ouaknine and
James Worrell.
On the Decidability of Metric Temporal Logic.
In LICS'05,
pages 188-197.
IEEE Comp. Soc. Press, July 2005.
|
[PPQ05] | Davide Prandi,
Corrado Priami, and
Paola Quaglia.
Process Calculi in a Biological Context.
EATCS Bulletin 85:53-69. EATCS, February 2005.
|
[PS05] | Radek Pelánek and Jan Strejček. Deeper Connections Between LTL and Alternating Automata.. In CIAA'05, Lecture Notes in Computer Science 3845, pages 238-249. Springer-Verlag, June 2005. |
[Rey05] | Mark Reynolds.
An Axiomatization of PCTL*.
Information and Computation 201(1):72-119. Academic Press, August 2005.
|
[San05] | Sven Sandberg.
Homing and Synchronizing Sequences.
In MBTRS'04,
Lecture Notes in Computer Science 3472, pages 5-33. Springer-Verlag, 2005.
|
[Sla05] | John K. Slaney.
Semipositive LTL with an Uninterpreted Past
Operator.
Logic Journal of the IGPL 13(2):211-229. Oxford University Press, March 2005.
|
[TYB05] | Stavros Tripakis, Sergio Yovine, and Ahmed Bouajjani. Checking Timed Büchi Automata Emptiness Efficiently. Formal Methods in System Design 26(3):267-292. Springer-Verlag, May 2005. |
[Umm05] | Michael Ummels.
Rational Behavious and Strategy Construction in
Infinite Multiplayer Games.
Diplomarbeit,
RWTH Aachen, Germany,
July 2005.
|
[Vin05] | N. V. Vinodchandran.
A Note on the Circuit Complexity of PP.
Theoretical Computer Science 347(1-2):415-418. Elsevier, November 2005.
|
[Wee05] | Hoeteck Wee.
On Obfuscating Point Functions.
In STOC'05,
pages 523-532.
ACM Press, May 2005.
|
[Zur05] | Richard Zurawski.
Embedded Systems Handbook.
CRC Press, 2005.
|
Search
Displayed 73 resultsList of authors
- 1
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 4
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 3
- 1
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 2
- 4
- 1
- 1
- 1
- 1
- 3
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 2
- 1
- 1
- 2
- 1
- 1
- 1
- 3
- 1
- 1
- 1
- 2
- 1
- 1
- 1
- 1
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 2
- 1
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 3
- 2
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 2
- 1
- 3
- 1
- 1
- 3
- 1
- 1
- 1
- 2
- 1
- 2
- 1
- 1
- 1
- 1
- 2
- 2
- 1
- 1
- 1
- 1
- 1