1998
[AHK98] Rajeev Alur, Thomas A. Henzinger, and Orna Kupferman. Alternating-time Temporal Logic. In COMPOS'97, Lecture Notes in Computer Science 1536, pages 23-60. Springer-Verlag, 1998. 
@inproceedings{compos1997-AHK,
  author =              {Alur, Rajeev and Henzinger, Thomas A. and Kupferman,
                         Orna},
  title =               {Alternating-time Temporal Logic},
  editor =              {de Roever, Willem-Paul and Langmaack, Hans and
                         Pnueli, Amir},
  booktitle =           {{R}evised {L}ectures of the 1st {I}nternational
                         {S}ymposium on {C}ompositionality: {T}he
                         {S}ignificant {D}ifference ({COMPOS}'97)},
  acronym =             {{COMPOS}'97},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {1536},
  pages =               {23-60},
  year =                {1998},
  confyear =            {1997},
  confmonth =           {9},
}
[dAH+98] Luca de Alfaro, Thomas A. Henzinger, and Orna Kupferman. Concurrent Reachability Games. In FOCS'98, pages 564-575. IEEE Comp. Soc. Press, November 1998. 
@inproceedings{focs1998-AHK,
  author =              {de Alfaro, Luca and Henzinger, Thomas A. and
                         Kupferman, Orna},
  title =               {Concurrent Reachability Games},
  booktitle =           {{P}roceedings of the 39th {A}nnual {S}ymposium on
                         {F}oundations of {C}omputer {S}cience ({FOCS}'98)},
  acronym =             {{FOCS}'98},
  publisher =           {IEEE Comp. Soc. Press},
  pages =               {564-575},
  year =                {1998},
  month =               nov,
}
[AHK+98] Rajeev Alur, Thomas A. Henzinger, Orna Kupferman, and Moshe Y. Vardi. Alternating Refinement Relations. In CONCUR'98, Lecture Notes in Computer Science 1466, pages 163-178. Springer-Verlag, September 1998. 
@inproceedings{concur1998-AHKV,
  author =              {Alur, Rajeev and Henzinger, Thomas A. and Kupferman,
                         Orna and Vardi, Moshe Y.},
  title =               {Alternating Refinement Relations},
  editor =              {Sangiorgi, Davide and de Simone, Robert},
  booktitle =           {{P}roceedings of the 9th {I}nternational
                         {C}onference on {C}oncurrency {T}heory
                         ({CONCUR}'98)},
  acronym =             {{CONCUR}'98},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {1466},
  pages =               {163-178},
  year =                {1998},
  month =               sep,
}
[AHM+98] Rajeev Alur, Thomas A. Henzinger, Freddy Y. C. Mang, Shaz Qadeer, Sriram Rajamani, and Serdar Taşiran. MOCHA: Modularity in Model Checking. In CAV'98, Lecture Notes in Computer Science 1427, pages 521-525. Springer-Verlag, June 1998. 
@inproceedings{cav1998-AHMQRT,
  author =              {Alur, Rajeev and Henzinger, Thomas A. and Mang,
                         Freddy Y. C. and Qadeer, Shaz and Rajamani, Sriram
                         and Ta{\c s}iran, Serdar},
  title =               {{MOCHA}: Modularity in Model Checking},
  editor =              {Hu, Alan J. and Vardi, Moshe Y.},
  booktitle =           {{P}roceedings of the 10th {I}nternational
                         {C}onference on {C}omputer {A}ided {V}erification
                         ({CAV}'98)},
  acronym =             {{CAV}'98},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {1427},
  pages =               {521-525},
  year =                {1998},
  month =               jun,
}
[AKV98] Rajeev Alur, Robert P. Kurshan, and Mahesh Viswanathan. Membership Question for Timed and Hybrid Automata. In RTSS'98, pages 254-263. IEEE Comp. Soc. Press, December 1998. 
@inproceedings{rts1998-AKV,
  author =              {Alur, Rajeev and Kurshan, Robert P. and Viswanathan,
                         Mahesh},
  title =               {Membership Question for Timed and Hybrid Automata},
  booktitle =           {{P}roceedings of the 19th {S}ymposium on {R}eal-Time
                         {S}ystems ({RTSS}'98)},
  acronym =             {{RTSS}'98},
  publisher =           {IEEE Comp. Soc. Press},
  pages =               {254-263},
  year =                {1998},
  month =               dec,
}
[ALR98] Eric Allender, Michael C. Loui, and Kenneth W. Regan. Complexity Classes. In Mikhail J. Atallah (eds.), Handbook of Algorithms and Theory of Computation. CRC Press, November 1998. 
@incollection{hatc1998-ALRa,
  author =              {Allender, Eric and Loui, Michael C. and Regan,
                         Kenneth W.},
  title =               {Complexity Classes},
  editor =              {Atallah, Mikhail J.},
  booktitle =           {Handbook of Algorithms and Theory of Computation},
  publisher =           {CRC Press},
  pages =               {27.1-27.23},
  year =                {1998},
  month =               nov,
}
[ALR98] Eric Allender, Michael C. Loui, and Kenneth W. Regan. Reducibility and Completeness. In Mikhail J. Atallah (eds.), Handbook of Algorithms and Theory of Computation. CRC Press, November 1998. 
@incollection{hatc1998-ALRb,
  author =              {Allender, Eric and Loui, Michael C. and Regan,
                         Kenneth W.},
  title =               {Reducibility and Completeness},
  editor =              {Atallah, Mikhail J.},
  booktitle =           {Handbook of Algorithms and Theory of Computation},
  publisher =           {CRC Press},
  pages =               {28.1-28.28},
  year =                {1998},
  month =               nov,
}
[ALR98] Eric Allender, Michael C. Loui, and Kenneth W. Regan. Other Complexity Classes and Measures. In Mikhail J. Atallah (eds.), Handbook of Algorithms and Theory of Computation. CRC Press, November 1998. 
@incollection{hatc1998-ALRc,
  author =              {Allender, Eric and Loui, Michael C. and Regan,
                         Kenneth W.},
  title =               {Other Complexity Classes and Measures},
  editor =              {Atallah, Mikhail J.},
  booktitle =           {Handbook of Algorithms and Theory of Computation},
  publisher =           {CRC Press},
  pages =               {29.1-29.24},
  year =                {1998},
  month =               nov,
}
[AMP98] Eugene Asarin, Oded Maler, and Amir Pnueli. On Discretization of Delays in Timed Automata and Digital Circuits. In CONCUR'98, Lecture Notes in Computer Science 1466, pages 470-484. Springer-Verlag, September 1998. 
@inproceedings{concur1998-AMP,
  author =              {Asarin, Eugene and Maler, Oded and Pnueli, Amir},
  title =               {On Discretization of Delays in Timed Automata and
                         Digital Circuits},
  editor =              {Sangiorgi, Davide and de Simone, Robert},
  booktitle =           {{P}roceedings of the 9th {I}nternational
                         {C}onference on {C}oncurrency {T}heory
                         ({CONCUR}'98)},
  acronym =             {{CONCUR}'98},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {1466},
  pages =               {470-484},
  year =                {1998},
  month =               sep,
}
[AMP+98] Eugene Asarin, Oded Maler, Amir Pnueli, and Joseph Sifakis. Controller Synthesis for Timed Automata. In SSC'98, pages 469-474. Elsevier, July 1998. 
@inproceedings{sssc1998-AMPS,
  author =              {Asarin, Eugene and Maler, Oded and Pnueli, Amir and
                         Sifakis, Joseph},
  title =               {Controller Synthesis for Timed Automata},
  booktitle =           {{P}roceedings of the 5th {IFAC} {C}conference on
                         {S}ystem {S}tructure and {C}ontrol ({SSC}'98)},
  acronym =             {{SSC}'98},
  publisher =           {Elsevier},
  pages =               {469-474},
  year =                {1998},
  month =               jul,
}
[BCC98] Sergey Berezin, Sérgio Vale Aguiar Campos, and Edmund M. Clarke. Compositional Reasoning in Model Checking. In COMPOS'97, Lecture Notes in Computer Science 1536, pages 81-102. Springer-Verlag, 1998. 
@inproceedings{compos1997-BCC,
  author =              {Berezin, Sergey and Campos, S{\'e}rgio Vale Aguiar
                         and Clarke, Edmund M.},
  title =               {Compositional Reasoning in Model Checking},
  editor =              {de Roever, Willem-Paul and Langmaack, Hans and
                         Pnueli, Amir},
  booktitle =           {{R}evised {L}ectures of the 1st {I}nternational
                         {S}ymposium on {C}ompositionality: {T}he
                         {S}ignificant {D}ifference ({COMPOS}'97)},
  acronym =             {{COMPOS}'97},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {1536},
  pages =               {81-102},
  year =                {1998},
  confyear =            {1997},
  confmonth =           {9},
}
[BCE+98] Jean-Jacques Borrelly, Ève Costemaniere, Bernard Espiau, Konstantinos Kapellos, Roger Pissard-Gibollet, Daniel Simon, and Nicolas Turro. The ORCCAD Architecture. International Journal of Robotics Research 17(4):338-359. April 1998. 
@article{ijrr17(4)-BCEKPST,
  author =              {Borrelly, Jean-Jacques and Costemaniere, {\`E}ve and
                         Espiau, Bernard and Kapellos, Konstantinos and
                         Pissard{-}Gibollet, Roger and Simon, Daniel and
                         Turro, Nicolas},
  title =               {The {ORCCAD} Architecture},
  journal =             {International Journal of Robotics Research},
  volume =              {17},
  number =              {4},
  pages =               {338-359},
  year =                {1998},
  month =               apr,
}
[BDG+98] Béatrice Bérard, Volker Diekert, Paul Gastin, and Antoine Petit. Characterization of the Expressive Power of Silent Transitions in Timed Automata. Fundamenta Informaticae 36(2-3):145-182. IOS Press, November 1998. 
@article{fundi36(2-3)-BDGP,
  author =              {B{\'e}rard, B{\'e}atrice and Diekert, Volker and
                         Gastin, Paul and Petit, Antoine},
  title =               {Characterization of the Expressive Power of Silent
                         Transitions in Timed Automata},
  publisher =           {IOS Press},
  journal =             {Fundamenta Informaticae},
  volume =              {36},
  number =              {2-3},
  pages =               {145-182},
  year =                {1998},
  month =               nov,
}
[BJL+98] Johan Bengtsson, Bengt Jonsson, Johan Lilius, and Wang Yi. Partial-Order Reductions for Timed Systems. In CONCUR'98, Lecture Notes in Computer Science 1466, pages 485-500. Springer-Verlag, September 1998. 
@inproceedings{concur1998-BJLY,
  author =              {Bengtsson, Johan and Jonsson, Bengt and Lilius,
                         Johan and Yi, Wang},
  title =               {Partial-Order Reductions for Timed Systems},
  editor =              {Sangiorgi, Davide and de Simone, Robert},
  booktitle =           {{P}roceedings of the 9th {I}nternational
                         {C}onference on {C}oncurrency {T}heory
                         ({CONCUR}'98)},
  acronym =             {{CONCUR}'98},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {1466},
  pages =               {485-500},
  year =                {1998},
  month =               sep,
  doi =                 {10.1007/BFb0055643},
}
[BLP+98] Gerd Behrmann, Kim Guldstrand Larsen, Justin Pearson, Carsten Weise, and Wang Yi. Efficient Timed Reachability Analysis using Clock Difference Diagrams. Research Report RS-98-47, Basic Research in Computer Science, Aalborg University, Denmark, December 1998. 
@techreport{TR-brics9847,
  author =              {Behrmann, Gerd and Larsen, Kim Guldstrand and
                         Pearson, Justin and Weise, Carsten and Yi, Wang},
  title =               {Efficient Timed Reachability Analysis using Clock
                         Difference Diagrams},
  number =              {RS-98-47},
  year =                {1998},
  month =               dec,
  institution =         {Basic Research in Computer Science, Aalborg
                         University, Denmark},
  type =                {Research Report},
}
[Bou98] Patricia Bouyer. Automates temporisés et modularité. Mémoire de D.E.A., Lab. Spécification & Vérification, ENS Cachan, France, June 1998. 
@mastersthesis{dea-Bouyer,
  author =              {Bouyer, Patricia},
  title =               {Automates temporis{\'e}s et modularit{\'e}},
  year =                {1998},
  month =               jun,
  school =              {Lab.~Sp\'ecification \& V\'erification, ENS Cachan,
                         France},
  type =                {M\'emoire de D.E.A.},
}
[Bra98] Julian C. Bradfield. The Modal Mu-Calculus Alternation Hierarchy is Strict. Theoretical Computer Science 195(2):133-153. Elsevier, March 1998. 
@article{tcs195(2)-Bra,
  author =              {Bradfield, Julian C.},
  title =               {The Modal Mu-Calculus Alternation Hierarchy is
                         Strict},
  publisher =           {Elsevier},
  journal =             {Theoretical Computer Science},
  volume =              {195},
  number =              {2},
  pages =               {133-153},
  year =                {1998},
  month =               mar,
}
[BS98] Patrick Blackburn and Jerry Seligman. What are Hybrid Languages?. In AIML'96, pages 41-62. CSLI Publications, 1998. 
@inproceedings{aiml1996-BS,
  author =              {Blackburn, Patrick and Seligman, Jerry},
  title =               {What are Hybrid Languages?},
  editor =              {Kracht, Marcus and de Rijke, Marteen and Wansing,
                         Heinrich and Zakharyaschev, Michael},
  booktitle =           {{P}roceedings of the 1st {W}orkshop on {A}dvances in
                         {M}odal {L}ogic ({AIML}'96)},
  acronym =             {{AIML}'96},
  publisher =           {CSLI Publications},
  pages =               {41-62},
  year =                {1998},
  confyear =            {1996},
  confmonth =           {10},
}
[BST98] Sébastien Bornot, Joseph Sifakis, and Stavros Tripakis. Modeling Urgency in Timed Systems. In COMPOS'97, Lecture Notes in Computer Science 1536, pages 103-129. Springer-Verlag, 1998. 
@inproceedings{compos1997-BST,
  author =              {Bornot, S{\'e}bastien and Sifakis, Joseph and
                         Tripakis, Stavros},
  title =               {Modeling Urgency in Timed Systems},
  editor =              {de Roever, Willem-Paul and Langmaack, Hans and
                         Pnueli, Amir},
  booktitle =           {{R}evised {L}ectures of the 1st {I}nternational
                         {S}ymposium on {C}ompositionality: {T}he
                         {S}ignificant {D}ifference ({COMPOS}'97)},
  acronym =             {{COMPOS}'97},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {1536},
  pages =               {103-129},
  year =                {1998},
  confyear =            {1997},
  confmonth =           {9},
}
[BST98] Paul Beame, Michael Saks, and Jayram S. Thathachar. Time-Space Tradeoffs for Branching Programs. Research Report 98-053, Electronic Colloquium on Computational Complexity, September 1998. 
@techreport{eccc1998-BST,
  author =              {Beame, Paul and Saks, Michael and Thathachar, Jayram
                         S.},
  title =               {Time-Space Tradeoffs for Branching Programs},
  number =              {98-053},
  year =                {1998},
  month =               sep,
  institution =         {Electronic Colloquium on Computational Complexity},
  type =                {Research Report},
}
[CEJ+98] Edmund M. Clarke, E. Allen Emerson, Somesh Jha, and A. Prasad Sistla. Symmetry Reductions in Model Checking. In CAV'98, Lecture Notes in Computer Science 1427, pages 147-158. Springer-Verlag, June 1998. 
@inproceedings{cav1998-CEJS,
  author =              {Clarke, Edmund M. and Emerson, E. Allen and Jha,
                         Somesh and Sistla, A. Prasad},
  title =               {Symmetry Reductions in Model Checking},
  editor =              {Hu, Alan J. and Vardi, Moshe Y.},
  booktitle =           {{P}roceedings of the 10th {I}nternational
                         {C}onference on {C}omputer {A}ided {V}erification
                         ({CAV}'98)},
  acronym =             {{CAV}'98},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {1427},
  pages =               {147-158},
  year =                {1998},
  month =               jun,
  doi =                 {10.1007/BFb0028741},
}
[CGS98] Marco Cadoli, Andrea Giovanardi, and Marco Schaerf. An Algorithm to Evaluate Quantified Boolean Formulae. In AAAI-IAAI'98, pages 262-267. MIT Press, July 1998. 
@inproceedings{aaai-iaai1998-CGS,
  author =              {Cadoli, Marco and Giovanardi, Andrea and Schaerf,
                         Marco},
  title =               {An Algorithm to Evaluate Quantified Boolean
                         Formulae},
  booktitle =           {{P}roceedings of the 15th {N}ational {C}onference on
                         {A}rtificial {I}ntelligence ({AAAI}'98) and 10th
                         {I}nnovative {A}pplications of {A}rtificial
                         {I}ntelligence {C}onference ({IAAI}'98)},
  acronym =             {{AAAI-IAAI}'98},
  publisher =           {MIT Press},
  pages =               {262-267},
  year =                {1998},
  month =               jul,
}
[CJ98] Hubert Comon and Yan Jurski. Multiple counters automata, safety analysis, and Presburger arithmetic. In CAV'98, Lecture Notes in Computer Science 1427, pages 268-279. Springer-Verlag, June 1998. 
@inproceedings{cav1998-CJ,
  author =              {Comon, Hubert and Jurski, Yan},
  title =               {Multiple counters automata, safety analysis, and
                         {P}resburger arithmetic},
  editor =              {Hu, Alan J. and Vardi, Moshe Y.},
  booktitle =           {{P}roceedings of the 10th {I}nternational
                         {C}onference on {C}omputer {A}ided {V}erification
                         ({CAV}'98)},
  acronym =             {{CAV}'98},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {1427},
  pages =               {268-279},
  year =                {1998},
  month =               jun,
  doi =                 {10.1007/BFb0028751},
}
[CKL98] Richard Castanet, Ousmane Koné, and Patrice Laurençot. On-the-fly Test Generation for Real Time Protocols. In ICCCN'98, pages 378-387. IEEE Comp. Soc. Press, October 1998. 
@inproceedings{CKL-icccn1998,
  author =              {Castanet, Richard and Kon{\'e}, Ousmane and
                         Lauren{\c{c}}ot, Patrice},
  title =               {On-the-fly Test Generation for Real Time Protocols},
  booktitle =           {{P}roceedings of the {I}nternational {C}onference On
                         {C}omputer {C}ommunications and {N}etworks
                         ({ICCCN}'98)},
  acronym =             {{ICCCN}'98},
  publisher =           {IEEE Comp. Soc. Press},
  pages =               {378-387},
  year =                {1998},
  month =               oct,
  doi =                 {10.1109/ICCCN.1998.998798},
}
[COG98] Rachel Cardell-Oliver and Tim Glover. A Practical and Complete Algorithm for Testing Real-Time Systems. In FTRTFT'98, Lecture Notes in Computer Science 1486, pages 251-261. Springer-Verlag, September 1998. 
@inproceedings{COG-ftrtft1998,
  author =              {Cardell-Oliver, Rachel and Glover, Tim},
  title =               {A~Practical and Complete Algorithm for Testing
                         Real-Time Systems},
  editor =              {Ravn, Anders P. and Rischel, Hans},
  booktitle =           {{P}roceedings of the 5th {F}ormal {T}echniques in
                         {R}eal-Time and {F}ault-Tolerant {S}ystems
                         ({FTRTFT}'98)},
  acronym =             {{FTRTFT}'98},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {1486},
  pages =               {251-261},
  year =                {1998},
  month =               sep,
  doi =                 {10.1007/BFb0055352},
}
[Cov98] Thomas M. Cover. Comments on Broadcast Channels. IEEE Transactions on Information Theory 44(6):2524-2530. IEEE Inf. Theory Soc., October 1998. 
@article{tit44(6)-Cov,
  author =              {Cover, Thomas M.},
  title =               {Comments on Broadcast Channels},
  publisher =           {IEEE Inf. Theory Soc.},
  journal =             {IEEE Transactions on Information Theory},
  volume =              {44},
  number =              {6},
  pages =               {2524-2530},
  year =                {1998},
  month =               oct,
  doi =                 {10.1109/18.720547},
}
[DS98] Stéphane Demri and Philippe Schnoebelen. The Complexity of Propositional Linear Temporal Logics in Simple Cases (extended abstract). In STACS'98, Lecture Notes in Computer Science 1373, pages 61-72. Springer-Verlag, February 1998. 
@inproceedings{stacs1998-DS,
  author =              {Demri, St{\'e}phane and Schnoebelen, {\relax
                         Ph}ilippe},
  title =               {The Complexity of Propositional Linear Temporal
                         Logics in Simple Cases (extended abstract)},
  editor =              {Morvan, Michel and Meinel, {\relax Ch}ristoph and
                         Krob, Daniel},
  booktitle =           {{P}roceedings of the 15th {S}ymposium on
                         {T}heoretical {A}spects of {C}omputer {S}cience
                         ({STACS}'98)},
  acronym =             {{STACS}'98},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {1373},
  pages =               {61-72},
  year =                {1998},
  month =               feb,
}
[DT98] Conrado Daws and Stavros Tripakis. Model Checking of Real-Time Reachability Properties Using Abstractions. In TACAS'98, Lecture Notes in Computer Science 1384, pages 313-329. Springer-Verlag, March 1998. 
@inproceedings{tacas1998-DT,
  author =              {Daws, Conrado and Tripakis, Stavros},
  title =               {Model Checking of Real-Time Reachability Properties
                         Using Abstractions},
  editor =              {Steffen, Bernhard},
  booktitle =           {{P}roceedings of the 4th {I}nternational
                         {C}onference on {T}ools and {A}lgorithms for
                         {C}onstruction and {A}nalysis of {S}ystems
                         ({TACAS}'98)},
  acronym =             {{TACAS}'98},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {1384},
  pages =               {313-329},
  year =                {1998},
  month =               mar,
  doi =                 {10.1007/BFb0054180},
}
[Esp98] Javier Esparza. Decidability and Complexity of Petri Net Problems: An Introduction. In Lectures on Petri Nets I: Basic Models, Advances in Petri Nets, Lecture Notes in Computer Science 1491, pages 374-428. Springer-Verlag, 1998. 
@inproceedings{acpn1-Esp,
  author =              {Esparza, Javier},
  title =               {Decidability and Complexity of {P}etri Net Problems:
                         An Introduction},
  editor =              {Reisig, Wolfgang and Rozenberg, Grzegorz},
  booktitle =           {Lectures on {P}etri Nets~{I}: Basic Models, Advances
                         in {P}etri Nets},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {1491},
  pages =               {374-428},
  year =                {1998},
  confyear =            {1996},
  confmonth =           {9},
}
[FM98] Melvin Fitting and Richard L. Mendelsohn. First-Order Modal Logic. Synthese Library 277. Springer-Verlag, 1998. 
@book{FOML-FM98,
  author =              {Fitting, Melvin and Mendelsohn, Richard L.},
  title =               {First-Order Modal Logic},
  publisher =           {Springer-Verlag},
  series =              {Synthese Library},
  number =              {277},
  year =                {1998},
}
[GH98] Raymond Greenlaw and H. James Hoover. Parallel Computation: Models and Complexity Issues. In Mikhail J. Atallah (eds.), Handbook of Algorithms and Theory of Computation. CRC Press, November 1998. 
@incollection{HATC1998-GH,
  author =              {Greenlaw, Raymond and Hoover, H. James},
  title =               {Parallel Computation: Models and Complexity Issues},
  editor =              {Atallah, Mikhail J.},
  booktitle =           {Handbook of Algorithms and Theory of Computation},
  publisher =           {CRC Press},
  chapter =             {48},
  year =                {1998},
  month =               nov,
}
[Hem98] Harald Hempel. Boolean Hierarchies – On Collapse Properties and Query Order. PhD thesis, Friedrich-Schiller Universität Jena, Germany, 1998. 
@phdthesis{phd-hempel,
  author =              {Hempel, Harald},
  title =               {Boolean Hierarchies~-- On~Collapse Properties and
                         Query Order},
  year =                {1998},
  school =              {Friedrich-Schiller Universit{\"a}t Jena, Germany},
}
[Hen98] Thomas A. Henzinger. It's About Time: Real-Time Logics Reviewed. In CONCUR'98, Lecture Notes in Computer Science 1466, pages 439-454. Springer-Verlag, September 1998. 
@inproceedings{concur1998-Hen,
  author =              {Henzinger, Thomas A.},
  title =               {It's About Time: Real-Time Logics Reviewed},
  editor =              {Sangiorgi, Davide and de Simone, Robert},
  booktitle =           {{P}roceedings of the 9th {I}nternational
                         {C}onference on {C}oncurrency {T}heory
                         ({CONCUR}'98)},
  acronym =             {{CONCUR}'98},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {1466},
  pages =               {439-454},
  year =                {1998},
  month =               sep,
}
[Her98] Philippe Herrmann. Timed Automata and Recognizability. Information Processing Letters 65(6):313-318. Elsevier, March 1998. 
@article{ipl65(6)-Her,
  author =              {Herrmann, {\relax Ph}ilippe},
  title =               {Timed Automata and Recognizability},
  publisher =           {Elsevier},
  journal =             {Information Processing Letters},
  volume =              {65},
  number =              {6},
  pages =               {313-318},
  year =                {1998},
  month =               mar,
}
[HKP+98] Thomas A. Henzinger, Peter W. Kopke, Anuj Puri, and Pravin Varaiya. What is decidable about Hybrid Automata?. Journal of Computer and System Sciences 57(1):94-124. Academic Press, August 1998. 
@article{jcss57(1)-HKPV,
  author =              {Henzinger, Thomas A. and Kopke, Peter W. and Puri,
                         Anuj and Varaiya, Pravin},
  title =               {What is decidable about Hybrid Automata?},
  publisher =           {Academic Press},
  journal =             {Journal of Computer and System Sciences},
  volume =              {57},
  number =              {1},
  pages =               {94-124},
  year =                {1998},
  month =               aug,
}
[HQR98] Thomas A. Henzinger, Shaz Qadeer, and Sriram Rajamani. You Assume, We Guarantee: Methodology and Case Studies. In CAV'98, Lecture Notes in Computer Science 1427, pages 440-451. Springer-Verlag, June 1998. 
@inproceedings{cav1998-HQR,
  author =              {Henzinger, Thomas A. and Qadeer, Shaz and Rajamani,
                         Sriram},
  title =               {You Assume, We Guarantee: Methodology and Case
                         Studies},
  editor =              {Hu, Alan J. and Vardi, Moshe Y.},
  booktitle =           {{P}roceedings of the 10th {I}nternational
                         {C}onference on {C}omputer {A}ided {V}erification
                         ({CAV}'98)},
  acronym =             {{CAV}'98},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {1427},
  pages =               {440-451},
  year =                {1998},
  month =               jun,
}
[HRS98] Thomas A. Henzinger, Jean-François Raskin, and Pierre-Yves Schobbens. The Regular Real-Time Languages. In ICALP'98, Lecture Notes in Computer Science 1443, pages 580-591. Springer-Verlag, July 1998. 
@inproceedings{icalp1998-HRS,
  author =              {Henzinger, Thomas A. and Raskin, Jean-Fran{\c c}ois
                         and Schobbens, Pierre-Yves},
  title =               {The Regular Real-Time Languages},
  editor =              {Larsen, Kim Guldstrand and Skyum, Sven and Winskel,
                         Glynn},
  booktitle =           {{P}roceedings of the 25th {I}nternational
                         {C}olloquium on {A}utomata, {L}anguages and
                         {P}rogramming ({ICALP}'98)},
  acronym =             {{ICALP}'98},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {1443},
  pages =               {580-591},
  year =                {1998},
  month =               jul,
}
[JT98] Birgit Jenner and Jacobo Torán. The Complexity of Obtaining Solutions for Problems in NP and NL. In Lane A. Hemaspaandra and Alan L. Selman (eds.), Complexity Theory Retrospective II. Springer-Verlag, 1998. 
@incollection{ctr2-JT,
  author =              {Jenner, Birgit and Tor{\'a}n, Jacobo},
  title =               {The Complexity of Obtaining Solutions for Problems
                         in {NP} and {NL}},
  editor =              {Hemaspaandra, Lane A. and Selman, Alan L.},
  booktitle =           {Complexity Theory Retrospective~II},
  publisher =           {Springer-Verlag},
  pages =               {155-178},
  year =                {1998},
}
[Jur98] Marcin Jurdziński. Deciding the Winner in Parity Games is in UP∩co-UP. Information Processing Letters 68(3):119-124. Elsevier, November 1998. 
@article{ipl68(3)-Jur,
  author =              {Jurdzi{\'n}ski, Marcin},
  title =               {Deciding the Winner in Parity Games is in
                         {UP}{\(\cap\)}co-{UP}},
  publisher =           {Elsevier},
  journal =             {Information Processing Letters},
  volume =              {68},
  number =              {3},
  pages =               {119-124},
  year =                {1998},
  month =               nov,
}
[KPR98] Yonit Kesten, Amir Pnueli, and Li-on Raviv. Algorithmic Verification of Linear Temporal Logic Specifications. In ICALP'98, Lecture Notes in Computer Science 1443, pages 1-16. Springer-Verlag, July 1998. 
@inproceedings{icalp1998-KPR,
  author =              {Kesten, Yonit and Pnueli, Amir and Raviv, Li-on},
  title =               {Algorithmic Verification of Linear Temporal Logic
                         Specifications},
  editor =              {Larsen, Kim Guldstrand and Skyum, Sven and Winskel,
                         Glynn},
  booktitle =           {{P}roceedings of the 25th {I}nternational
                         {C}olloquium on {A}utomata, {L}anguages and
                         {P}rogramming ({ICALP}'98)},
  acronym =             {{ICALP}'98},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {1443},
  pages =               {1-16},
  year =                {1998},
  month =               jul,
}
[KV98] Orna Kupferman and Moshe Y. Vardi. Freedom, Weakness, and Determinism: From Linear-Time to Branching-Time. In LICS'98, pages 81-92. IEEE Comp. Soc. Press, June 1998. 
@inproceedings{lics1998-KV,
  author =              {Kupferman, Orna and Vardi, Moshe Y.},
  title =               {Freedom, Weakness, and Determinism: From Linear-Time
                         to Branching-Time},
  booktitle =           {{P}roceedings of the 13th {A}nnual {S}ymposium on
                         {L}ogic in {C}omputer {S}cience ({LICS}'98)},
  acronym =             {{LICS}'98},
  publisher =           {IEEE Comp. Soc. Press},
  pages =               {81-92},
  year =                {1998},
  month =               jun,
}
[KV98] Orna Kupferman and Moshe Y. Vardi. Weak Alternating Automata and Tree Automata Emptiness. In STOC'98, pages 224-233. ACM Press, May 1998. 
@inproceedings{stoc1998-KV,
  author =              {Kupferman, Orna and Vardi, Moshe Y.},
  title =               {Weak Alternating Automata and Tree Automata
                         Emptiness},
  booktitle =           {{P}roceedings of the 30th {A}nnual {ACM} {S}ymposium
                         on the {T}heory of {C}omputing ({STOC}'98)},
  acronym =             {{STOC}'98},
  publisher =           {ACM Press},
  pages =               {224-233},
  year =                {1998},
  month =               may,
}
[LL98] François Laroussinie and 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, October 1998. 
@inproceedings{forte1998-LL,
  author =              {Laroussinie, Fran{\c c}ois and Larsen, Kim
                         Guldstrand},
  title =               {{CMC}: A~Tool for Compositional Model-Checking of
                         Real-Time Systems},
  editor =              {Budkowski, Stanislaw and Cavalli, Anna R. and Najm,
                         Elie},
  booktitle =           {{P}roceedings of the {IFIP} {TC6} {WG}6.1 {J}oint
                         {I}nternational {C}onference on {F}ormal
                         {D}escription {T}echniques for {D}istributed
                         {S}ystems and {C}ommunication {P}rotocols
                         ({FORTE}'98) and {P}rotocol {S}pecification,
                         {T}esting and {V}erification ({PSTV}'98)},
  acronym =             {{FORTE/PSTV}'98},
  publisher =           {Kluwer Academic},
  series =              {IFIP Conference Proceedings},
  volume =              {135},
  pages =               {439-456},
  year =                {1998},
  month =               oct,
}
[LRL98] Zhiming Liu, Anders P. Ravn, and Xiaochan Li. Verifying Duration Properties of Timed Transition Systems. In PROCOMET'98, IFIP Conference Proceedings 125, pages 327-345. Chapman & Hall, June 1998. 
@inproceedings{ifipprocomet1998-LRL,
  author =              {Liu, Zhiming and Ravn, Anders P. and Li, Xiaochan},
  title =               {Verifying Duration Properties of Timed Transition
                         Systems},
  editor =              {Gries, David and de Roever, Willem-Paul},
  booktitle =           {{P}roceedings of the 2nd {IFIP} {I}nternational
                         {C}onference on {P}rogramming {C}oncepts and
                         {M}ethods ({PROCOMET}'98)},
  acronym =             {{PROCOMET}'98},
  publisher =           {Chapman \& Hall},
  series =              {IFIP Conference Proceedings},
  volume =              {125},
  pages =               {327-345},
  year =                {1998},
  month =               jun,
}
[LS98] Xinxin Liu and 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, July 1998. 
@inproceedings{icalp1998-LS,
  author =              {Liu, Xinxin and Smolka, Scott A.},
  title =               {Simple Linear-Time Algorithms for Minimal Fixed
                         Points},
  editor =              {Larsen, Kim Guldstrand and Skyum, Sven and Winskel,
                         Glynn},
  booktitle =           {{P}roceedings of the 25th {I}nternational
                         {C}olloquium on {A}utomata, {L}anguages and
                         {P}rogramming ({ICALP}'98)},
  acronym =             {{ICALP}'98},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {1443},
  pages =               {53-66},
  year =                {1998},
  month =               jul,
}
[MBL+98] Hervé Marchand, Patricia Bournai, Michel Le Borgne, and Paul Le Guernic. A Design Environment for Discrete-Event Controllers based on the SIGNAL Language. In SMC'98, pages 770-775. IEEE Comp. Soc. Press, October 1998. 
@inproceedings{ieeesmc1998-MBLL,
  author =              {Marchand, Herv{\'e} and Bournai, Patricia and
                         Le{~}Borgne, Michel and Le{~}Guernic, Paul},
  title =               {A Design Environment for Discrete-Event Controllers
                         based on the {SIGNAL} Language},
  booktitle =           {{P}roceedings of the 1998 {IEEE} {I}nternational
                         {C}onference on {S}ystems, {M}an, {A}nd
                         {C}ybernetics ({SMC}'98)},
  acronym =             {{SMC}'98},
  publisher =           {IEEE Comp. Soc. Press},
  pages =               {770-775},
  year =                {1998},
  month =               oct,
}
[MW98] Helmut Melcher and Klaus Winkelmann. Controller synthesis for the `production cell' case study. In FMSP'98, pages 24-33. ACM Press, March 1998. 
@inproceedings{fmsp1998-MW,
  author =              {Melcher, Helmut and Winkelmann, Klaus},
  title =               {Controller synthesis for the `production cell' case
                         study},
  editor =              {Ardis, Mark},
  booktitle =           {{P}roceedings of the 2nd {W}orkshop on {F}ormal
                         {M}ethods in {S}oftware {P}ractice ({FMSP}'98)},
  acronym =             {{FMSP}'98},
  publisher =           {ACM Press},
  pages =               {24-33},
  year =                {1998},
  month =               mar,
}
[Pel98] Doron A. Peled. Ten years of partial-order reduction. In CAV'98, Lecture Notes in Computer Science 1427, pages 17-28. Springer-Verlag, June 1998. 
@inproceedings{cav1998-Pel,
  author =              {Peled, Doron A.},
  title =               {Ten years of partial-order reduction},
  editor =              {Hu, Alan J. and Vardi, Moshe Y.},
  booktitle =           {{P}roceedings of the 10th {I}nternational
                         {C}onference on {C}omputer {A}ided {V}erification
                         ({CAV}'98)},
  acronym =             {{CAV}'98},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {1427},
  pages =               {17-28},
  year =                {1998},
  month =               jun,
  doi =                 {10.1007/BFb0028727},
}
[Pur98] Anuj Puri. Dynamical Properties of Timed Automata. In FTRTFT'98, Lecture Notes in Computer Science 1486, pages 210-227. Springer-Verlag, September 1998. 
@inproceedings{ftrtft1998-Pur,
  author =              {Puri, Anuj},
  title =               {Dynamical Properties of Timed Automata},
  editor =              {Ravn, Anders P. and Rischel, Hans},
  booktitle =           {{P}roceedings of the 5th {F}ormal {T}echniques in
                         {R}eal-Time and {F}ault-Tolerant {S}ystems
                         ({FTRTFT}'98)},
  acronym =             {{FTRTFT}'98},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {1486},
  pages =               {210-227},
  year =                {1998},
  month =               sep,
}
[Ram98] Jorge Luis Ramírez Alfonsín. On Variations of the Subset Sum Problem. Discrete Applied Mathematics 81(1-3):1-7. Elsevier, January 1998. 
@article{dam81(1-3)-Ram,
  author =              {Ram{\'\i}rez{ }Alfons{\'\i}n, Jorge Luis},
  title =               {On Variations of the Subset Sum Problem},
  publisher =           {Elsevier},
  journal =             {Discrete Applied Mathematics},
  volume =              {81},
  number =              {1-3},
  pages =               {1-7},
  year =                {1998},
  month =               jan,
}
[Ram98] Solofo Ramangalahi. Strategies for comformance testing. Research Report 98-010, Max-Planck Institut für Informatik, Germany, May 1998. 
@techreport{mpi-i-98-010-Ram,
  author =              {Ramangalahi, Solofo},
  title =               {Strategies for comformance testing},
  number =              {98-010},
  year =                {1998},
  month =               may,
  institution =         {Max-Planck Institut f{\"u}r Informatik, Germany},
  type =                {Research Report},
}
[RB98] Theo C. Ruys and Ed Brinksma. Experience with Literate Programming in the Modelling and Validation of Systems. In TACAS'98, Lecture Notes in Computer Science 1384, pages 393-407. Springer-Verlag, March 1998. 
@inproceedings{tacas1998-RB,
  author =              {Ruys, Theo C. and Brinksma, Ed},
  title =               {Experience with Literate Programming in the
                         Modelling and Validation of Systems},
  editor =              {Steffen, Bernhard},
  booktitle =           {{P}roceedings of the 4th {I}nternational
                         {C}onference on {T}ools and {A}lgorithms for
                         {C}onstruction and {A}nalysis of {S}ystems
                         ({TACAS}'98)},
  acronym =             {{TACAS}'98},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {1384},
  pages =               {393-407},
  year =                {1998},
  month =               mar,
}
[RT98] Jérôme Renault and Tristan Tomala. Repeated proximity games. International Journal of Game Theory 27(4):539-559. Springer-Verlag, December 1998. 
@article{ijgt27(4)-RT,
  author =              {Renault, J{\'e}r{\^o}me and Tomala, Tristan},
  title =               {Repeated proximity games},
  publisher =           {Springer-Verlag},
  journal =             {International Journal of Game Theory},
  volume =              {27},
  number =              {4},
  pages =               {539-559},
  year =                {1998},
  month =               dec,
}
[RV98] Steffen Reith and Heribert Vollmer. The Complexity of Computing Optimal Assignments of Generalized Propositional Formulae. Research Report cs.CC/9809116, arXiv, September 1998. 
@techreport{arxiv-cs.CC/9809116,
  author =              {Reith, Steffen and Vollmer, Heribert},
  title =               {The Complexity of Computing Optimal Assignments of
                         Generalized Propositional Formulae},
  number =              {cs.CC/9809116},
  year =                {1998},
  month =               sep,
  institution =         {arXiv},
  type =                {Research Report},
}
[Sch98] Stefan Schwendimann. A New One-Pass Tableau Calculus for PLTL. In TABLEAUX'98, Lecture Notes in Computer Science 1397, pages 277-292. Springer-Verlag, May 1998. 
@inproceedings{tableaux1998-Sch,
  author =              {Schwendimann, Stefan},
  title =               {A New One-Pass Tableau Calculus for {PLTL}},
  editor =              {de Swart, Harrie C. M.},
  booktitle =           {{P}roceedings of the 7th {I}nternational
                         {C}onference on {A}utomated {R}easoning with
                         {A}nalytic {T}ableaux and {R}elated {M}ethods
                         ({TABLEAUX}'98)},
  acronym =             {{TABLEAUX}'98},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {1397},
  pages =               {277-292},
  year =                {1998},
  month =               may,
}
[SLT98] Meera Sampath, Stéphane Lafortune, and Demosthenis Teneketzis. Active diagnosis of discrete-event systems. IEEE Transactions on Automatic Control 43(7):908-929. IEEE Comp. Soc. Press, July 1998. 
@article{tac43(7)-SLT,
  author =              {Sampath, Meera and Lafortune, St{\'e}phane and
                         Teneketzis, Demosthenis},
  title =               {Active diagnosis of discrete-event systems},
  publisher =           {IEEE Comp. Soc. Press},
  journal =             {IEEE Transactions on Automatic Control},
  volume =              {43},
  number =              {7},
  pages =               {908-929},
  year =                {1998},
  month =               jul,
  doi =                 {10.1109/9.701089},
}
[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. 
@inproceedings{ftrtft1998-TD,
  author =              {Tapken, Josef and Dierks, Henning},
  title =               {{MOBY/PLC}~-- Graphical Development of
                         {PLC}-Automata},
  editor =              {Ravn, Anders P. and Rischel, Hans},
  booktitle =           {{P}roceedings of the 5th {F}ormal {T}echniques in
                         {R}eal-Time and {F}ault-Tolerant {S}ystems
                         ({FTRTFT}'98)},
  acronym =             {{FTRTFT}'98},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {1486},
  pages =               {311-314},
  year =                {1998},
  month =               sep,
}
[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. 
@inproceedings{stoc1998-TW,
  author =              {Th{\'e}rien, Denis and Wilke, Thomas},
  title =               {Over Words, Two Variables Are as Powerful as One
                         Quantifier Alternation: {\(\textup{FO}^2 = \Sigma_2
                         \cap \Pi_2\)}},
  booktitle =           {{P}roceedings of the 30th {A}nnual {ACM} {S}ymposium
                         on the {T}heory of {C}omputing ({STOC}'98)},
  acronym =             {{STOC}'98},
  publisher =           {ACM Press},
  pages =               {234-240},
  year =                {1998},
  month =               may,
}
[Var98] Moshe Y. Vardi. Sometimes and Not Never Revisited: on Branching versus Linear Time. In CONCUR'98, Lecture Notes in Computer Science 1466, pages 1-17. Springer-Verlag, September 1998. 
@inproceedings{concur1998-Var,
  author =              {Vardi, Moshe Y.},
  title =               {Sometimes and Not Never Revisited: on Branching
                         versus Linear Time},
  editor =              {Sangiorgi, Davide and de Simone, Robert},
  booktitle =           {{P}roceedings of the 9th {I}nternational
                         {C}onference on {C}oncurrency {T}heory
                         ({CONCUR}'98)},
  acronym =             {{CONCUR}'98},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {1466},
  pages =               {1-17},
  year =                {1998},
  month =               sep,
}
[Var98] Moshe Y. Vardi. Reasoning about the Past with Two-Way Automata. In ICALP'98, Lecture Notes in Computer Science 1443, pages 628-641. Springer-Verlag, July 1998. 
@inproceedings{icalp1998-Var,
  author =              {Vardi, Moshe Y.},
  title =               {Reasoning about the Past with Two-Way Automata},
  editor =              {Larsen, Kim Guldstrand and Skyum, Sven and Winskel,
                         Glynn},
  booktitle =           {{P}roceedings of the 25th {I}nternational
                         {C}olloquium on {A}utomata, {L}anguages and
                         {P}rogramming ({ICALP}'98)},
  acronym =             {{ICALP}'98},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {1443},
  pages =               {628-641},
  year =                {1998},
  month =               jul,
}
[Var98] Moshe Y. Vardi. Linear versus Branching Time: a Complexity-Theoretic Approach. In LICS'98, pages 394-405. IEEE Comp. Soc. Press, June 1998. 
@inproceedings{lics1998-Var,
  author =              {Vardi, Moshe Y.},
  title =               {Linear versus Branching Time: a Complexity-Theoretic
                         Approach},
  booktitle =           {{P}roceedings of the 13th {A}nnual {S}ymposium on
                         {L}ogic in {C}omputer {S}cience ({LICS}'98)},
  acronym =             {{LICS}'98},
  publisher =           {IEEE Comp. Soc. Press},
  pages =               {394-405},
  year =                {1998},
  month =               jun,
}
[Ven98] Yde Venema. Rectangular games. Journal of Symbolic Logic 63(4):1549-1564. Association for Symbolic Logic, December 1998. 
@article{jsl63(4)-Ven,
  author =              {Venema, Yde},
  title =               {Rectangular games},
  publisher =           {Association for Symbolic Logic},
  journal =             {Journal of Symbolic Logic},
  volume =              {63},
  number =              {4},
  pages =               {1549-1564},
  year =                {1998},
  month =               dec,
}
[Zie98] Wiesław Zielonka. Infinite Games on Finitely Coloured Graphs with Applications to Automata on Infinite Trees. Theoretical Computer Science 200(1-2):135-183. Elsevier, June 1998. 
@article{tcs200(1-2)-Zie,
  author =              {Zielonka, Wies{\l}aw},
  title =               {Infinite Games on Finitely Coloured Graphs with
                         Applications to Automata on Infinite Trees},
  publisher =           {Elsevier},
  journal =             {Theoretical Computer Science},
  volume =              {200},
  number =              {1-2},
  pages =               {135-183},
  year =                {1998},
  month =               jun,
}
List of authors