T | |
---|---|
[TA99] | Stavros Tripakis and Karine Altisen. On-the-Fly Controller Synthesis for Discrete and Dense-Time Systems. In FM'99, Lecture Notes in Computer Science 1708, pages 233-252. Springer-Verlag, September 1999. |
[Tak97] | Masayuki Takeda.
Pattern Maching Machine for Text Compressed Using
Finite State Model.
Technical Report DOI-TR-142, Dept. of Informatics, Kyushu University, Fukuoka,
Japan,
October 1997.
|
[TAK+96] | Serdar Taşiran,
Rajeev Alur,
Robert P. Kurshan, and
Robert K. Brayton.
Verifying Abstractions of Timed Systems.
In CONCUR'96,
Lecture Notes in Computer Science 1119, pages 546-562. Springer-Verlag, August 1996.
|
[Tan01] | Till Tantau.
A Note on the Complexity of the Reachability Problem
for Tournaments.
Research Report 01-092, Electronic Colloquium on Computational Complexity,
2001.
|
[Tan02] | Till Tantau.
Comparing Verboseness for Finite Automata and Turing
Machines.
In STACS'02,
Lecture Notes in Computer Science 2285, pages 465-476. Springer-Verlag, March 2002.
|
[Tar55] | Alfred Tarski.
A Lattice-Theoretical Fixpoint Theorem and its
Applications.
Pacific Journal of Mathematics 5(2):285-309. 1955.
|
[Tar72] | Robert Endre Tarjan.
Depth-first search and linear graph algorithms.
SIAM Journal on Computing 1(2):146-160. Society for Industrial and Applied Math., June 1972.
|
[Tar83] | Robert Endre Tarjan. Data structures and network algorithms. CBMS-NSF Regional Conference Series in Applied Mathematics 44. Society for Industrial and Applied Math., 1983. |
[Tau03] | Heikko Tauriainen.
On Translating Linear Temporal Logic into
Alternating and Nondeterministic Automata.
Licentiate thesis,
Helsinki University of Technology, Finland,
2003.
|
[Tau06] | Heikko Tauriainen. Automata and Linear Temporal Logic: Translations with Transition-based Acceptance. Technical Report HUT-TCS-A104, Helsinki University of Technology, Finland, 2006. |
[TD98] | Josef Tapken and
Henning Dierks.
MOBY/PLC – Graphical Development of
PLC-Automata.
In FTRTFT'98,
Lecture Notes in Computer Science 1486, pages 311-314. Springer-Verlag, September 1998.
|
[TD09] | Cong Tian and
Zhenhua Duan.
A Note on Stutter-Invariant PLTL.
Information Processing Letters 109(13):663-667. Elsevier, June 2009.
|
[TvE+87] | Leen Torenvliet and
Peter van Emde Boas.
A Note on Time and Space.
In CSN'87.
SION, November 1987.
|
[TFL10] | Claus Thrane,
Uli Fahrenberg, and
Kim Guldstrand Larsen.
Quantitative Analysis of Weighted Transition
Systems.
Journal of Logic and Algebraic Programming 79(7):689-703. Elsevier, October 2010.
|
[TH00] | Heikko Tauriainen and
Keijo Heljanko.
Testing SPIN's LTL Formula Conversion into
Büchi Automata with Randomly Generated Input.
In SPIN'00,
Lecture Notes in Computer Science 1885, pages 54-72. Springer-Verlag, August 2000.
|
[THH+12] | Takashi Tomita, Shin Hiura, Shigeki Hagihara, and Naoki Yonezaki. A Temporal Logic with Mean-Payoff Constraints. In ICFEM'12, Lecture Notes in Computer Science 7635, pages 249-265. Springer-Verlag, November 2012. |
[Thi15] | Yann Thierry-Mieg. Symbolic Model-Checking Using ITS-Tools. In TACAS'15, Lecture Notes in Computer Science 9035, pages 231-237. Springer-Verlag, April 2015. |
[Tho88] | Wolfgang Thomas. Automata on Infinite Objects. Technical Report AIB-88-17, Aachener Informatik Berichte, Aachen, Germany, October 1988. |
[Tho90] | Wolfgang Thomas. Automata on Infinite Objects. In Jan van Leeuwen (eds.), Handbook of Theoretical Computer Science. Elsevier, 1990. |
[Tho91] | Wolfgang Thomas. On Logics, Tilings, and Automata. In ICALP'91, Lecture Notes in Computer Science 510, pages 441-454. Springer-Verlag, July 1991. |
[Tho95] | Wolfgang Thomas. On the Synthesis of Strategies in Infinite Games. In STACS'95, Lecture Notes in Computer Science 900, pages 1-13. Springer-Verlag, March 1995. |
[Tho96] | Wolfgang Thomas.
Languages, Automata and Logics.
Technical Report 9607, Institut für Informatik und Praktische
Mathematik, Christian-Albrechts-Universität,
Kiel, Germany,
May 1996.
|
[Tho97] | Wolfgang Thomas.
Automata Theory on Tress and Partial Orders.
In TAPSOFT'97,
Lecture Notes in Computer Science 1214, pages 20-38. Springer-Verlag, April 1997.
|
[Tho97] | Wolfgang Thomas.
Languages, Automata and Logics.
In Grzegorz Rozenberg and
Arto Salomaa (eds.),
Handbook of Formal Languages.
Springer-Verlag, 1997.
|
[Tho02] | Wolfgang Thomas.
Infinite Games and Verification (Extended Abstract
of a Tutoral).
In CAV'02,
Lecture Notes in Computer Science 2404, pages 58-64. Springer-Verlag, July 2002.
|
[TM17] | Tamás Tóth and István Majzik. Lazy reachability checking for timed automata using interpolants. In FORMATS'17, Lecture Notes in Computer Science 10419, pages 264-280. Springer-Verlag, September 2017. |
[Too63] | Andrei L. Toom. The complexity of a scheme of functional elements realizing the multiplication of integers. Doklady Akademii Nauk SSSR 150(3):496-498. Russian Academy of Sciences, 1963. |
[TR04] | Prasanna Thati and Grigore Roşu. Monitoring Algorithms for Metric Temporal Logic Specifications. In RV'04, Electronic Notes in Theoretical Computer Science 113, pages 131-147. Elsevier, April 2004. |
[Tra62] | Boris A. Trakhtenbrot.
Finite automata and the logic of one-place
predicates.
Siberskii Matematicheskii Zhurnal 3(1):103-131. Sobolev Institute of Mathematics, 1962.
|
[Tre96] | Jan Tretmans. Test Generation with Inputs, Outputs, and Quiescence. In TACAS'96, Lecture Notes in Computer Science 1055, pages 127-146. Springer-Verlag, March 1996. |
[Tre96] | Jan Tretmans. Conformance Testing with Labelled Transition Systems: Implementation Relations and Test Generation. Computer Networks and ISDN Systems 29(1):49-79. Elsevier, 1996. |
[Tri99] | Stavros Tripakis.
Timed Diagnostics for Reachability Properties.
In TACAS'99,
Lecture Notes in Computer Science 1579, pages 59-73. Springer-Verlag, March 1999.
|
[Tri02] | Stavros Tripakis.
Description and Schedulability Analysis of the
Software Architecture of an Automated Vehicle
Control System.
In EMSOFT'02,
Lecture Notes in Computer Science 2491, pages 123-137. Springer-Verlag, October 2002.
|
[Tri06] | Stavros Tripakis. Folk theorems on the determinization and minimization of timed automata. Information Processing Letters 99(6):222-226. Elsevier, September 2006. |
[Tri09] | Stavros Tripakis. Checking Timed Büchi Automata Emptiness on Simulation Graphs. ACM Transactions on Computational Logic 10(3). ACM Press, April 2009. |
[Tsa03] | Boaz Tsaban.
Bernoulli Numbers and the Probability of a
Birthday Surprise.
Discrete Applied Mathematics 127(1):657-663. Elsevier, April 2003.
|
[Tur37] | Alan M. Turing. On computable numbers, with an application to the Entscheidungsproblem. Proceedings of the London Mathematical Society s2-42(1):230-265. 1937. |
[Tur38] | Alan M. Turing. On computable numbers, with an application to the Entscheidungsproblem. A Correction. Proceedings of the London Mathematical Society s2-43(6):544-546. 1938. |
[TV87] | Frank Thuijsman and Okko J. Vrieze. The bad match; A total reward stochastic game. OR Spektrum 9(2):93-99. 1987. |
[TW96] | Denis Thérien and
Thomas Wilke.
Temporal Logic and Semidirect Products: an Effective
Characterization of the Until Hierarchy.
In FOCS'96,
pages 256-263.
IEEE Comp. Soc. Press, October 1996.
|
[TW98] | Denis Thérien and
Thomas Wilke.
Over Words, Two Variables Are as Powerful as One
Quantifier Alternation: FO2 = Σ2
∩Π2.
In STOC'98,
pages 234-240.
ACM Press, May 1998.
|
[TW02] | Denis Thérien and
Thomas Wilke.
Nesting Until and Since in Linear Temporal Logic.
In STACS'02,
Lecture Notes in Computer Science 2285, pages 455-464. Springer-Verlag, March 2002.
|
[TW02] | P. S. Thiagarajan and
Igor Walukiewicz.
An Expressively Complete Linear Time Temporal Logic
for Mazurkiewicz Traces.
Information and Computation 179(2):230-249. Academic Press, December 2002.
|
[TW12] | Nicolas Troquard and Dirk Walther. On Satisfiability in ATL with Strategy Contexts. In JELIA'12, Lecture Notes in Computer Science 7519, pages 398-410. Springer-Verlag, September 2012. |
[TY01] | Stavros Tripakis and
Sergio Yovine.
Timing Analysis and Code Generation of Vehicle
Control Software using Taxys.
In RV'01,
Electronic Notes in Theoretical Computer Science 55(2), pages 277-286. Elsevier, July 2001.
|
[TY01] | Stavros Tripakis and Sergio Yovine. Analysis of Timed Systems Using Time-Abstracting Bisimulations. Formal Methods in System Design 18(1):25-68. Kluwer Academic, January 2001. |
[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. |
Search
Displayed 47 resultsList of authors
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 2
- 1
- 2
- 1
- 3
- 3
- 1
- 1
- 1
- 8
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 2
- 8
- 1
- 1
- 2
- 1
- 1
- 1
- 1
- 3
- 1
- 3