BibTeX records: Catherine Dufourd

download as .bib file

@article{DBLP:journals/tcs/BouyerDFP04,
  author       = {Patricia Bouyer and
                  Catherine Dufourd and
                  Emmanuel Fleury and
                  Antoine Petit},
  title        = {Updatable timed automata},
  journal      = {Theor. Comput. Sci.},
  volume       = {321},
  number       = {2-3},
  pages        = {291--345},
  year         = {2004},
  url          = {https://doi.org/10.1016/j.tcs.2004.04.003},
  doi          = {10.1016/J.TCS.2004.04.003},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/BouyerDFP04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ipl/BerardD00,
  author       = {B{\'{e}}atrice B{\'{e}}rard and
                  Catherine Dufourd},
  title        = {Timed automata and additive clock constraints},
  journal      = {Inf. Process. Lett.},
  volume       = {75},
  number       = {1-2},
  pages        = {1--7},
  year         = {2000},
  url          = {https://doi.org/10.1016/S0020-0190(00)00075-2},
  doi          = {10.1016/S0020-0190(00)00075-2},
  timestamp    = {Fri, 26 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ipl/BerardD00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/cav/BouyerDFP00,
  author       = {Patricia Bouyer and
                  Catherine Dufourd and
                  Emmanuel Fleury and
                  Antoine Petit},
  editor       = {E. Allen Emerson and
                  A. Prasad Sistla},
  title        = {Are Timed Automata Updatable?},
  booktitle    = {Computer Aided Verification, 12th International Conference, {CAV}
                  2000, Chicago, IL, USA, July 15-19, 2000, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {1855},
  pages        = {464--479},
  publisher    = {Springer},
  year         = {2000},
  url          = {https://doi.org/10.1007/10722167\_35},
  doi          = {10.1007/10722167\_35},
  timestamp    = {Tue, 14 May 2019 10:00:43 +0200},
  biburl       = {https://dblp.org/rec/conf/cav/BouyerDFP00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/mfcs/BouyerDFP00,
  author       = {Patricia Bouyer and
                  Catherine Dufourd and
                  Emmanuel Fleury and
                  Antoine Petit},
  editor       = {Mogens Nielsen and
                  Branislav Rovan},
  title        = {Expressiveness of Updatable Timed Automata},
  booktitle    = {Mathematical Foundations of Computer Science 2000, 25th International
                  Symposium, {MFCS} 2000, Bratislava, Slovakia, August 28 - September
                  1, 2000, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {1893},
  pages        = {232--242},
  publisher    = {Springer},
  year         = {2000},
  url          = {https://doi.org/10.1007/3-540-44612-5\_19},
  doi          = {10.1007/3-540-44612-5\_19},
  timestamp    = {Tue, 14 May 2019 10:00:37 +0200},
  biburl       = {https://dblp.org/rec/conf/mfcs/BouyerDFP00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/DufourdF99,
  author       = {Catherine Dufourd and
                  Alain Finkel},
  title        = {A Polynomial-Bisimilar Normalization for Reset Petri Nets},
  journal      = {Theor. Comput. Sci.},
  volume       = {222},
  number       = {1-2},
  pages        = {187--194},
  year         = {1999},
  url          = {https://doi.org/10.1016/S0304-3975(98)00351-X},
  doi          = {10.1016/S0304-3975(98)00351-X},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/DufourdF99.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/icalp/DufordJS99,
  author       = {Catherine Dufourd and
                  Petr Jancar and
                  Philippe Schnoebelen},
  editor       = {Jir{\'{\i}} Wiedermann and
                  Peter van Emde Boas and
                  Mogens Nielsen},
  title        = {Boundedness of Reset {P/T} Nets},
  booktitle    = {Automata, Languages and Programming, 26th International Colloquium,
                  ICALP'99, Prague, Czech Republic, July 11-15, 1999, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {1644},
  pages        = {301--310},
  publisher    = {Springer},
  year         = {1999},
  url          = {https://doi.org/10.1007/3-540-48523-6\_27},
  doi          = {10.1007/3-540-48523-6\_27},
  timestamp    = {Sat, 30 Sep 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/icalp/DufordJS99.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/icalp/DufourdFS98,
  author       = {Catherine Dufourd and
                  Alain Finkel and
                  Philippe Schnoebelen},
  editor       = {Kim Guldstrand Larsen and
                  Sven Skyum and
                  Glynn Winskel},
  title        = {Reset Nets Between Decidability and Undecidability},
  booktitle    = {Automata, Languages and Programming, 25th International Colloquium,
                  ICALP'98, Aalborg, Denmark, July 13-17, 1998, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {1443},
  pages        = {103--115},
  publisher    = {Springer},
  year         = {1998},
  url          = {https://doi.org/10.1007/BFb0055044},
  doi          = {10.1007/BFB0055044},
  timestamp    = {Tue, 14 May 2019 10:00:44 +0200},
  biburl       = {https://dblp.org/rec/conf/icalp/DufourdFS98.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/fsttcs/DufourdF97,
  author       = {Catherine Dufourd and
                  Alain Finkel},
  editor       = {S. Ramesh and
                  G. Sivakumar},
  title        = {Polynomial-Time Manz-One Reductions for Petri Nets},
  booktitle    = {Foundations of Software Technology and Theoretical Computer Science,
                  17th Conference, Kharagpur, India, December 18-20, 1997, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {1346},
  pages        = {312--326},
  publisher    = {Springer},
  year         = {1997},
  url          = {https://doi.org/10.1007/BFb0058039},
  doi          = {10.1007/BFB0058039},
  timestamp    = {Tue, 14 May 2019 10:00:51 +0200},
  biburl       = {https://dblp.org/rec/conf/fsttcs/DufourdF97.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/icci/CerinDM93,
  author       = {Christophe C{\'{e}}rin and
                  Catherine Dufourd and
                  Jean Fr{\'{e}}d{\'{e}}ric Myoupo},
  editor       = {Osman Abou{-}Rabia and
                  Carl K. Chang and
                  Waldemar W. Koczkodaj},
  title        = {An Efficient Parallel Solution for the Longest Increasing Subsequence
                  Problem},
  booktitle    = {Computing and Information - ICCI'93, Fifth International Conference
                  on Computing and Information, Sudbury, Ontario, Canada, May 27-29,
                  1993, Proceedings},
  pages        = {220--224},
  publisher    = {{IEEE} Computer Society},
  year         = {1993},
  timestamp    = {Thu, 21 Mar 2002 14:11:16 +0100},
  biburl       = {https://dblp.org/rec/conf/icci/CerinDM93.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.