P
[Pan01] Paritosh K. Pandya. Specifying and deciding quantified discrete-time duration calculus formulae using DCVALID. In RT-TOOLS'01. August 2001. 
@inproceedings{rttools2001-Pan,
  author =              {Pandya, Paritosh K.},
  title =               {Specifying and deciding quantified discrete-time
                         duration calculus formulae using {DCVALID}},
  editor =              {Pettersson, Paul and Yovine, Sergio},
  booktitle =           {{P}roceedings of the 1st {W}orkshop on {R}eal-Time
                         {T}ools ({RT-TOOLS}'01)},
  acronym =             {{RT-TOOLS}'01},
  year =                {2001},
  month =               aug,
}
[Pap84] Christos H. Papadimitriou. On the Complexity of Unique Solutions. Journal of the ACM 31(2):392-400. ACM Press, April 1984. 
@article{jacm31(2)-Pap,
  author =              {Papadimitriou, {\relax Ch}ristos H.},
  title =               {On the Complexity of Unique Solutions},
  publisher =           {ACM Press},
  journal =             {Journal of the~ACM},
  volume =              {31},
  number =              {2},
  pages =               {392-400},
  year =                {1984},
  month =               apr,
}
[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},
}
[Pap07] Christos H. Papadimitriou. The complexity of finding Nash equilibria. In Noam Nisan, Tim Roughgarden, Éva Tardos, and Vijay V. Vazirani (eds.), Algorithmic Game Theory. Cambridge University Press, 2007. 
@incollection{agt2007-Pap,
  author =              {Papadimitriou, {\relax Ch}ristos H.},
  title =               {The complexity of finding {N}ash equilibria},
  editor =              {Nisan, Noam and Roughgarden, Tim and Tardos, {\'E}va
                         and Vazirani, Vijay V.},
  booktitle =           {Algorithmic Game Theory},
  publisher =           {Cambridge University Press},
  pages =               {29-51},
  chapter =             {2},
  year =                {2007},
}
[Par81] David Michael Ritchie Park. Concurrency and Automata on Infinite Sequences. In TCS'81, Lecture Notes in Computer Science 104, pages 167-183. Springer-Verlag, March 1981. 
@inproceedings{gitcs1981-Park,
  author =              {Park, David Michael Ritchie},
  title =               {Concurrency and Automata on Infinite Sequences},
  editor =              {Deussen, Peter},
  booktitle =           {{P}roceedings of the 5th {GI}-{C}onference on
                         {T}heoretical {C}omputer {S}cience ({TCS}'81)},
  acronym =             {{TCS}'81},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {104},
  pages =               {167-183},
  year =                {1981},
  month =               mar,
}
[PBD+02] Anindya C. Patthak, Indrajit Bhattacharya, Anirban Dasgupta, Pallab Dasgupta, and P. P. Chakrabarti. Quantified Computation Tree Logic. Information Processing Letters 82(3):123-129. Elsevier, 2002. 
@article{ipl82(3)-PBDDC,
  author =              {Patthak, Anindya C. and Bhattacharya, Indrajit and
                         Dasgupta, Anirban and Dasgupta, Pallab and
                         Chakrabarti, P. P.},
  title =               {Quantified Computation Tree Logic},
  publisher =           {Elsevier},
  journal =             {Information Processing Letters},
  volume =              {82},
  number =              {3},
  pages =               {123-129},
  year =                {2002},
}
[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},
}
[Pet62] Carl Adam Petri. Kommunikation mit Automaten. PhD thesis, Darmstadt University of Technology, Germany, 1962. 
@phdthesis{phd-petri,
  author =              {Petri, Carl Adam},
  title =               {Kommunikation mit Automaten},
  year =                {1962},
  school =              {Darmstadt University of Technology, Germany},
}
[Pet02] Holger Petersen. Expressions with Intersection Is Complete in LOGCFL. In STACS'02, Lecture Notes in Computer Science 2285, pages 513-522. Springer-Verlag, March 2002. 
@inproceedings{stacs2002-Pet,
  author =              {Petersen, Holger},
  title =               {Expressions with Intersection Is Complete in
                         {LOGCFL}},
  editor =              {Alt, Helmut and Ferreira, Afonso},
  booktitle =           {{P}roceedings of the 19th {S}ymposium on
                         {T}heoretical {A}spects of {C}omputer {S}cience
                         ({STACS}'02)},
  acronym =             {{STACS}'02},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {2285},
  pages =               {513-522},
  year =                {2002},
  month =               mar,
}
[PHP11] Amalinda Post, Jochen Hoenicke, and Andreas Podelski. RT-Inconsistency: A New Property for Real-Time Requirements. In FASE'11, Lecture Notes in Computer Science 6603, pages 34-49. Springer-Verlag, March 2011. 
@inproceedings{fase2011-PHP,
  author =              {Post, Amalinda and Hoenicke, Jochen and Podelski,
                         Andreas},
  title =               {RT-Inconsistency: A~New Property for Real-Time
                         Requirements},
  editor =              {Giannakopoulou, Dimitra and Orejas, Fernando},
  booktitle =           {{P}roceedings of the 14th {I}nternational
                         {C}onference on {F}undamental {A}pproaches to
                         {S}oftware {E}ngineering ({FASE}'11)},
  acronym =             {{FASE}'11},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {6603},
  pages =               {34-49},
  year =                {2011},
  month =               mar,
  doi =                 {978-3-642-19811-3_4},
}
[PI97] Sushant Patnaik and Neil Immerman. Dyn-FO: A Parallel, Dynamic Complexity Class. Journal of Computer and System Sciences 55(2):199-209. Academic Press, October 1997. 
@article{jcss55(2)-PI,
  author =              {Patnaik, Sushant and Immerman, Neil},
  title =               {Dyn-{FO}: A~Parallel, Dynamic Complexity Class},
  publisher =           {Academic Press},
  journal =             {Journal of Computer and System Sciences},
  volume =              {55},
  number =              {2},
  pages =               {199-209},
  year =                {1997},
  month =               oct,
  doi =                 {10.1006/jcss.1997.1520},
}
[Pig20] Arthur C. Pigou. The economics of welfare. MacMillan and Co., 1920. 
@book{Pigou1920,
  author =              {Pigou, Arthur C.},
  title =               {The~economics of welfare},
  publisher =           {MacMillan and Co.},
  year =                {1920},
}
[Pin83] Jean-Éric Pin. On two combinatorial problems arising from automata theory. In ICGTC'81, North-Holland Mathematics Studies 75, pages 535-548. Elsevier, 1983. 
@inproceedings{icgtc1981-Pin,
  author =              {Pin, Jean-{\'E}ric},
  title =               {On two combinatorial problems arising from automata
                         theory},
  booktitle =           {{P}roceedings of the {I}nternational {C}olloquium on
                         {G}raph {T}heory and {C}ombinatorics ({ICGTC}'81)},
  acronym =             {{ICGTC}'81},
  publisher =           {Elsevier},
  series =              {North-Holland Mathematics Studies},
  volume =              {75},
  pages =               {535-548},
  year =                {1983},
  confyear =            {1981},
  confmonth =           {6},
  doi =                 {10.1016/S0304-0208(08)73432-7},
}
[Pin96] Jean-Éric Pin. Logic, Semigroups and Automata on Words. Annals of Mathematics and Artificial Intelligence 16:343-384. Kluwer Academic, 1996. 
@article{amai16()-Pin,
  author =              {Pin, Jean-{\'E}ric},
  title =               {Logic, Semigroups and Automata on Words},
  publisher =           {Kluwer Academic},
  journal =             {Annals of Mathematics and Artificial Intelligence},
  volume =              {16},
  pages =               {343-384},
  year =                {1996},
}
[Pin01] Jean-Éric Pin. Logic on Words. In Gheorghe Păun, Grzegorz Rozenberg, and Arto Salomaa (eds.), Current Trends in Theoretical Computer Science: Entering the 21th Century. World Scientific, 2001. 
@incollection{CTTCS2001-Pin,
  author =              {Pin, Jean-{\'E}ric},
  title =               {Logic on Words},
  editor =              {P{\u a}un, Gheorghe and Rozenberg, Grzegorz and
                         Salomaa, Arto},
  booktitle =           {Current Trends in Theoretical Computer Science:
                         Entering the 21th Century},
  publisher =           {World Scientific},
  pages =               {254-273},
  year =                {2001},
}
[Pin07] Sophie Pinchinat. A Generic constructive Solution for Concurrent Games with Expressive Constraints on Strategies. In ATVA'07, Lecture Notes in Computer Science 4762, pages 253-267. Springer-Verlag, October 2007. 
@inproceedings{atva2007-Pin,
  author =              {Pinchinat, Sophie},
  title =               {A Generic constructive Solution for Concurrent Games
                         with Expressive Constraints on Strategies},
  editor =              {Namjoshi, Kedar and Yoneda, Tomohiro and Higashino,
                         Teruo and Okamura, Yoshio},
  booktitle =           {{P}roceedings of the 5th {I}nternational {S}ymposium
                         on {A}utomated {T}echnology for {V}erification and
                         {A}nalysis ({ATVA}'07)},
  acronym =             {{ATVA}'07},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {4762},
  pages =               {253-267},
  year =                {2007},
  month =               oct,
}
[Pin07] Sophie Pinchinat. Quantified Mu-Calculus with Decision Modalities for Concurrent Game Structures. Technical Report TR-CS-07-02, The Australian National University, Australia, January 2007. 
@techreport{TRCS0702-Pin,
  author =              {Pinchinat, Sophie},
  title =               {Quantified Mu-Calculus with Decision Modalities for
                         Concurrent Game Structures},
  number =              {TR-CS-07-02},
  year =                {2007},
  month =               jan,
  institution =         {The Australian National University, Australia},
}
[Pin21] Jean-Éric Pin. Handbook of automata theory. EMS Press, 2021. 
@book{hat-pin-1,
  title =               {Handbook of automata theory},
  editor =              {Pin, Jean-{\'E}ric},
  booktitle =           {Handbook of automata theory},
  publisher =           {EMS~Press},
  volume =              {1},
  year =                {2021},
  doi =                 {10.4171/AUTOMATA-1},
}
[PK02] Amir Pnueli and Yonit Kesten. A Deductive Proof System for CTL. In CONCUR'02, Lecture Notes in Computer Science 2421, pages 24-40. Springer-Verlag, August 2002. 
@inproceedings{concur2002-PK,
  author =              {Pnueli, Amir and Kesten, Yonit},
  title =               {A~Deductive Proof System for~{CTL}},
  editor =              {Brim, Lubo{\v s} and Jan{\v c}ar, Petr and K{\v
                         r}et{\'\i}nsk{\'y}, Mojm{\'\i}r and Ku{\v c}era,
                         Anton{\'\i}n},
  booktitle =           {{P}roceedings of the 13th {I}nternational
                         {C}onference on {C}oncurrency {T}heory
                         ({CONCUR}'02)},
  acronym =             {{CONCUR}'02},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {2421},
  pages =               {24-40},
  year =                {2002},
  month =               aug,
}
[Pnu77] Amir Pnueli. The Temporal Logic of Programs. In FOCS'77, pages 46-57. IEEE Comp. Soc. Press, October 1977. 
@inproceedings{focs1977-Pnu,
  author =              {Pnueli, Amir},
  title =               {The Temporal Logic of Programs},
  booktitle =           {{P}roceedings of the 18th {A}nnual {S}ymposium on
                         {F}oundations of {C}omputer {S}cience ({FOCS}'77)},
  acronym =             {{FOCS}'77},
  publisher =           {IEEE Comp. Soc. Press},
  pages =               {46-57},
  year =                {1977},
  month =               oct,
  doi =                 {10.1109/SFCS.1977.32},
}
[Pnu81] Amir Pnueli. The Temporal Semantics of Concurrent Programs. Theoretical Computer Science 13:45-60. Elsevier, 1981. 
@article{tcs13()-Pnu,
  author =              {Pnueli, Amir},
  title =               {The Temporal Semantics of Concurrent Programs},
  publisher =           {Elsevier},
  journal =             {Theoretical Computer Science},
  volume =              {13},
  pages =               {45-60},
  year =                {1981},
}
[PP95] Dominique Perrin and Jean-Éric Pin. Semigroups and Automata on Infinite Words. In John B. Fountain and Victoria Gould (eds.), NATO Advanced Study Institute: Semigroups, Formal Languages and Groups. Kluwer Academic, 1995. 
@incollection{SFLG1995-PP,
  author =              {Perrin, Dominique and Pin, Jean-{\'E}ric},
  title =               {Semigroups and Automata on Infinite Words},
  editor =              {Fountain, John B. and Gould, Victoria},
  booktitle =           {{NATO} Advanced Study Institute: Semigroups, Formal
                         Languages and Groups},
  publisher =           {Kluwer Academic},
  pages =               {49-72},
  year =                {1995},
}
[PPQ05] Davide Prandi, Corrado Priami, and Paola Quaglia. Process Calculi in a Biological Context. EATCS Bulletin 85:53-69. EATCS, February 2005. 
@article{eatcs-bull85()-PPQ,
  author =              {Prandi, Davide and Priami, Corrado and Quaglia,
                         Paola},
  title =               {Process Calculi in a Biological Context},
  publisher =           {EATCS},
  journal =             {EATCS Bulletin},
  volume =              {85},
  pages =               {53-69},
  year =                {2005},
  month =               feb,
}
[PPT09] Michal Penn, Maria Polukarov, and Moshe Tennenholtz. Random Order Congestion Games. Mathematics of Operations Research 34(3):706-725. Informs, August 2009. 
@article{moor34(3)-PPT,
  author =              {Penn, Michal and Polukarov, Maria and Tennenholtz,
                         Moshe},
  title =               {Random Order Congestion Games},
  publisher =           {Informs},
  journal =             {Mathematics of Operations Research},
  volume =              {34},
  number =              {3},
  pages =               {706-725},
  year =                {2009},
  month =               aug,
  doi =                 {10.1287/moor.1090.0394},
}
[PPT+16] Srinivas Pinisetty, Viorel Preoteasa, Stavros Tripakis, Thierry Jéron, Yliès Falcone, and Hervé Marchand. Predictive Runtime Enforcement. In SAC'16, pages 1628-1633. ACM Press, April 2016. 
@inproceedings{sac2016-PPTJFM,
  author =              {Pinisetty, Srinivas and Preoteasa, Viorel and
                         Tripakis, Stavros and J{\'e}ron, Thierry and
                         Falcone, Yli{\`e}s and Marchand, Herv{\'e}},
  title =               {Predictive Runtime Enforcement},
  editor =              {Ossowski, Sascha},
  booktitle =           {{P}roceedings of the 31st {A}nnual {ACM} {S}ymposium
                         on {A}pplied {C}omputing ({SAC}'16)},
  acronym =             {{SAC}'16},
  publisher =           {ACM Press},
  pages =               {1628-1633},
  year =                {2016},
  month =               apr,
  doi =                 {10.1145/2851613.2851827},
}
[PR89] Amir Pnueli and Roni Rosner. On the Synthesis of a Reactive Module. In POPL'89, pages 179-190. ACM Press, January 1989. 
@inproceedings{popl1989-PR,
  author =              {Pnueli, Amir and Rosner, Roni},
  title =               {On the Synthesis of a Reactive Module},
  booktitle =           {Conference Record of the 16th {ACM} {S}ymposium on
                         {P}rinciples of {P}rogramming {L}anguages
                         ({POPL}'89)},
  acronym =             {{POPL}'89},
  publisher =           {ACM Press},
  pages =               {179-190},
  year =                {1989},
  month =               jan,
}
[PR89] Amir Pnueli and Roni Rosner. On the Synthesis of an Asynchronous Reactive Module. In ICALP'89, Lecture Notes in Computer Science 372, pages 652-671. Springer-Verlag, July 1989. 
@inproceedings{icalp1989-PR,
  author =              {Pnueli, Amir and Rosner, Roni},
  title =               {On the Synthesis of an Asynchronous Reactive Module},
  editor =              {Ausiello, Giorgio and Dezani{-}Ciancaglini,
                         Mariangiola and Ronchi{ }Della{~}Rocca, Simona},
  booktitle =           {{P}roceedings of the 16th {I}nternational
                         {C}olloquium on {A}utomata, {L}anguages and
                         {P}rogramming ({ICALP}'89)},
  acronym =             {{ICALP}'89},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {372},
  pages =               {652-671},
  year =                {1989},
  month =               jul,
}
[PR90] Amir Pnueli and Roni Rosner. Distributed Reactive Systems Are Hard to Synthesize. In FOCS'90, pages 746-757. IEEE Comp. Soc. Press, October 1990. 
@inproceedings{focs1990-PR,
  author =              {Pnueli, Amir and Rosner, Roni},
  title =               {Distributed Reactive Systems Are Hard to Synthesize},
  booktitle =           {{P}roceedings of the 31st {A}nnual {S}ymposium on
                         {F}oundations of {C}omputer {S}cience ({FOCS}'90)},
  acronym =             {{FOCS}'90},
  publisher =           {IEEE Comp. Soc. Press},
  pages =               {746-757},
  year =                {1990},
  month =               oct,
}
[PR99] Wojciech Plandowski and Wojciech Rytter. Complexity of Language Recognition Problems for Compressed Words. In Juhani Karhumäki, Hermann Maurer, Gheorghe Păun, and Grzegorz Rozenberg (eds.), Jewels are Forever – Contributions on Theoretical Computer Science in Honor of Arto Salomaa. Springer-Verlag, 1999. 
@incollection{jaf1999-PR,
  author =              {Plandowski, Wojciech and Rytter, Wojciech},
  title =               {Complexity of Language Recognition Problems for
                         Compressed Words},
  editor =              {Karhum{\"a}ki, Juhani and Maurer, Hermann and P{\u
                         a}un, Gheorghe and Rozenberg, Grzegorz},
  booktitle =           {Jewels are Forever~-- Contributions on Theoretical
                         Computer Science in Honor of {A}rto {S}alomaa},
  publisher =           {Springer-Verlag},
  pages =               {262-272},
  year =                {1999},
}
[Pri57] Arthur N. Prior. Time and Modality. Oxford University Press, 1957. 
@book{Prior-1957,
  author =              {Prior, Arthur N.},
  title =               {Time and Modality},
  publisher =           {Oxford University Press},
  year =                {1957},
}
[Pri67] Arthur N. Prior. Past, Present and Future. Oxford University Press, 1967. 
@book{Prior-1967,
  author =              {Prior, Arthur N.},
  title =               {Past, Present and Future},
  publisher =           {Oxford University Press},
  year =                {1967},
}
[Pri68] Arthur N. Prior. Papers on Time and Tense. Oxford University Press, 1968. 
@book{Prior-1968,
  author =              {Prior, Arthur N.},
  title =               {Papers on Time and Tense},
  publisher =           {Oxford University Press},
  year =                {1968},
}
[PS05] Radek Pelánek and Jan Strejček. Deeper Connections Between LTL and Alternating Automata.. In CIAA'05, Lecture Notes in Computer Science 3845, pages 238-249. Springer-Verlag, June 2005. 
@inproceedings{ciaa2005-PS,
  author =              {Pel{\'a}nek, Radek and Strej{\v c}ek, Jan},
  title =               {Deeper Connections Between {LTL} and Alternating
                         Automata.},
  editor =              {Farr{\'e}, Jacques and Litovsky, Igor and Schmitz,
                         Sylvain},
  booktitle =           {{R}evised {S}elected {P}apers of the 10th
                         {I}nternational {C}onference on Implementation and
                         Application of Automata ({CIAA}'05)},
  acronym =             {{CIAA}'05},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {3845},
  pages =               {238-249},
  year =                {2005},
  month =               jun,
}
[PS10] Soumya Paul and Sunil Simon. Nash Equilibrium in Generalised Muller Games. In FSTTCS'09, Leibniz International Proceedings in Informatics 4, pages 335-346. Leibniz-Zentrum für Informatik, December 2010. 
@inproceedings{fsttcs2009-PS,
  author =              {Paul, Soumya and Simon, Sunil},
  title =               {{N}ash Equilibrium in Generalised {M}uller Games},
  editor =              {Kannan, Ravi and Narayan Kumar, K.},
  booktitle =           {{P}roceedings of the 29th {C}onference on
                         {F}oundations of {S}oftware {T}echnology and
                         {T}heoretical {C}omputer {S}cience ({FSTTCS}'09)},
  acronym =             {{FSTTCS}'09},
  publisher =           {Leibniz-Zentrum f{\"u}r Informatik},
  series =              {Leibniz International Proceedings in Informatics},
  volume =              {4},
  pages =               {335-346},
  year =                {2010},
  month =               dec,
}
[PS11] Paritosh K. Pandya and Simoni S. Shah. On Expressive Powers of Timed Logics: Comparing Boundedness, Non-punctuality, and Deterministic Freezing. In CONCUR'11, Lecture Notes in Computer Science 6901, pages 60-75. Springer-Verlag, September 2011. 
@inproceedings{concur2011-PS,
  author =              {Pandya, Paritosh K. and Shah, Simoni S.},
  title =               {On Expressive Powers of Timed Logics: Comparing
                         Boundedness, Non-punctuality, and Deterministic
                         Freezing},
  editor =              {Katoen, Joost-Pieter and K{\"o}nig, Barbara},
  booktitle =           {{P}roceedings of the 22nd {I}nternational
                         {C}onference on {C}oncurrency {T}heory
                         ({CONCUR}'11)},
  acronym =             {{CONCUR}'11},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {6901},
  pages =               {60-75},
  year =                {2011},
  month =               sep,
  doi =                 {10.1007/978-3-642-23217-6_5},
}
[PS16] Nicolas Perrin and Philipp Schlehuber-Caissier. Fast diffeomorphic matching to learn globally asymptotically stable nonlinear dynamical systems. Systems & Control Letters 96:51-59. Elsevier, October 2016. 
@article{scl96()-PS,
  author =              {Perrin, Nicolas and Schlehuber{-}Caissier, Philipp},
  title =               {Fast diffeomorphic matching to learn globally
                         asymptotically stable nonlinear dynamical systems},
  publisher =           {Elsevier},
  journal =             {Systems~\& Control Letters},
  volume =              {96},
  pages =               {51-59},
  year =                {2016},
  month =               oct,
  doi =                 {10.1016/j.sysconle.2016.06.018},
}
[PSS+03] Matteo Pradella, Pierluigi San Pietro, Paola Spoletini, and Angelo Morzenti. Practical Model Checking of LTL with Past. In ATVA'03. December 2003. 
@inproceedings{atva2003-PSSM,
  author =              {Pradella, Matteo and San{~}Pietro, Pierluigi and
                         Spoletini, Paola and Morzenti, Angelo},
  title =               {Practical Model Checking of {LTL} with Past},
  booktitle =           {{P}roceedings of the 1st {I}nternational {W}orkshop
                         on {A}utomated {T}echnology for {V}erification and
                         {A}nalysis ({ATVA}'03)},
  acronym =             {{ATVA}'03},
  year =                {2003},
  month =               dec,
}
[PST12] Renato Paes Leme, Vasilis Syrgkanis, and Éva Tardos. The curse of simultaneity. In ITCS'12, pages 60-67. ACM Press, January 2012. 
@inproceedings{itcs2012-PST,
  author =              {Paes{ }Leme, Renato and Syrgkanis, Vasilis and
                         Tardos, {\'E}va},
  title =               {The curse of simultaneity},
  editor =              {Goldwasser, Shafi},
  booktitle =           {{P}roceedings of the 3rd {C}onference on
                         {I}nnovations in {T}heoretical {C}omputer {S}cience
                         ({ITCS}'12)},
  acronym =             {{ITCS}'12},
  publisher =           {ACM Press},
  pages =               {60-67},
  year =                {2012},
  month =               jan,
  doi =                 {10.1145/2090236.2090242},
}
[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,
}
[Pur99] Anuj Puri. An Undecidable Problem for Timed Automata. Discrete Event Dynamic Systems 9(2):135-146. Kluwer Academic, May 1999. 
@article{deds9(2)-Pur,
  author =              {Puri, Anuj},
  title =               {An Undecidable Problem for Timed Automata},
  publisher =           {Kluwer Academic},
  journal =             {Discrete Event Dynamic Systems},
  volume =              {9},
  number =              {2},
  pages =               {135-146},
  year =                {1999},
  month =               may,
}
[Pur00] Anuj Puri. Dynamical Properties of Timed Systems. Discrete Event Dynamic Systems 10(1-2):87-113. Kluwer Academic, January 2000. 
@article{deds10(1-2)-Pur,
  author =              {Puri, Anuj},
  title =               {Dynamical Properties of Timed Systems},
  publisher =           {Kluwer Academic},
  journal =             {Discrete Event Dynamic Systems},
  volume =              {10},
  number =              {1-2},
  pages =               {87-113},
  year =                {2000},
  month =               jan,
  doi =                 {10.1023/A:1008387132377},
}
[PV01] Nir Piterman and Moshe Y. Vardi. From Bidirectionality to Alternation. In MFCS'01, Lecture Notes in Computer Science 2136, pages 598-610. Springer-Verlag, August 2001. 
@inproceedings{mfcs2001-PV,
  author =              {Piterman, Nir and Vardi, Moshe Y.},
  title =               {From Bidirectionality to Alternation},
  editor =              {Sgall, Ji{\v r}{\'\i} and Pultr, Ales and Kolman,
                         Petr},
  booktitle =           {{P}roceedings of the 26th {I}nternational
                         {S}ymposium on {M}athematical {F}oundations of
                         {C}omputer {S}cience ({MFCS}'01)},
  acronym =             {{MFCS}'01},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {2136},
  pages =               {598-610},
  year =                {2001},
  month =               aug,
}
[PV03] Nir Piterman and Moshe Y. Vardi. From Bidirectionality to Alternation. Theoretical Computer Science 295(1-3):295-321. Elsevier, February 2003. 
@article{tcs295(1-3)-PV,
  author =              {Piterman, Nir and Vardi, Moshe Y.},
  title =               {From Bidirectionality to Alternation},
  publisher =           {Elsevier},
  journal =             {Theoretical Computer Science},
  volume =              {295},
  number =              {1-3},
  pages =               {295-321},
  year =                {2003},
  month =               feb,
}
[PW97] Doron A. Peled and Thomas Wilke. Stutter-Invariant Temporal Properties are Expressible Without the Next-time Operator. Information Processing Letters 63(5):243-246. Elsevier, 1997. 
@article{ipl63(5)-PW,
  author =              {Peled, Doron A. and Wilke, Thomas},
  title =               {Stutter-Invariant Temporal Properties are
                         Expressible Without the Next-time Operator},
  publisher =           {Elsevier},
  journal =             {Information Processing Letters},
  volume =              {63},
  number =              {5},
  pages =               {243-246},
  year =                {1997},
}
[PXZ02] Amir Pnueli, Jessie Xu, and Lenore D. Zuck. Liveness with (0,1,infty)-Counter Abstraction. In CAV'02, Lecture Notes in Computer Science 2404, pages 107-122. Springer-Verlag, July 2002. 
@inproceedings{cav2002-PXZ,
  author =              {Pnueli, Amir and Xu, Jessie and Zuck, Lenore D.},
  title =               {Liveness with {{\((0,1,infty)\)}}-Counter
                         Abstraction},
  editor =              {Brinksma, Ed and Larsen, Kim Guldstrand},
  booktitle =           {{P}roceedings of the 14th {I}nternational
                         {C}onference on {C}omputer {A}ided {V}erification
                         ({CAV}'02)},
  acronym =             {{CAV}'02},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {2404},
  pages =               {107-122},
  year =                {2002},
  month =               jul,
  doi =                 {10.1007/3-540-45657-0_9},
}
[PY82] Christos H. Papadimitriou and Mihalis Yannakakis. The Complexity of Facets (and Some Facets of Complexity). In STOC'82, pages 255-260. ACM Press, May 1982. 
@inproceedings{stoc1982-PY,
  author =              {Papadimitriou, {\relax Ch}ristos H. and Yannakakis,
                         Mihalis},
  title =               {The Complexity of Facets (and Some Facets of
                         Complexity)},
  booktitle =           {{P}roceedings of the 14th {A}nnual {ACM} {S}ymposium
                         on the {T}heory of {C}omputing ({STOC}'82)},
  acronym =             {{STOC}'82},
  publisher =           {ACM Press},
  pages =               {255-260},
  year =                {1982},
  month =               may,
}
[PZ93] Amir Pnueli and Lenore D. Zuck. In and Out of Temporal Logic. In LICS'93, pages 124-135. IEEE Comp. Soc. Press, June 1993. 
@inproceedings{lics1993-PZ,
  author =              {Pnueli, Amir and Zuck, Lenore D.},
  title =               {In and Out of Temporal Logic},
  booktitle =           {{P}roceedings of the 8th {A}nnual {S}ymposium on
                         {L}ogic in {C}omputer {S}cience ({LICS}'93)},
  acronym =             {{LICS}'93},
  publisher =           {IEEE Comp. Soc. Press},
  pages =               {124-135},
  year =                {1993},
  month =               jun,
}
[PZM+04] Dan Pei, Beichuan Zhang, Dan Massey, and Lixia Zhang. An Analysis of Path-Vector Routing Protocol Convergence Algorithms. Technical Report TR040009, Computer Science Department, University of California at Los Angeles, USA, March 2004. 
@techreport{UCLA-TR040009,
  author =              {Pei, Dan and Zhang, Beichuan and Massey, Dan and
                         Zhang, Lixia},
  title =               {An Analysis of Path-Vector Routing Protocol
                         Convergence Algorithms},
  number =              {TR040009},
  year =                {2004},
  month =               mar,
  institution =         {Computer Science Department, University of
                         California at Los~Angeles, USA},
  type =                {Technical Report},
}
List of authors