Search dblp for Publications

export results for "toc:db/conf/concur/concur2011.bht:"

 download as .bib file

@inproceedings{DBLP:conf/concur/AalstAD11,
  author       = {Wil M. P. van der Aalst and
                  Arya Adriansyah and
                  Boudewijn F. van Dongen},
  editor       = {Joost{-}Pieter Katoen and
                  Barbara K{\"{o}}nig},
  title        = {Causal Nets: {A} Modeling Language Tailored towards Process Discovery},
  booktitle    = {{CONCUR} 2011 - Concurrency Theory - 22nd International Conference,
                  {CONCUR} 2011, Aachen, Germany, September 6-9, 2011. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {6901},
  pages        = {28--42},
  publisher    = {Springer},
  year         = {2011},
  url          = {https://doi.org/10.1007/978-3-642-23217-6\_3},
  doi          = {10.1007/978-3-642-23217-6\_3},
  timestamp    = {Tue, 14 May 2019 10:00:43 +0200},
  biburl       = {https://dblp.org/rec/conf/concur/AalstAD11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/concur/Abdulla11,
  author       = {Parosh Aziz Abdulla},
  editor       = {Joost{-}Pieter Katoen and
                  Barbara K{\"{o}}nig},
  title        = {Carrying Probabilities to the Infinite World},
  booktitle    = {{CONCUR} 2011 - Concurrency Theory - 22nd International Conference,
                  {CONCUR} 2011, Aachen, Germany, September 6-9, 2011. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {6901},
  pages        = {1--16},
  publisher    = {Springer},
  year         = {2011},
  url          = {https://doi.org/10.1007/978-3-642-23217-6\_1},
  doi          = {10.1007/978-3-642-23217-6\_1},
  timestamp    = {Tue, 23 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/concur/Abdulla11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/concur/AbdullaCCHHMV11,
  author       = {Parosh Aziz Abdulla and
                  Yu{-}Fang Chen and
                  Lorenzo Clemente and
                  Luk{\'{a}}s Hol{\'{\i}}k and
                  Chih{-}Duo Hong and
                  Richard Mayr and
                  Tom{\'{a}}s Vojnar},
  editor       = {Joost{-}Pieter Katoen and
                  Barbara K{\"{o}}nig},
  title        = {Advanced Ramsey-Based B{\"{u}}chi Automata Inclusion Testing},
  booktitle    = {{CONCUR} 2011 - Concurrency Theory - 22nd International Conference,
                  {CONCUR} 2011, Aachen, Germany, September 6-9, 2011. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {6901},
  pages        = {187--202},
  publisher    = {Springer},
  year         = {2011},
  url          = {https://doi.org/10.1007/978-3-642-23217-6\_13},
  doi          = {10.1007/978-3-642-23217-6\_13},
  timestamp    = {Fri, 22 Mar 2024 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/concur/AbdullaCCHHMV11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/concur/BaierKK11,
  author       = {Christel Baier and
                  Joachim Klein and
                  Sascha Kl{\"{u}}ppelholz},
  editor       = {Joost{-}Pieter Katoen and
                  Barbara K{\"{o}}nig},
  title        = {A Compositional Framework for Controller Synthesis},
  booktitle    = {{CONCUR} 2011 - Concurrency Theory - 22nd International Conference,
                  {CONCUR} 2011, Aachen, Germany, September 6-9, 2011. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {6901},
  pages        = {512--527},
  publisher    = {Springer},
  year         = {2011},
  url          = {https://doi.org/10.1007/978-3-642-23217-6\_34},
  doi          = {10.1007/978-3-642-23217-6\_34},
  timestamp    = {Wed, 25 Sep 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/concur/BaierKK11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/concur/BenediktLW11,
  author       = {Michael Benedikt and
                  Rastislav Lenhardt and
                  James Worrell},
  editor       = {Joost{-}Pieter Katoen and
                  Barbara K{\"{o}}nig},
  title        = {Two Variable vs. Linear Temporal Logic in Model Checking and Games},
  booktitle    = {{CONCUR} 2011 - Concurrency Theory - 22nd International Conference,
                  {CONCUR} 2011, Aachen, Germany, September 6-9, 2011. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {6901},
  pages        = {497--511},
  publisher    = {Springer},
  year         = {2011},
  url          = {https://doi.org/10.1007/978-3-642-23217-6\_33},
  doi          = {10.1007/978-3-642-23217-6\_33},
  timestamp    = {Thu, 14 Sep 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/concur/BenediktLW11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/concur/Bollig11,
  author       = {Benedikt Bollig},
  editor       = {Joost{-}Pieter Katoen and
                  Barbara K{\"{o}}nig},
  title        = {An Automaton over Data Words That Captures {EMSO} Logic},
  booktitle    = {{CONCUR} 2011 - Concurrency Theory - 22nd International Conference,
                  {CONCUR} 2011, Aachen, Germany, September 6-9, 2011. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {6901},
  pages        = {171--186},
  publisher    = {Springer},
  year         = {2011},
  url          = {https://doi.org/10.1007/978-3-642-23217-6\_12},
  doi          = {10.1007/978-3-642-23217-6\_12},
  timestamp    = {Tue, 23 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/concur/Bollig11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/concur/BouyerLMST11,
  author       = {Patricia Bouyer and
                  Kim G. Larsen and
                  Nicolas Markey and
                  Ocan Sankur and
                  Claus R. Thrane},
  editor       = {Joost{-}Pieter Katoen and
                  Barbara K{\"{o}}nig},
  title        = {Timed Automata Can Always Be Made Implementable},
  booktitle    = {{CONCUR} 2011 - Concurrency Theory - 22nd International Conference,
                  {CONCUR} 2011, Aachen, Germany, September 6-9, 2011. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {6901},
  pages        = {76--91},
  publisher    = {Springer},
  year         = {2011},
  url          = {https://doi.org/10.1007/978-3-642-23217-6\_6},
  doi          = {10.1007/978-3-642-23217-6\_6},
  timestamp    = {Fri, 02 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/concur/BouyerLMST11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/concur/BrazdilKKR11,
  author       = {Tom{\'{a}}s Br{\'{a}}zdil and
                  Jan Krc{\'{a}}l and
                  Jan Kret{\'{\i}}nsk{\'{y}} and
                  Vojtech Reh{\'{a}}k},
  editor       = {Joost{-}Pieter Katoen and
                  Barbara K{\"{o}}nig},
  title        = {Fixed-Delay Events in Generalized Semi-Markov Processes Revisited},
  booktitle    = {{CONCUR} 2011 - Concurrency Theory - 22nd International Conference,
                  {CONCUR} 2011, Aachen, Germany, September 6-9, 2011. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {6901},
  pages        = {140--155},
  publisher    = {Springer},
  year         = {2011},
  url          = {https://doi.org/10.1007/978-3-642-23217-6\_10},
  doi          = {10.1007/978-3-642-23217-6\_10},
  timestamp    = {Tue, 23 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/concur/BrazdilKKR11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/concur/BruniMM11,
  author       = {Roberto Bruni and
                  Hern{\'{a}}n C. Melgratti and
                  Ugo Montanari},
  editor       = {Joost{-}Pieter Katoen and
                  Barbara K{\"{o}}nig},
  title        = {A Connector Algebra for {P/T} Nets Interactions},
  booktitle    = {{CONCUR} 2011 - Concurrency Theory - 22nd International Conference,
                  {CONCUR} 2011, Aachen, Germany, September 6-9, 2011. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {6901},
  pages        = {312--326},
  publisher    = {Springer},
  year         = {2011},
  url          = {https://doi.org/10.1007/978-3-642-23217-6\_21},
  doi          = {10.1007/978-3-642-23217-6\_21},
  timestamp    = {Fri, 02 Jun 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/concur/BruniMM11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/concur/CookHOPW11,
  author       = {Byron Cook and
                  Christoph Haase and
                  Jo{\"{e}}l Ouaknine and
                  Matthew J. Parkinson and
                  James Worrell},
  editor       = {Joost{-}Pieter Katoen and
                  Barbara K{\"{o}}nig},
  title        = {Tractable Reasoning in a Fragment of Separation Logic},
  booktitle    = {{CONCUR} 2011 - Concurrency Theory - 22nd International Conference,
                  {CONCUR} 2011, Aachen, Germany, September 6-9, 2011. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {6901},
  pages        = {235--249},
  publisher    = {Springer},
  year         = {2011},
  url          = {https://doi.org/10.1007/978-3-642-23217-6\_16},
  doi          = {10.1007/978-3-642-23217-6\_16},
  timestamp    = {Sat, 16 Sep 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/concur/CookHOPW11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/concur/CrafaR11,
  author       = {Silvia Crafa and
                  Francesco Ranzato},
  editor       = {Joost{-}Pieter Katoen and
                  Barbara K{\"{o}}nig},
  title        = {A Spectrum of Behavioral Relations over LTSs on Probability Distributions},
  booktitle    = {{CONCUR} 2011 - Concurrency Theory - 22nd International Conference,
                  {CONCUR} 2011, Aachen, Germany, September 6-9, 2011. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {6901},
  pages        = {124--139},
  publisher    = {Springer},
  year         = {2011},
  url          = {https://doi.org/10.1007/978-3-642-23217-6\_9},
  doi          = {10.1007/978-3-642-23217-6\_9},
  timestamp    = {Tue, 23 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/concur/CrafaR11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/concur/CzerwinskiHL11,
  author       = {Wojciech Czerwinski and
                  Piotr Hofman and
                  Slawomir Lasota},
  editor       = {Joost{-}Pieter Katoen and
                  Barbara K{\"{o}}nig},
  title        = {Decidability of Branching Bisimulation on Normed Commutative Context-Free
                  Processes},
  booktitle    = {{CONCUR} 2011 - Concurrency Theory - 22nd International Conference,
                  {CONCUR} 2011, Aachen, Germany, September 6-9, 2011. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {6901},
  pages        = {528--542},
  publisher    = {Springer},
  year         = {2011},
  url          = {https://doi.org/10.1007/978-3-642-23217-6\_35},
  doi          = {10.1007/978-3-642-23217-6\_35},
  timestamp    = {Wed, 06 Nov 2019 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/concur/CzerwinskiHL11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/concur/DemangeonH11,
  author       = {Romain Demangeon and
                  Kohei Honda},
  editor       = {Joost{-}Pieter Katoen and
                  Barbara K{\"{o}}nig},
  title        = {Full Abstraction in a Subtyped pi-Calculus with Linear Types},
  booktitle    = {{CONCUR} 2011 - Concurrency Theory - 22nd International Conference,
                  {CONCUR} 2011, Aachen, Germany, September 6-9, 2011. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {6901},
  pages        = {280--296},
  publisher    = {Springer},
  year         = {2011},
  url          = {https://doi.org/10.1007/978-3-642-23217-6\_19},
  doi          = {10.1007/978-3-642-23217-6\_19},
  timestamp    = {Sun, 15 Jan 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/concur/DemangeonH11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/concur/FisherHNPSV11,
  author       = {Jasmin Fisher and
                  Thomas A. Henzinger and
                  Dejan Nickovic and
                  Nir Piterman and
                  Anmol V. Singh and
                  Moshe Y. Vardi},
  editor       = {Joost{-}Pieter Katoen and
                  Barbara K{\"{o}}nig},
  title        = {Dynamic Reactive Modules},
  booktitle    = {{CONCUR} 2011 - Concurrency Theory - 22nd International Conference,
                  {CONCUR} 2011, Aachen, Germany, September 6-9, 2011. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {6901},
  pages        = {404--418},
  publisher    = {Springer},
  year         = {2011},
  url          = {https://doi.org/10.1007/978-3-642-23217-6\_27},
  doi          = {10.1007/978-3-642-23217-6\_27},
  timestamp    = {Fri, 02 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/concur/FisherHNPSV11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/concur/GafniG11,
  author       = {Eli Gafni and
                  Rachid Guerraoui},
  editor       = {Joost{-}Pieter Katoen and
                  Barbara K{\"{o}}nig},
  title        = {Generalized Universality},
  booktitle    = {{CONCUR} 2011 - Concurrency Theory - 22nd International Conference,
                  {CONCUR} 2011, Aachen, Germany, September 6-9, 2011. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {6901},
  pages        = {17--27},
  publisher    = {Springer},
  year         = {2011},
  url          = {https://doi.org/10.1007/978-3-642-23217-6\_2},
  doi          = {10.1007/978-3-642-23217-6\_2},
  timestamp    = {Tue, 23 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/concur/GafniG11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/concur/GlabbeekGS11,
  author       = {Rob J. van Glabbeek and
                  Ursula Goltz and
                  Jens{-}Wolfhard Schicke},
  editor       = {Joost{-}Pieter Katoen and
                  Barbara K{\"{o}}nig},
  title        = {On Causal Semantics of Petri Nets},
  booktitle    = {{CONCUR} 2011 - Concurrency Theory - 22nd International Conference,
                  {CONCUR} 2011, Aachen, Germany, September 6-9, 2011. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {6901},
  pages        = {43--59},
  publisher    = {Springer},
  year         = {2011},
  url          = {https://doi.org/10.1007/978-3-642-23217-6\_4},
  doi          = {10.1007/978-3-642-23217-6\_4},
  timestamp    = {Tue, 23 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/concur/GlabbeekGS11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/concur/GollerL11,
  author       = {Stefan G{\"{o}}ller and
                  Anthony Widjaja Lin},
  editor       = {Joost{-}Pieter Katoen and
                  Barbara K{\"{o}}nig},
  title        = {Refining the Process Rewrite Systems Hierarchy via Ground Tree Rewrite
                  Systems},
  booktitle    = {{CONCUR} 2011 - Concurrency Theory - 22nd International Conference,
                  {CONCUR} 2011, Aachen, Germany, September 6-9, 2011. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {6901},
  pages        = {543--558},
  publisher    = {Springer},
  year         = {2011},
  url          = {https://doi.org/10.1007/978-3-642-23217-6\_36},
  doi          = {10.1007/978-3-642-23217-6\_36},
  timestamp    = {Tue, 23 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/concur/GollerL11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/concur/Hayman11,
  author       = {Jonathan Hayman},
  editor       = {Joost{-}Pieter Katoen and
                  Barbara K{\"{o}}nig},
  title        = {Granularity and Concurrent Separation Logic},
  booktitle    = {{CONCUR} 2011 - Concurrency Theory - 22nd International Conference,
                  {CONCUR} 2011, Aachen, Germany, September 6-9, 2011. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {6901},
  pages        = {219--234},
  publisher    = {Springer},
  year         = {2011},
  url          = {https://doi.org/10.1007/978-3-642-23217-6\_15},
  doi          = {10.1007/978-3-642-23217-6\_15},
  timestamp    = {Tue, 23 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/concur/Hayman11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/concur/He11,
  author       = {Chaodong He},
  editor       = {Joost{-}Pieter Katoen and
                  Barbara K{\"{o}}nig},
  title        = {The Decidability of the Reachability Problem for CCS!},
  booktitle    = {{CONCUR} 2011 - Concurrency Theory - 22nd International Conference,
                  {CONCUR} 2011, Aachen, Germany, September 6-9, 2011. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {6901},
  pages        = {373--388},
  publisher    = {Springer},
  year         = {2011},
  url          = {https://doi.org/10.1007/978-3-642-23217-6\_25},
  doi          = {10.1007/978-3-642-23217-6\_25},
  timestamp    = {Tue, 23 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/concur/He11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/concur/HerbreteauS11,
  author       = {Fr{\'{e}}d{\'{e}}ric Herbreteau and
                  B. Srivathsan},
  editor       = {Joost{-}Pieter Katoen and
                  Barbara K{\"{o}}nig},
  title        = {Coarse Abstractions Make Zeno Behaviours Difficult to Detect},
  booktitle    = {{CONCUR} 2011 - Concurrency Theory - 22nd International Conference,
                  {CONCUR} 2011, Aachen, Germany, September 6-9, 2011. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {6901},
  pages        = {92--107},
  publisher    = {Springer},
  year         = {2011},
  url          = {https://doi.org/10.1007/978-3-642-23217-6\_7},
  doi          = {10.1007/978-3-642-23217-6\_7},
  timestamp    = {Mon, 03 Jan 2022 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/concur/HerbreteauS11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/concur/HoareHMOPS11,
  author       = {C. A. R. Hoare and
                  Akbar Hussain and
                  Bernhard M{\"{o}}ller and
                  Peter W. O'Hearn and
                  Rasmus Lerchedahl Petersen and
                  Georg Struth},
  editor       = {Joost{-}Pieter Katoen and
                  Barbara K{\"{o}}nig},
  title        = {On Locality and the Exchange Law for Concurrent Processes},
  booktitle    = {{CONCUR} 2011 - Concurrency Theory - 22nd International Conference,
                  {CONCUR} 2011, Aachen, Germany, September 6-9, 2011. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {6901},
  pages        = {250--264},
  publisher    = {Springer},
  year         = {2011},
  url          = {https://doi.org/10.1007/978-3-642-23217-6\_17},
  doi          = {10.1007/978-3-642-23217-6\_17},
  timestamp    = {Tue, 23 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/concur/HoareHMOPS11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/concur/Huttel11,
  author       = {Hans H{\"{u}}ttel},
  editor       = {Joost{-}Pieter Katoen and
                  Barbara K{\"{o}}nig},
  title        = {Typed {\(\psi\)}-calculi},
  booktitle    = {{CONCUR} 2011 - Concurrency Theory - 22nd International Conference,
                  {CONCUR} 2011, Aachen, Germany, September 6-9, 2011. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {6901},
  pages        = {265--279},
  publisher    = {Springer},
  year         = {2011},
  url          = {https://doi.org/10.1007/978-3-642-23217-6\_18},
  doi          = {10.1007/978-3-642-23217-6\_18},
  timestamp    = {Mon, 15 Jun 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/concur/Huttel11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/concur/Kahlon11,
  author       = {Vineet Kahlon},
  editor       = {Joost{-}Pieter Katoen and
                  Barbara K{\"{o}}nig},
  title        = {Reasoning about Threads with Bounded Lock Chains},
  booktitle    = {{CONCUR} 2011 - Concurrency Theory - 22nd International Conference,
                  {CONCUR} 2011, Aachen, Germany, September 6-9, 2011. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {6901},
  pages        = {450--465},
  publisher    = {Springer},
  year         = {2011},
  url          = {https://doi.org/10.1007/978-3-642-23217-6\_30},
  doi          = {10.1007/978-3-642-23217-6\_30},
  timestamp    = {Tue, 23 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/concur/Kahlon11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/concur/KuhtzF11,
  author       = {Lars Kuhtz and
                  Bernd Finkbeiner},
  editor       = {Joost{-}Pieter Katoen and
                  Barbara K{\"{o}}nig},
  title        = {Weak Kripke Structures and {LTL}},
  booktitle    = {{CONCUR} 2011 - Concurrency Theory - 22nd International Conference,
                  {CONCUR} 2011, Aachen, Germany, September 6-9, 2011. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {6901},
  pages        = {419--433},
  publisher    = {Springer},
  year         = {2011},
  url          = {https://doi.org/10.1007/978-3-642-23217-6\_28},
  doi          = {10.1007/978-3-642-23217-6\_28},
  timestamp    = {Tue, 23 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/concur/KuhtzF11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/concur/LaneseMSS11,
  author       = {Ivan Lanese and
                  Claudio Antares Mezzina and
                  Alan Schmitt and
                  Jean{-}Bernard Stefani},
  editor       = {Joost{-}Pieter Katoen and
                  Barbara K{\"{o}}nig},
  title        = {Controlling Reversibility in Higher-Order Pi},
  booktitle    = {{CONCUR} 2011 - Concurrency Theory - 22nd International Conference,
                  {CONCUR} 2011, Aachen, Germany, September 6-9, 2011. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {6901},
  pages        = {297--311},
  publisher    = {Springer},
  year         = {2011},
  url          = {https://doi.org/10.1007/978-3-642-23217-6\_20},
  doi          = {10.1007/978-3-642-23217-6\_20},
  timestamp    = {Fri, 02 Jun 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/concur/LaneseMSS11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/concur/LanotteM11,
  author       = {Ruggero Lanotte and
                  Massimo Merro},
  editor       = {Joost{-}Pieter Katoen and
                  Barbara K{\"{o}}nig},
  title        = {Semantic Analysis of Gossip Protocols for Wireless Sensor Networks},
  booktitle    = {{CONCUR} 2011 - Concurrency Theory - 22nd International Conference,
                  {CONCUR} 2011, Aachen, Germany, September 6-9, 2011. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {6901},
  pages        = {156--170},
  publisher    = {Springer},
  year         = {2011},
  url          = {https://doi.org/10.1007/978-3-642-23217-6\_11},
  doi          = {10.1007/978-3-642-23217-6\_11},
  timestamp    = {Sun, 02 Jun 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/concur/LanotteM11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/concur/Leroux11,
  author       = {J{\'{e}}r{\^{o}}me Leroux},
  editor       = {Joost{-}Pieter Katoen and
                  Barbara K{\"{o}}nig},
  title        = {Vector Addition System Reversible Reachability Problem},
  booktitle    = {{CONCUR} 2011 - Concurrency Theory - 22nd International Conference,
                  {CONCUR} 2011, Aachen, Germany, September 6-9, 2011. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {6901},
  pages        = {327--341},
  publisher    = {Springer},
  year         = {2011},
  url          = {https://doi.org/10.1007/978-3-642-23217-6\_22},
  doi          = {10.1007/978-3-642-23217-6\_22},
  timestamp    = {Tue, 23 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/concur/Leroux11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/concur/OuakninePRW11,
  author       = {Jo{\"{e}}l Ouaknine and
                  Hristina Palikareva and
                  A. W. Roscoe and
                  James Worrell},
  editor       = {Joost{-}Pieter Katoen and
                  Barbara K{\"{o}}nig},
  title        = {Static Livelock Analysis in {CSP}},
  booktitle    = {{CONCUR} 2011 - Concurrency Theory - 22nd International Conference,
                  {CONCUR} 2011, Aachen, Germany, September 6-9, 2011. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {6901},
  pages        = {389--403},
  publisher    = {Springer},
  year         = {2011},
  url          = {https://doi.org/10.1007/978-3-642-23217-6\_26},
  doi          = {10.1007/978-3-642-23217-6\_26},
  timestamp    = {Mon, 18 May 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/concur/OuakninePRW11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/concur/PandyaS11,
  author       = {Paritosh K. Pandya and
                  Simoni S. Shah},
  editor       = {Joost{-}Pieter Katoen and
                  Barbara K{\"{o}}nig},
  title        = {On Expressive Powers of Timed Logics: Comparing Boundedness, Non-punctuality,
                  and Deterministic Freezing},
  booktitle    = {{CONCUR} 2011 - Concurrency Theory - 22nd International Conference,
                  {CONCUR} 2011, Aachen, Germany, September 6-9, 2011. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {6901},
  pages        = {60--75},
  publisher    = {Springer},
  year         = {2011},
  url          = {https://doi.org/10.1007/978-3-642-23217-6\_5},
  doi          = {10.1007/978-3-642-23217-6\_5},
  timestamp    = {Tue, 23 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/concur/PandyaS11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/concur/PraveenL11,
  author       = {M. Praveen and
                  Kamal Lodaya},
  editor       = {Joost{-}Pieter Katoen and
                  Barbara K{\"{o}}nig},
  title        = {Parameterized Complexity Results for 1-safe Petri Nets},
  booktitle    = {{CONCUR} 2011 - Concurrency Theory - 22nd International Conference,
                  {CONCUR} 2011, Aachen, Germany, September 6-9, 2011. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {6901},
  pages        = {358--372},
  publisher    = {Springer},
  year         = {2011},
  url          = {https://doi.org/10.1007/978-3-642-23217-6\_24},
  doi          = {10.1007/978-3-642-23217-6\_24},
  timestamp    = {Tue, 23 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/concur/PraveenL11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/concur/RodriguezSB11,
  author       = {C{\'{e}}sar Rodr{\'{\i}}guez and
                  Stefan Schwoon and
                  Paolo Baldan},
  editor       = {Joost{-}Pieter Katoen and
                  Barbara K{\"{o}}nig},
  title        = {Efficient Contextual Unfolding},
  booktitle    = {{CONCUR} 2011 - Concurrency Theory - 22nd International Conference,
                  {CONCUR} 2011, Aachen, Germany, September 6-9, 2011. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {6901},
  pages        = {342--357},
  publisher    = {Springer},
  year         = {2011},
  url          = {https://doi.org/10.1007/978-3-642-23217-6\_23},
  doi          = {10.1007/978-3-642-23217-6\_23},
  timestamp    = {Tue, 23 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/concur/RodriguezSB11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/concur/SongT11,
  author       = {Fu Song and
                  Tayssir Touili},
  editor       = {Joost{-}Pieter Katoen and
                  Barbara K{\"{o}}nig},
  title        = {Efficient {CTL} Model-Checking for Pushdown Systems},
  booktitle    = {{CONCUR} 2011 - Concurrency Theory - 22nd International Conference,
                  {CONCUR} 2011, Aachen, Germany, September 6-9, 2011. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {6901},
  pages        = {434--449},
  publisher    = {Springer},
  year         = {2011},
  url          = {https://doi.org/10.1007/978-3-642-23217-6\_29},
  doi          = {10.1007/978-3-642-23217-6\_29},
  timestamp    = {Tue, 23 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/concur/SongT11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/concur/SongZG11,
  author       = {Lei Song and
                  Lijun Zhang and
                  Jens Chr. Godskesen},
  editor       = {Joost{-}Pieter Katoen and
                  Barbara K{\"{o}}nig},
  title        = {Bisimulations Meet {PCTL} Equivalences for Probabilistic Automata},
  booktitle    = {{CONCUR} 2011 - Concurrency Theory - 22nd International Conference,
                  {CONCUR} 2011, Aachen, Germany, September 6-9, 2011. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {6901},
  pages        = {108--123},
  publisher    = {Springer},
  year         = {2011},
  url          = {https://doi.org/10.1007/978-3-642-23217-6\_8},
  doi          = {10.1007/978-3-642-23217-6\_8},
  timestamp    = {Fri, 02 Jun 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/concur/SongZG11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/concur/TorreN11,
  author       = {Salvatore La Torre and
                  Margherita Napoli},
  editor       = {Joost{-}Pieter Katoen and
                  Barbara K{\"{o}}nig},
  title        = {Reachability of Multistack Pushdown Systems with Scope-Bounded Matching
                  Relations},
  booktitle    = {{CONCUR} 2011 - Concurrency Theory - 22nd International Conference,
                  {CONCUR} 2011, Aachen, Germany, September 6-9, 2011. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {6901},
  pages        = {203--218},
  publisher    = {Springer},
  year         = {2011},
  url          = {https://doi.org/10.1007/978-3-642-23217-6\_14},
  doi          = {10.1007/978-3-642-23217-6\_14},
  timestamp    = {Fri, 02 Jun 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/concur/TorreN11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/concur/UmmelsW11,
  author       = {Michael Ummels and
                  Dominik Wojtczak},
  editor       = {Joost{-}Pieter Katoen and
                  Barbara K{\"{o}}nig},
  title        = {The Complexity of Nash Equilibria in Limit-Average Games},
  booktitle    = {{CONCUR} 2011 - Concurrency Theory - 22nd International Conference,
                  {CONCUR} 2011, Aachen, Germany, September 6-9, 2011. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {6901},
  pages        = {482--496},
  publisher    = {Springer},
  year         = {2011},
  url          = {https://doi.org/10.1007/978-3-642-23217-6\_32},
  doi          = {10.1007/978-3-642-23217-6\_32},
  timestamp    = {Fri, 02 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/concur/UmmelsW11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/concur/WangHY11,
  author       = {Farn Wang and
                  Chung{-}Hao Huang and
                  Fang Yu},
  editor       = {Joost{-}Pieter Katoen and
                  Barbara K{\"{o}}nig},
  title        = {A Temporal Logic for the Interaction of Strategies},
  booktitle    = {{CONCUR} 2011 - Concurrency Theory - 22nd International Conference,
                  {CONCUR} 2011, Aachen, Germany, September 6-9, 2011. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {6901},
  pages        = {466--481},
  publisher    = {Springer},
  year         = {2011},
  url          = {https://doi.org/10.1007/978-3-642-23217-6\_31},
  doi          = {10.1007/978-3-642-23217-6\_31},
  timestamp    = {Thu, 23 Dec 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/concur/WangHY11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/concur/2011,
  editor       = {Joost{-}Pieter Katoen and
                  Barbara K{\"{o}}nig},
  title        = {{CONCUR} 2011 - Concurrency Theory - 22nd International Conference,
                  {CONCUR} 2011, Aachen, Germany, September 6-9, 2011. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {6901},
  publisher    = {Springer},
  year         = {2011},
  url          = {https://doi.org/10.1007/978-3-642-23217-6},
  doi          = {10.1007/978-3-642-23217-6},
  isbn         = {978-3-642-23216-9},
  timestamp    = {Tue, 14 May 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/concur/2011.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics