J
[JBB+17] Swen Jacobs, Roderick Bloem, Romain Brenguier, Rüdiger Ehlers, Timotheus Hell, Robert Könighofer, Guillermo A. Pérez, Jean-François Raskin, Leonid Ryzhyk, Ocan Sankur, Martin Seidl, Leander Tentrup, and Adam Walker. The first reactive synthesis competition (SYNTCOMP 2014). International Journal on Software Tools for Technology Transfer 19(3):367-390. Springer-Verlag, June 2017.
@article{sttt19(3)-JBBEHKPRRSSTW,
  author =              {Jacobs, Swen and Bloem, Roderick and Brenguier,
                         Romain and Ehlers, R{\"u}diger and Hell, Timotheus
                         and K{\"o}nighofer, Robert and P{\'e}rez, Guillermo
                         A. and Raskin, Jean-Fran{\c c}ois and Ryzhyk, Leonid
                         and Sankur, Ocan and Seidl, Martin and Tentrup,
                         Leander and Walker, Adam},
  title =               {The first reactive synthesis competition
                         ({SYNTCOMP}~2014)},
  publisher =           {Springer-Verlag},
  journal =             {International Journal on Software Tools for
                         Technology Transfer},
  volume =              {19},
  number =              {3},
  pages =               {367-390},
  year =                {2017},
  month =               jun,
  doi =                 {10.1007/s10009-016-0416-3},
}
[JdB+09] Mohammad Mahdi Jaghoori, Frank S. de Boer, Tom Chothia, and Marjan Sirjani. Schedulability of asynchronous real-time concurrent objects. Journal of Logic and Algebraic Programming 78(5):402-416. Elsevier, May 2009.
@article{jlap78(5)-JBCS,
  author =              {Jaghoori, Mohammad Mahdi and de Boer, Frank S. and
                         Chothia, Tom and Sirjani, Marjan},
  title =               {Schedulability of asynchronous real-time concurrent
                         objects},
  publisher =           {Elsevier},
  journal =             {Journal of Logic and Algebraic Programming},
  volume =              {78},
  number =              {5},
  pages =               {402-416},
  year =                {2009},
  month =               may,
}
[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.
@inproceedings{ceemas2005-JD,
  author =              {Jamroga, Wojciech and Dix, J{\"u}rgen},
  title =               {Do Agents Make Model Checking Explode
                         (Computationally)?},
  editor =              {P{ e}chouc{ e}k, Michal and Petta, Paolo and
                         Varga, L{\'a}szl{\'o} Zsolt},
  booktitle =           {{P}roceedings of the 4th {I}nternational {C}entral
                         and {E}astern {E}uropean {C}onference on
                         {M}ulti-{A}gent {S}ystems ({CEEMAS}'05)},
  acronym =             {{CEEMAS}'05},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Artificial Intelligence},
  volume =              {23690},
  pages =               {398-407},
  year =                {2005},
  month =               sep,
}
[JD06] Wojciech Jamroga and Jürgen Dix. Model Checking Abilities of Agents: A Closer Look. Technical Report IfI-06-02, Institut fúr Informatik, Technische Universität Clausthal, Germany, 2006.
@techreport{IfI-06-02-JD,
  author =              {Jamroga, Wojciech and Dix, J{\"u}rgen},
  title =               {Model Checking Abilities of Agents: A Closer Look},
  number =              {IfI-06-02},
  year =                {2006},
  institution =         {Institut f{\'u}r Informatik, Technische
                         Universit{\"a}t Clausthal, Germany},
  type =                {Technical Report},
}
[JD08] Wojciech Jamroga and Jürgen Dix. Model Checking Abilities of Agents: A Closer Look. Theory of Computing Systems 42(3):366-410. Springer-Verlag, April 2008.
@article{tocsys42(3)-JD,
  author =              {Jamroga, Wojciech and Dix, J{\"u}rgen},
  title =               {Model Checking Abilities of Agents: A Closer Look},
  publisher =           {Springer-Verlag},
  journal =             {Theory of Computing Systems},
  volume =              {42},
  number =              {3},
  pages =               {366-410},
  year =                {2008},
  month =               apr,
  doi =                 {10.1007/s00224-007-9080-z},
}
[Jer03] Thierry Jéron. Project-Team VerTeCs. Annual Reviews Inc., IRISA, Rennes, France, 2003.
@techreport{AR-VerTeCs-2003,
  author =              {J{\'e}ron, Thierry},
  title =               {Project-Team {VerTeCs}},
  year =                {2003},
  institution =         {IRISA, Rennes, France},
  type =                {Annual Reviews Inc.},
}
[Jer04] Thierry Jéron. Contribution à la génération automatique de tests pour les systèmes réactifs. Mémoire d'habilitation, Université Rennes 1, France, February 2004.
@phdthesis{hab-jeron,
  author =              {J{\'e}ron, Thierry},
  title =               {Contribution {\`a} la g{\'e}n{\'e}ration automatique
                         de tests pour les syst{\`e}mes r{\'e}actifs},
  year =                {2004},
  month =               feb,
  school =              {Universit{\'e} Rennes~1, France},
  type =                {M\'emoire d'habilitation},
}
[JGB97] Predrag Janičić, Ian Green, and Alan Bundy. A Comparison of Decision Procedures in Presburger Arithmetic. In LIRA'97, pages 91-101. September 1997.
@inproceedings{lira1997-JGB,
  author =              {Jani{ c}i{\'c}, Predrag and Green, Ian and Bundy,
                         Alan},
  title =               {A Comparison of Decision Procedures in {P}resburger
                         Arithmetic},
  editor =              {To{ s}i{\'c}, Ratko and Budimac, Zoran},
  booktitle =           {{P}roceedings of the 8th {I}nternational
                         {C}onference on {L}ogic and {C}omputer {S}cience
                         ({LIRA}'97)},
  acronym =             {{LIRA}'97},
  pages =               {91-101},
  year =                {1997},
  month =               sep,
}
[JvdH04] Wojciech Jamroga and Wiebe van der Hoek. Agents that Know How to Play. Fundamenta Informaticae 63(2-3):185-219. IOS Press, 2004.
@article{fundi63(2-3)-JH,
  author =              {Jamroga, Wojciech and van der Hoek, Wiebe},
  title =               {Agents that Know How to Play},
  publisher =           {IOS Press},
  journal =             {Fundamenta Informaticae},
  volume =              {63},
  number =              {2-3},
  pages =               {185-219},
  year =                {2004},
}
[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.
@inproceedings{epia2005-JHW,
  author =              {Jamroga, Wojciech and van der Hoek, Wiebe and
                         Wooldridge, Michael},
  title =               {Intentions and Strategies in Game-Like Scenarios},
  editor =              {Bento, Carlos and Cardoso, Am{\'\i}lcar and Dias,
                         Ga{\"e}l},
  booktitle =           {{P}roceedings of the 12th {P}ortuguese {C}onference
                         on {A}rtificial {I}ntelligence ({EPIA}'05)},
  acronym =             {{EPIA}'05},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Artificial Intelligence},
  volume =              {3808},
  pages =               {512-523},
  year =                {2005},
  month =               dec,
}
[JL03] Jan Johannsen and Martin Lange. CTL+ is Complete for Double Exponential Time. In ICALP'03, Lecture Notes in Computer Science 2719, pages 767-775. Springer-Verlag, June 2003.
@inproceedings{icalp2003-JL,
  author =              {Johannsen, Jan and Lange, Martin},
  title =               {{CTL{\(^+\)}} is Complete for Double Exponential
                         Time},
  editor =              {Baeten, Jos C. M. and Lenstra, Jan Karel and Parrow,
                         Joachim and Woeginger, Gerhard J.},
  booktitle =           {{P}roceedings of the 30th {I}nternational
                         {C}olloquium on {A}utomata, {L}anguages and
                         {P}rogramming ({ICALP}'03)},
  acronym =             {{ICALP}'03},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {2719},
  pages =               {767-775},
  year =                {2003},
  month =               jun,
}
[JL04] David Janin and Giacommo Lenzi. On the Relationship Between Monadic and Weak Monadic Second Order Logic on Arbitrary Trees. Fundamenta Informaticae 61(3-4):247-265. IOS Press, 2004.
@article{fundi61(3-4)-JL,
  author =              {Janin, David and Lenzi, Giacommo},
  title =               {On the Relationship Between Monadic and Weak Monadic
                         Second Order Logic on Arbitrary Trees},
  publisher =           {IOS Press},
  journal =             {Fundamenta Informaticae},
  volume =              {61},
  number =              {3-4},
  pages =               {247-265},
  year =                {2004},
}
[JLM97] Birgit Jenner, Klaus-Jörn Lange, and Pierre McKenzie. Tree Isomorphism and Some Other Complete Problems for Deterministic Logspace. Technical Report 1059, DIRO, Université de Montréal, Canada, March 1997.
@techreport{diro1-59-JLM,
  author =              {Jenner, Birgit and Lange, Klaus-J{\"o}rn and
                         McKenzie, Pierre},
  title =               {Tree Isomorphism and Some Other Complete Problems
                         for Deterministic Logspace},
  number =              {1059},
  year =                {1997},
  month =               mar,
  institution =         {DIRO, Universit{\'e} de Montr{\'e}al, Canada},
  type =                {Technical Report},
}
[JLR13] Line Juhl, Kim Guldstrand Larsen, and Jean-François Raskin. Optimal Bounds for Multiweighted and Parametrised Energy Games. In Theories of Programming and Formal Methods – Essays Dedicated to Jifeng He on the Occasion of His 70th Birthday, Lecture Notes in Computer Science 8051, pages 244-255. Springer-Verlag, 2013.
@inproceedings{tpfm2013-JLR,
  author =              {Juhl, Line and Larsen, Kim Guldstrand and Raskin,
                         Jean-Fran{\c c}ois},
  title =               {Optimal Bounds for Multiweighted and Parametrised
                         Energy Games},
  editor =              {Liu, Zhiming and Woodcock, Jim and Zhu, Yunshan},
  booktitle =           {Theories of Programming and Formal Methods~-- Essays
                         Dedicated to Jifeng He on the Occasion of His 70th
                         Birthday},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {8051},
  pages =               {244-255},
  year =                {2013},
  doi =                 {10.1007/978-3-642-39698-4_15},
}
[JLR15] Aleksandra Jovanović, Didier Lime, and Olivier H. Roux. Integer Parameter Synthesis for Timed Automata. IEEE Transactions on Software Engineering 41(5):445-461. IEEE Comp. Soc. Press, May 2015.
@article{tse41(5)-JLR,
  author =              {Jovanovi{\'c}, Aleksandra and Lime, Didier and Roux,
                         Olivier H.},
  title =               {Integer Parameter Synthesis for Timed Automata},
  publisher =           {IEEE Comp. Soc. Press},
  journal =             {IEEE Transactions on Software Engineering},
  volume =              {41},
  number =              {5},
  pages =               {445-461},
  year =                {2015},
  month =               may,
  doi =                 {10.1109/TSE.2014.2357445},
}
[JLS07] Marcin Jurdziński, François Laroussinie, and Jeremy Sproston. Model Checking Probabilistic Timed Automata with One or Two Clocks. In TACAS'07, Lecture Notes in Computer Science 4424, pages 170-184. Springer-Verlag, March 2007.
@inproceedings{tacas2007-JLS,
  author =              {Jurdzi{\'n}ski, Marcin and Laroussinie, Fran{\c
                         c}ois and Sproston, Jeremy},
  title =               {Model Checking Probabilistic Timed Automata with One
                         or Two Clocks},
  editor =              {Grumberg, Orna and Huth, Michael},
  booktitle =           {{P}roceedings of the 13th {I}nternational
                         {C}onference on {T}ools and {A}lgorithms for
                         {C}onstruction and {A}nalysis of {S}ystems
                         ({TACAS}'07)},
  acronym =             {{TACAS}'07},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {4424},
  pages =               {170-184},
  year =                {2007},
  month =               mar,
}
[JLS12] Kenneth Yrke Jørgensen, Kim Guldstrand Larsen, and Jiří Srba. Time-Darts: A Data Structure for Verification of Closed Timed Automata. In SSV'12, Electronic Proceedings in Theoretical Computer Science 102, pages 141-155. November 2012.
@inproceedings{ssv2012-JLS,
  author =              {J{\o}rgensen, Kenneth Yrke and Larsen, Kim
                         Guldstrand and Srba, Ji{ r}{\'\i}},
  title =               {Time-Darts: A~Data Structure for Verification of
                         Closed Timed Automata},
  booktitle =           {{P}roceedings of the 7th {C}onference on {S}ystems
                         {S}oftware {V}erification ({SSV}'12)},
  acronym =             {{SSV}'12},
  series =              {Electronic Proceedings in Theoretical Computer
                         Science},
  volume =              {102},
  pages =               {141-155},
  year =                {2012},
  month =               nov,
  doi =                 {10.4204/EPTCS.102.13},
}
[JLS15] Marcin Jurdziński, Ranko Lazić, and Sylvain Schmitz. Fixed-Dimensional Energy Games are in Pseudo-Polynomial Time. In ICALP'15, Lecture Notes in Computer Science 9135, pages 260-272. Springer-Verlag, July 2015.
@inproceedings{icalp2015-JLS,
  author =              {Jurdzi{\'n}ski, Marcin and Lazi{\'c}, Ranko and
                         Schmitz, Sylvain},
  title =               {Fixed-Dimensional Energy Games are in
                         Pseudo-Polynomial Time},
  editor =              {Halld{\'o}rsson, Magn{\'u}s M. and Iwana, Kazuo and
                         Kobayashi, Naoki and Speckmann, Bettina},
  booktitle =           {{P}roceedings of the 42nd {I}nternational
                         {C}olloquium on {A}utomata, {L}anguages and
                         {P}rogramming ({ICALP}'15)~-- Part~{II}},
  acronym =             {{ICALP}'15},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {9135},
  pages =               {260-272},
  year =                {2015},
  month =               jul,
  doi =                 {10.1007/978-3-662-47666-6_21},
}
[JLS+13] Jonas Finnemann Jensen, Kim Guldstrand Larsen, Jiří Srba, and Lars Kærlund Østergaard. Local Model Checking of Weighted CTL with Upper-Bound Constraints. In SPIN'13, Lecture Notes in Computer Science 7976, pages 178-195. Springer-Verlag, July 2013.
@inproceedings{spin2013-JLSO,
  author =              {Jensen, Jonas Finnemann and Larsen, Kim Guldstrand
                         and Srba, Ji{ r}{\'\i} and {\O}stergaard, Lars
                         K{\ae}rlund},
  title =               {Local Model Checking of Weighted {CTL} with
                         Upper-Bound Constraints},
  editor =              {Bartocci, Ezio and Ramakrishnan, C. R.},
  booktitle =           {{P}roceedings of the 20th {I}nternational
                         {S}ymposium on {M}odel-{C}herking {S}oftware
                         ({SPIN}'13)},
  acronym =             {{SPIN}'13},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {7976},
  pages =               {178-195},
  year =                {2013},
  month =               jul,
  doi =                 {10.1007/978-3-642-39176-7_12},
}
[JLS+14] Peter Gjøl Jensen, Kim Guldstrand Larsen, Jiří Srba, Mathias Grund Sørensen, and Jakob Haar Taankvist. Memory Efficient Data Structures for Explicit Verification of Timed Systems. In NFM'14, Lecture Notes in Computer Science 8430, pages 307-312. Springer-Verlag, April 2014.
@inproceedings{nasaFM2014-JLSST,
  author =              {Jensen, Peter Gj{\o}l and Larsen, Kim Guldstrand and
                         Srba, Ji{ r}{\'\i} and S{\o}rensen, Mathias Grund
                         and Taankvist, Jakob Haar},
  title =               {Memory Efficient Data Structures for Explicit
                         Verification of Timed Systems},
  editor =              {Badger, Julia M. and Rozier, Kristin Yvonne},
  booktitle =           {{P}roceedings of the 6th {NASA} {F}ormal {M}ethods
                         {S}ymposium ({NFM}'14)},
  acronym =             {{NFM}'14},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {8430},
  pages =               {307-312},
  year =                {2014},
  month =               apr,
  doi =                 {10.1007/978-3-319-06200-6_26},
}
[JMO07] Jacques Julliand, Hassan Mountassir, and Émilie Oudot. VeSTA: A Tool to Verify the Correct Integration of a Component in a Composite Timed System. In ICFEM'07, Lecture Notes in Computer Science 4789, pages 116-135. Springer-Verlag, November 2007.
@inproceedings{icfem2007-JMO,
  author =              {Julliand, Jacques and Mountassir, Hassan and Oudot,
                         {\'E}milie},
  title =               {{V}e{STA}: A~Tool to Verify the Correct Integration
                         of a Component in a Composite Timed System},
  booktitle =           {{P}roceedings of the 9th {I}nternational
                         {C}onference on {F}ormal {E}ngineering {M}ethods
                         ({ICFEM}'07)},
  acronym =             {{ICFEM}'07},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {4789},
  pages =               {116-135},
  year =                {2007},
  month =               nov,
  doi =                 {10.1007/978-3-540-76650-6_8},
}
[JMR+03] Thierry Jéron, Hervé Marchand, Vlad Rusu, and Valéry Tschaen. Ensuring the Conformance of Reactive Discrete-Event Systems using Supervisory Control. In CDC'03, pages 2692- 2697. IEEE Comp. Soc. Press, December 2003.
@inproceedings{cdc2003-JMRT,
  author =              {J{\'e}ron, Thierry and Marchand, Herv{\'e} and Rusu,
                         Vlad and Tschaen, Val{\'e}ry},
  title =               {Ensuring the Conformance of Reactive Discrete-Event
                         Systems using Supervisory Control},
  booktitle =           {{P}roceedings of the 42nd {IEEE} {C}onference on
                         {D}ecision and {C}ontrol ({CDC}'03)},
  acronym =             {{CDC}'03},
  publisher =           {IEEE Comp. Soc. Press},
  pages =               {2692- 2697},
  year =                {2003},
  month =               dec,
}
[Joh83] David S. Johnson. TheNP-Completeness Column: An Ongoing Guide. Journal of Algorithms 4(4):397-411. Elsevier, December 1983.
@article{ja4(4)-joh,
  author =              {Johnson, David S.},
  title =               {The{NP}-Completeness Column: An Ongoing Guide},
  publisher =           {Elsevier},
  journal =             {Journal of Algorithms},
  volume =              {4},
  number =              {4},
  pages =               {397-411},
  year =                {1983},
  month =               dec,
}
[Joh90] David S. Johnson. A Catalog of Complexity Classes. In Jan van Leeuwen (eds.), Handbook of Theoretical Computer Science. Elsevier, 1990.
@incollection{HTCSa1990-Joh,
  author =              {Johnson, David S.},
  title =               {A Catalog of Complexity Classes},
  editor =              {van Leeuwen, Jan},
  booktitle =           {Handbook of Theoretical Computer Science},
  publisher =           {Elsevier},
  volume =              {A},
  pages =               {67-161},
  chapter =             {2},
  year =                {1990},
}
[Joh03] Jan Johannsen. Satisfiability Problems Complete for Deterministic Logarithmic Space. In STACS'04, Lecture Notes in Computer Science 2996, pages 317-325. Springer-Verlag, March 2003.
@inproceedings{stacs2004-Joh,
  author =              {Johannsen, Jan},
  title =               {Satisfiability Problems Complete for Deterministic
                         Logarithmic Space},
  editor =              {Diekert, Volker and Habib, Michel},
  booktitle =           {{P}roceedings of the 21st {S}ymposium on
                         {T}heoretical {A}spects of {C}omputer {S}cience
                         ({STACS}'04)},
  acronym =             {{STACS}'04},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {2996},
  pages =               {317-325},
  year =                {2003},
  month =               mar,
}
[JR11] Rémi Jaubert and Pierre-Alain Reynier. Quantitative Robustness Analysis of Flat Timed Automata. In FoSSaCS'11, Lecture Notes in Computer Science 6604, pages 229-244. Springer-Verlag, March 2011.
@inproceedings{fossacs2011-JR,
  author =              {Jaubert, R{\'e}mi and Reynier, Pierre-Alain},
  title =               {Quantitative Robustness Analysis of Flat Timed
                         Automata},
  editor =              {Hofmann, Martin},
  booktitle =           {{P}roceedings of the 14th {I}nternational
                         {C}onference on {F}oundations of {S}oftware
                         {S}cience and {C}omputation {S}tructure
                         ({FoSSaCS}'11)},
  acronym =             {{FoSSaCS}'11},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {6604},
  pages =               {229-244},
  year =                {2011},
  month =               mar,
}
[JRL+07] Jan J. Jensen, Jacob Illum Rasmussen, Kim Guldstrand Larsen, and Alexandre David. Guided Controller Synthesis for Climate Controller Using UPPAAL Tiga. In FORMATS'07, Lecture Notes in Computer Science 4763, pages 227-240. Springer-Verlag, October 2007.
@inproceedings{formats2007-JRLD,
  author =              {Jensen, Jan J. and Rasmussen, Jacob Illum and
                         Larsen, Kim Guldstrand and David, Alexandre},
  title =               {Guided Controller Synthesis for Climate Controller
                         Using {UPPAAL} {T}iga},
  editor =              {Raskin, Jean-Fran{\c c}ois and Thiagarajan, P. S.},
  booktitle =           {{P}roceedings of the 5th {I}nternational
                         {C}onferences on {F}ormal {M}odelling and {A}nalysis
                         of {T}imed {S}ystems ({FORMATS}'07)},
  acronym =             {{FORMATS}'07},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {4763},
  pages =               {227-240},
  year =                {2007},
  month =               oct,
}
[JS07] Petr Jančar and Zdeněk Sawa. A note on Emptiness for Alternating Finite Automata with a One-letter Alphabet. Information Processing Letters 104(5):164-167. Elsevier, November 2007.
@article{ipl104(5)-JS,
  author =              {Jan{ c}ar, Petr and Sawa, Zden{{e}}k},
  title =               {A note on Emptiness for Alternating Finite Automata
                         with a One-letter Alphabet},
  publisher =           {Elsevier},
  journal =             {Information Processing Letters},
  volume =              {104},
  number =              {5},
  pages =               {164-167},
  year =                {2007},
  month =               nov,
}
[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 UPco-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,
}
[Jur00] Marcin Jurdziński. Small Progress Measures for Solving Parity Games. In STACS'00, Lecture Notes in Computer Science 1770, pages 290-301. Springer-Verlag, March 2000.
@inproceedings{stacs2000-Jur,
  author =              {Jurdzi{\'n}ski, Marcin},
  title =               {Small Progress Measures for Solving Parity Games},
  editor =              {Reichel, Horst and Tison, Sophie},
  booktitle =           {{P}roceedings of the 17th {S}ymposium on
                         {T}heoretical {A}spects of {C}omputer {S}cience
                         ({STACS}'00)},
  acronym =             {{STACS}'00},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {1770},
  pages =               {290-301},
  year =                {2000},
  month =               mar,
}
[JW95] David Janin and Igor Walukiewicz. Automata for the Modal μ-Calculus and Related Results. In MFCS'95, Lecture Notes in Computer Science 969, pages 552-562. Springer-Verlag, August 1995.
@inproceedings{mfcs1995-JW,
  author =              {Janin, David and Walukiewicz, Igor},
  title =               {Automata for the Modal {\(\mu\)}-Calculus and
                         Related Results},
  editor =              {Wiedermann, Jir{\'\i} and H{\'a}jek, Petr},
  booktitle =           {{P}roceedings of the 20th {I}nternational
                         {S}ymposium on {M}athematical {F}oundations of
                         {C}omputer {S}cience ({MFCS}'95)},
  acronym =             {{MFCS}'95},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {969},
  pages =               {552-562},
  year =                {1995},
  month =               aug,
}
[JW96] David Janin and Igor Walukiewicz. On the Expressive Completeness of the Propositional Mu-Calculus With Respect to Monadic Second Order Logic. In CONCUR'96, Lecture Notes in Computer Science 1119, pages 263-277. Springer-Verlag, August 1996.
@inproceedings{concur1996-JW,
  author =              {Janin, David and Walukiewicz, Igor},
  title =               {On the Expressive Completeness of the Propositional
                         Mu-Calculus With Respect to Monadic Second Order
                         Logic},
  editor =              {Montanari, Ugo and Sassone, Vladimiro},
  booktitle =           {{P}roceedings of the 7th {I}nternational
                         {C}onference on {C}oncurrency {T}heory
                         ({CONCUR}'96)},
  acronym =             {{CONCUR}'96},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {1119},
  pages =               {263-277},
  year =                {1996},
  month =               aug,
}