1994
[ABF94] Amihood Amir, Gary Benson, and Martin Farach. Let Sleeping Files Lie: Pattern Matching in Z-Comporessed Files. In SODA'94, pages 705-714. ACM Press, January 1994. 
@inproceedings{soda1994-ABF,
  author =              {Amir, Amihood and Benson, Gary and Farach, Martin},
  title =               {Let Sleeping Files Lie: Pattern Matching in
                         {Z}-Comporessed Files},
  booktitle =           {{P}roceedings of the 5th {A}nnual {ACM}-{SIAM}
                         {S}ymposium on {D}iscrete {A}lgorithms ({SODA}'94)},
  acronym =             {{SODA}'94},
  publisher =           {ACM Press},
  pages =               {705-714},
  year =                {1994},
  month =               jan,
}
[ACH94] Rajeev Alur, Costas Courcoubetis, and Thomas A. Henzinger. The Observational Power of Clocks. In CONCUR'94, Lecture Notes in Computer Science 836, pages 162-177. Springer-Verlag, August 1994. 
@inproceedings{concur1994-ACH,
  author =              {Alur, Rajeev and Courcoubetis, Costas and Henzinger,
                         Thomas A.},
  title =               {The Observational Power of Clocks},
  editor =              {Jonsson, Bengt and Parrow, Joachim},
  booktitle =           {{P}roceedings of the 5th {I}nternational
                         {C}onference on {C}oncurrency {T}heory
                         ({CONCUR}'94)},
  acronym =             {{CONCUR}'94},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {836},
  pages =               {162-177},
  year =                {1994},
  month =               aug,
}
[AD94] Rajeev Alur and David L. Dill. A Theory of Timed Automata. Theoretical Computer Science 126(2):183-235. Elsevier, April 1994. 
@article{tcs126(2)-AD,
  author =              {Alur, Rajeev and Dill, David L.},
  title =               {A Theory of Timed Automata},
  publisher =           {Elsevier},
  journal =             {Theoretical Computer Science},
  volume =              {126},
  number =              {2},
  pages =               {183-235},
  year =                {1994},
  month =               apr,
}
[AFH94] Rajeev Alur, Limor Fix, and Thomas A. Henzinger. Event-Clock Automata: A Determinizable Class of Timed Automata. In CAV'94, Lecture Notes in Computer Science 818, pages 1-13. Springer-Verlag, June 1994. 
@inproceedings{cav1994-AFH,
  author =              {Alur, Rajeev and Fix, Limor and Henzinger, Thomas
                         A.},
  title =               {Event-Clock Automata: A Determinizable Class of
                         Timed Automata},
  editor =              {Dill, David L.},
  booktitle =           {{P}roceedings of the 6th {I}nternational
                         {C}onference on {C}omputer {A}ided {V}erification
                         ({CAV}'94)},
  acronym =             {{CAV}'94},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {818},
  pages =               {1-13},
  year =                {1994},
  month =               jun,
}
[AH94] Rajeev Alur and Thomas A. Henzinger. A Really Temporal Logic. Journal of the ACM 41(1):181-203. ACM Press, January 1994. 
@article{jacm41(1)-AH,
  author =              {Alur, Rajeev and Henzinger, Thomas A.},
  title =               {A Really Temporal Logic},
  publisher =           {ACM Press},
  journal =             {Journal of the~ACM},
  volume =              {41},
  number =              {1},
  pages =               {181-203},
  year =                {1994},
  month =               jan,
}
[BVW94] Orna Bernholtz, Moshe Y. Vardi, and Pierre Wolper. An Automata-Theoretic Approach to Branching-Time Model Checking (Extended Abstract). In CAV'94, Lecture Notes in Computer Science 818, pages 142-155. Springer-Verlag, June 1994. 
@inproceedings{cav1994-BVW,
  author =              {Bernholtz, Orna and Vardi, Moshe Y. and Wolper,
                         Pierre},
  title =               {An Automata-Theoretic Approach to Branching-Time
                         Model Checking (Extended Abstract)},
  editor =              {Dill, David L.},
  booktitle =           {{P}roceedings of the 6th {I}nternational
                         {C}onference on {C}omputer {A}ided {V}erification
                         ({CAV}'94)},
  acronym =             {{CAV}'94},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {818},
  pages =               {142-155},
  year =                {1994},
  month =               jun,
}
[BW94] Bertil A. Brandin and W. Murray Wonham. Supervisory Control of Timed Discrete-Event Systems. IEEE Transactions on Automatic Control 39(2):329-342. IEEE Comp. Soc. Press, February 1994. 
@article{tac39(2)-BW,
  author =              {Brandin, Bertil A. and Wonham, W. Murray},
  title =               {Supervisory Control of Timed Discrete-Event Systems},
  publisher =           {IEEE Comp. Soc. Press},
  journal =             {IEEE Transactions on Automatic Control},
  volume =              {39},
  number =              {2},
  pages =               {329-342},
  year =                {1994},
  month =               feb,
}
[CC94] Sérgio Vale Aguiar Campos and Edmund M. Clarke. Real-Time Symbolic Model Checking for Discrete Time Models. Technical Report CMU-CS-94-146, Computer Science Deparment, Carnegie Mellon University, Pittsburgh, Pennsylvania, USA, May 1994. 
@techreport{TR-CMU-CS-94-146,
  author =              {Campos, S{\'e}rgio Vale Aguiar and Clarke, Edmund
                         M.},
  title =               {Real-Time Symbolic Model Checking for Discrete Time
                         Models},
  number =              {CMU-CS-94-146},
  year =                {1994},
  month =               may,
  institution =         {Computer Science Deparment, Carnegie Mellon
                         University, Pittsburgh, Pennsylvania, USA},
  type =                {Technical Report},
}
[CCM+94] Sérgio Vale Aguiar Campos, Edmund M. Clarke, Wilfredo R. Marrero, Marius Minea, and Hiromi Hiraishi. Computing Quantitative Characteristics of Finite-State Real-Time Systems. Technical Report CMU-CS-94-147, Computer Science Deparment, Carnegie Mellon University, Pittsburgh, Pennsylvania, USA, May 1994. 
@techreport{TR-CMU-CS-94-147,
  author =              {Campos, S{\'e}rgio Vale Aguiar and Clarke, Edmund M.
                         and Marrero, Wilfredo R. and Minea, Marius and
                         Hiraishi, Hiromi},
  title =               {Computing Quantitative Characteristics of
                         Finite-State Real-Time Systems},
  number =              {CMU-CS-94-147},
  year =                {1994},
  month =               may,
  institution =         {Computer Science Deparment, Carnegie Mellon
                         University, Pittsburgh, Pennsylvania, USA},
  type =                {Technical Report},
}
[CGL94] Edmund M. Clarke, Orna Grumberg, and David E. Long. Model Checking. ACM Transactions on Programming Languages and Systems 16(5):1-45. ACM Press, September 1994. 
@article{toplas16(5)-CGL,
  author =              {Clarke, Edmund M. and Grumberg, Orna and Long, David
                         E.},
  title =               {Model Checking},
  publisher =           {ACM Press},
  journal =             {ACM Transactions on Programming Languages and
                         Systems},
  volume =              {16},
  number =              {5},
  pages =               {1-45},
  year =                {1994},
  month =               sep,
}
[Clo94] Peter Clote. Computation Models and Function Algebras. In LCC'94, Lecture Notes in Computer Science 960, pages 98-130. Springer-Verlag, October 1994. 
@inproceedings{lcc1994-Clo,
  author =              {Clote, Peter},
  title =               {Computation Models and Function Algebras},
  editor =              {Leivant, Daniel},
  booktitle =           {{P}roceedings of the 1st {I}nternational {W}orkshop
                         on {L}ogic and {C}omputation {C}omplexity
                         ({LCC}'94)},
  acronym =             {{LCC}'94},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {960},
  pages =               {98-130},
  year =                {1994},
  month =               oct,
}
[Dam94] Mads Dam. Temporal Logic, Automata and Classical Theories. In ESSLLI'94. August 1994. 
@inproceedings{esslli1994-Dam,
  author =              {Dam, Mads},
  title =               {Temporal Logic, Automata and Classical Theories},
  booktitle =           {{P}roceedings of the 6th {E}uropean {S}ummer
                         {S}chool in {L}ogic, {L}anguage and {I}nformation
                         ({ESSLLI}'94)},
  acronym =             {{ESSLLI}'94},
  year =                {1994},
  month =               aug,
}
[Dam94] Dennis René Dams. CTL* and ECTL* as fragments of the modal μ-calculus. Theoretical Computer Science 126(1):77-96. Elsevier, April 1994. 
@article{tcs126(1)-Dam,
  author =              {Dams, Dennis Ren{\'e}},
  title =               {{CTL{\textsuperscript{*}}} and
                         {ECTL{\textsuperscript{*}}} as fragments of the
                         modal {{\(\mu\)}}-calculus},
  publisher =           {Elsevier},
  journal =             {Theoretical Computer Science},
  volume =              {126},
  number =              {1},
  pages =               {77-96},
  year =                {1994},
  month =               apr,
}
[De94] Sergio De Agostino. P-complete problems in data compression. Theoretical Computer Science 127(1):181-186. Elsevier, May 1994. 
@article{tcs127(1)-Dea,
  author =              {De{~}Agostino, Sergio},
  title =               {{P}-complete problems in data compression},
  publisher =           {Elsevier},
  journal =             {Theoretical Computer Science},
  volume =              {127},
  number =              {1},
  pages =               {181-186},
  year =                {1994},
  month =               may,
}
[DL94] Giuseppe De Giacomo and Maurizio Lenzerini. Concept Language with Number Restrictions and Fixpoints, and its Relationship with Mu-Calculus. In ECAI'94, pages 411-415. John Wiley & Sons, August 1994. 
@inproceedings{ecai1994-DGL,
  author =              {De{~}Giacomo, Giuseppe and Lenzerini, Maurizio},
  title =               {Concept Language with Number Restrictions and
                         Fixpoints, and its Relationship with Mu-Calculus},
  editor =              {Cohn, Anthony G.},
  booktitle =           {{P}roceedings of the 11th {E}uropean {C}onference on
                         {A}rtificial {I}ntelligence ({ECAI}'94)},
  acronym =             {{ECAI}'94},
  publisher =           {John Wiley \& Sons},
  pages =               {411-415},
  year =                {1994},
  month =               aug,
}
[EN94] Javier Esparza and Mogens Nielsen. Decidability Issues for Petri Nets – A survey. EATCS Bulletin 52:244-262. EATCS, February 1994. 
@article{EN94,
  author =              {Esparza, Javier and Nielsen, Mogens},
  title =               {Decidability Issues for {P}etri Nets~-- A~survey},
  publisher =           {EATCS},
  journal =             {EATCS Bulletin},
  volume =              {52},
  pages =               {244-262},
  year =                {1994},
  month =               feb,
}
[GHR94] Raymond Greenlaw, H. James Hoover, and Walter L. Ruzzo. Combinatorial Optimization. . Oxford University Press, 1994. 
@incollection{GHR-appA4,
  author =              {Greenlaw, Raymond and Hoover, H. James and Ruzzo,
                         Walter L.},
  title =               {Combinatorial Optimization},
  publisher =           {Oxford University Press},
  chapter =             {A.4},
  year =                {1994},
}
[GS94] Roberto Gorrieri and Glauco Siliprandi. Real-time System Verification using P/T Nets. In CAV'94, Lecture Notes in Computer Science 818, pages 14-26. Springer-Verlag, June 1994. 
@inproceedings{cav1994-GS,
  author =              {Gorrieri, Roberto and Siliprandi, Glauco},
  title =               {Real-time System Verification using {P/T} Nets},
  editor =              {Dill, David L.},
  booktitle =           {{P}roceedings of the 6th {I}nternational
                         {C}onference on {C}omputer {A}ided {V}erification
                         ({CAV}'94)},
  acronym =             {{CAV}'94},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {818},
  pages =               {14-26},
  year =                {1994},
  month =               jun,
}
[HK94] Joseph Y. Halpern and Bruce M. Kapron. Zero-one laws for modal logic. Annals of Pure and Applied Logic 69(2-3):157-193. Elsevier, October 1994. 
@article{apal69(2-3)-HK,
  author =              {Halpern, Joseph Y. and Kapron, Bruce M.},
  title =               {Zero-one laws for modal logic},
  publisher =           {Elsevier},
  journal =             {Annals of Pure and Applied Logic},
  volume =              {69},
  number =              {2-3},
  pages =               {157-193},
  year =                {1994},
  month =               oct,
}
[HMP94] Thomas A. Henzinger, Zohar Manna, and Amir Pnueli. Temporal Proof Methodologies for Timed Transition Systems. Information and Computation 112(2):273-337. Academic Press, August 1994. 
@article{icomp112(2)-HMP,
  author =              {Henzinger, Thomas A. and Manna, Zohar and Pnueli,
                         Amir},
  title =               {Temporal Proof Methodologies for Timed Transition
                         Systems},
  publisher =           {Academic Press},
  journal =             {Information and Computation},
  volume =              {112},
  number =              {2},
  pages =               {273-337},
  year =                {1994},
  month =               aug,
}
[HNS+94] Thomas A. Henzinger, Xavier Nicollin, Joseph Sifakis, and Sergio Yovine. Symbolic Model Checking for Real Time Systems. Information and Computation 111(2):193-244. Academic Press, June 1994. 
@article{icomp111(2)-HNSY,
  author =              {Henzinger, Thomas A. and Nicollin, Xavier and
                         Sifakis, Joseph and Yovine, Sergio},
  title =               {Symbolic Model Checking for Real Time Systems},
  publisher =           {Academic Press},
  journal =             {Information and Computation},
  volume =              {111},
  number =              {2},
  pages =               {193-244},
  year =                {1994},
  month =               jun,
}
[Kam94] Michael Kaminski. A branching time logic with past operators. Journal of Computer and System Sciences 49(2):223-246. Academic Press, October 1994. 
@article{jcss49(2)-Kam,
  author =              {Kaminski, Michael},
  title =               {A branching time logic with past operators},
  publisher =           {Academic Press},
  journal =             {Journal of Computer and System Sciences},
  volume =              {49},
  number =              {2},
  pages =               {223-246},
  year =                {1994},
  month =               oct,
}
[KHM+94] Arjun Kapur, Thomas A. Henzinger, Zohar Manna, and Amir Pnueli. Proving Safety Properties of Hybrid Systems. In FTRTFT'94, Lecture Notes in Computer Science 863, pages 431-454. Springer-Verlag, September 1994. 
@inproceedings{ftrtft1994-KHMP,
  author =              {Kapur, Arjun and Henzinger, Thomas A. and Manna,
                         Zohar and Pnueli, Amir},
  title =               {Proving Safety Properties of Hybrid Systems},
  editor =              {Langmaack, Hans and de Roever, Willem-Paul and
                         Vytopil, Jan},
  booktitle =           {{P}roceedings of the 3rd {F}ormal {T}echniques in
                         {R}eal-Time and {F}ault-Tolerant {S}ystems
                         ({FTRTFT}'94)},
  acronym =             {{FTRTFT}'94},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {863},
  pages =               {431-454},
  year =                {1994},
  month =               sep,
}
[Klo94] Ton Kloks. Treewidth, Computations and Approximations. Lecture Notes in Computer Science 842. Springer-Verlag, 1994. 
@book{twca1994-Klo,
  author =              {Kloks, Ton},
  title =               {Treewidth, Computations and Approximations},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {842},
  year =                {1994},
  doi =                 {10.1007/BFb0045375},
}
[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. 
@phdthesis{phd-laroussinie,
  author =              {Laroussinie, Fran{\c c}ois},
  title =               {Logiques temporelles avec pass{\'e} pour la
                         sp{\'e}cification et la v{\'e}rification des
                         syst{\`e}mes r{\'e}actifs},
  year =                {1994},
  school =              {INPG},
  type =                {Th\`ese de doctorat},
}
[LS94] François Laroussinie and Philippe Schnoebelen. A Hierarchy of Temporal Logics with Past. In STACS'94, Lecture Notes in Computer Science 775, pages 47-58. Springer-Verlag, February 1994. 
@inproceedings{stacs1994-LS,
  author =              {Laroussinie, Fran{\c c}ois and Schnoebelen, {\relax
                         Ph}ilippe},
  title =               {A Hierarchy of Temporal Logics with Past},
  editor =              {Enjalbert, Patrice and Mayr, Ernst W. and Wagner,
                         Klaus W.},
  booktitle =           {{P}roceedings of the 11th {S}ymposium on
                         {T}heoretical {A}spects of {C}omputer {S}cience
                         ({STACS}'94)},
  acronym =             {{STACS}'94},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {775},
  pages =               {47-58},
  year =                {1994},
  month =               feb,
}
[LY94] Kim Guldstrand Larsen and Wang Yi. Time Abstracted Bisimiulation: Implicit Specifications and Decidability. In MFPS'93, Lecture Notes in Computer Science 802, pages 160-176. Springer-Verlag, 1994. 
@inproceedings{mfps1993-LY,
  author =              {Larsen, Kim Guldstrand and Yi, Wang},
  title =               {Time Abstracted Bisimiulation: Implicit
                         Specifications and Decidability},
  editor =              {Brookes, Setphen D. and Main, Michael G. and Melton,
                         Austin and Mislove, Michael W. and Schmidt, David
                         A.},
  booktitle =           {{P}roceedings of the 9th {I}nternational
                         {C}onference on {M}athematical {F}oundations of
                         {P}rogramming {S}emantics ({MFPS}'93)},
  acronym =             {{MFPS}'93},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {802},
  pages =               {160-176},
  year =                {1994},
  confyear =            {1993},
  confmonth =           {4},
}
[MMK+94] Louise E. Moser, P. Michael Melliar-Smith, George Kutty, and Y. Srinivas Ramakrishna. Completeness and Soundness of Axiomatizations for Temporal Logics without Next. Fundamenta Informaticae 21(4):257-305. IOS Press, October 1994. 
@article{fundi21(4)-MMKR,
  author =              {Moser, Louise E. and Melliar{-}Smith, P. Michael and
                         Kutty, George and Ramakrishna, Y. Srinivas},
  title =               {Completeness and Soundness of Axiomatizations for
                         Temporal Logics without Next},
  publisher =           {IOS Press},
  journal =             {Fundamenta Informaticae},
  volume =              {21},
  number =              {4},
  pages =               {257-305},
  year =                {1994},
  month =               oct,
}
[Nis94] Noam Nisan. RL ⊆SC. Computational Complexity 4:1-11. Birkhäuser, 1994. 
@article{cc4()-Nis,
  author =              {Nisan, Noam},
  title =               {\(RL \subseteq SC\)},
  publisher =           {Birkh{\"a}user},
  journal =             {Computational Complexity},
  volume =              {4},
  pages =               {1-11},
  year =                {1994},
}
[OR94] Martin J. Osborne and Ariel Rubinstein. A Course in Game Theory. MIT Press, 1994. 
@book{cgt-OR94,
  author =              {Osborne, Martin J. and Rubinstein, Ariel},
  title =               {A Course in Game Theory},
  publisher =           {MIT Press},
  year =                {1994},
}
[Pap94] Christos H. Papadimitriou. On the Complexity of the Parity Argument and Other Inefficient Proofs of Existence. Journal of Computer and System Sciences 48(3):498-532. Academic Press, June 1994. 
@article{jcss48(3)-Pap,
  author =              {Papadimitriou, {\relax Ch}ristos H.},
  title =               {On the Complexity of the Parity Argument and Other
                         Inefficient Proofs of Existence},
  publisher =           {Academic Press},
  journal =             {Journal of Computer and System Sciences},
  volume =              {48},
  number =              {3},
  pages =               {498-532},
  year =                {1994},
  month =               jun,
  doi =                 {10.1016/S0022-0000(05)80063-7},
}
[Pap94] Christos H. Papadimitriou. Computational Complexity. Addison-Wesley, 1994. 
@book{Pap-compcomp94,
  author =              {Papadimitriou, {\relax Ch}ristos H.},
  title =               {Computational Complexity},
  publisher =           {Addison-Wesley},
  year =                {1994},
}
[Var94] Moshe Y. Vardi. Nontraditional Applications of Automata Theory. In TACS'94, Lecture Notes in Computer Science 789, pages 575-597. Springer-Verlag, April 1994. 
@inproceedings{tacs1994-Var,
  author =              {Vardi, Moshe Y.},
  title =               {Nontraditional Applications of Automata Theory},
  editor =              {Hagiya, Masami and Mitchell, John C.},
  booktitle =           {{P}roceedings of the 2nd {I}nternational {S}ymposium
                         on {T}heoretical {A}spects of {C}omputer {S}oftware
                         ({TACS}'94)},
  acronym =             {{TACS}'94},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {789},
  pages =               {575-597},
  year =                {1994},
  month =               apr,
}
[VW94] Moshe Y. Vardi and Pierre Wolper. Reasoning about Infinite Computations. Information and Computation 115(1):1-37. Academic Press, November 1994. 
@article{icomp115(1)-VW,
  author =              {Vardi, Moshe Y. and Wolper, Pierre},
  title =               {Reasoning about Infinite Computations},
  publisher =           {Academic Press},
  journal =             {Information and Computation},
  volume =              {115},
  number =              {1},
  pages =               {1-37},
  year =                {1994},
  month =               nov,
}
[Wil94] Thomas Wilke. Specifying Timed State Sequence in Powerful Decidable Logics and Timed Automata (Extended Abstract). In FTRTFT'94, Lecture Notes in Computer Science 863, pages 694-715. Springer-Verlag, September 1994. 
@inproceedings{ftrtft1994-Wil,
  author =              {Wilke, Thomas},
  title =               {Specifying Timed State Sequence in Powerful
                         Decidable Logics and Timed Automata (Extended
                         Abstract)},
  editor =              {Langmaack, Hans and de Roever, Willem-Paul and
                         Vytopil, Jan},
  booktitle =           {{P}roceedings of the 3rd {F}ormal {T}echniques in
                         {R}eal-Time and {F}ault-Tolerant {S}ystems
                         ({FTRTFT}'94)},
  acronym =             {{FTRTFT}'94},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {863},
  pages =               {694-715},
  year =                {1994},
  month =               sep,
}
List of authors