Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSearch dblp for Publications
export results for "toc:db/conf/concur/concur2000.bht:"
download as .bib file
@inproceedings{DBLP:conf/concur/AbdullaBIJ00,
author = {Parosh Aziz Abdulla and
Christel Baier and
S. Purushothaman Iyer and
Bengt Jonsson},
editor = {Catuscia Palamidessi},
title = {Reasoning about Probabilistic Lossy Channel Systems},
booktitle = {{CONCUR} 2000 - Concurrency Theory, 11th International Conference,
University Park, PA, USA, August 22-25, 2000, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1877},
pages = {320--333},
publisher = {Springer},
year = {2000},
url = {https://doi.org/10.1007/3-540-44618-4\_24},
doi = {10.1007/3-540-44618-4\_24},
timestamp = {Tue, 31 Aug 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/concur/AbdullaBIJ00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/concur/Abraham-MummB00,
author = {Erika {\'{A}}brah{\'{a}}m{-}Mumm and
Frank S. de Boer},
editor = {Catuscia Palamidessi},
title = {Proof-Outlines for Threads in Java},
booktitle = {{CONCUR} 2000 - Concurrency Theory, 11th International Conference,
University Park, PA, USA, August 22-25, 2000, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1877},
pages = {229--242},
publisher = {Springer},
year = {2000},
url = {https://doi.org/10.1007/3-540-44618-4\_18},
doi = {10.1007/3-540-44618-4\_18},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/concur/Abraham-MummB00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/concur/AlfaroHM00,
author = {Luca de Alfaro and
Thomas A. Henzinger and
Freddy Y. C. Mang},
editor = {Catuscia Palamidessi},
title = {The Control of Synchronous Systems},
booktitle = {{CONCUR} 2000 - Concurrency Theory, 11th International Conference,
University Park, PA, USA, August 22-25, 2000, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1877},
pages = {458--473},
publisher = {Springer},
year = {2000},
url = {https://doi.org/10.1007/3-540-44618-4\_33},
doi = {10.1007/3-540-44618-4\_33},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/concur/AlfaroHM00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/concur/Alur00,
author = {Rajeev Alur},
editor = {Catuscia Palamidessi},
title = {Exploiting Hierarchical Structure for Efficient Formal Verification},
booktitle = {{CONCUR} 2000 - Concurrency Theory, 11th International Conference,
University Park, PA, USA, August 22-25, 2000, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1877},
pages = {66--68},
publisher = {Springer},
year = {2000},
url = {https://doi.org/10.1007/3-540-44618-4\_6},
doi = {10.1007/3-540-44618-4\_6},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/concur/Alur00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/concur/AmadioL00,
author = {Roberto M. Amadio and
Denis Lugiez},
editor = {Catuscia Palamidessi},
title = {On the Reachability Problem in Cryptographic Protocols},
booktitle = {{CONCUR} 2000 - Concurrency Theory, 11th International Conference,
University Park, PA, USA, August 22-25, 2000, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1877},
pages = {380--394},
publisher = {Springer},
year = {2000},
url = {https://doi.org/10.1007/3-540-44618-4\_28},
doi = {10.1007/3-540-44618-4\_28},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/concur/AmadioL00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/concur/BaldanBCP00,
author = {Paolo Baldan and
Nadia Busi and
Andrea Corradini and
G. Michele Pinna},
editor = {Catuscia Palamidessi},
title = {Functorial Concurrent Semantics for Petri Nets with Read and Inhibitor
Arcs},
booktitle = {{CONCUR} 2000 - Concurrency Theory, 11th International Conference,
University Park, PA, USA, August 22-25, 2000, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1877},
pages = {442--457},
publisher = {Springer},
year = {2000},
url = {https://doi.org/10.1007/3-540-44618-4\_32},
doi = {10.1007/3-540-44618-4\_32},
timestamp = {Sat, 04 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/concur/BaldanBCP00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/concur/BernardoC00,
author = {Marco Bernardo and
Rance Cleaveland},
editor = {Catuscia Palamidessi},
title = {A Theory of Testing for Markovian Processes},
booktitle = {{CONCUR} 2000 - Concurrency Theory, 11th International Conference,
University Park, PA, USA, August 22-25, 2000, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1877},
pages = {305--319},
publisher = {Springer},
year = {2000},
url = {https://doi.org/10.1007/3-540-44618-4\_23},
doi = {10.1007/3-540-44618-4\_23},
timestamp = {Wed, 25 Jul 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/concur/BernardoC00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/concur/BoerEHM00,
author = {Frank S. de Boer and
Rogier M. van Eijk and
Wiebe van der Hoek and
John{-}Jules Ch. Meyer},
editor = {Catuscia Palamidessi},
title = {Failure Semantics for the Exchange of Information in Multi-Agent Systems},
booktitle = {{CONCUR} 2000 - Concurrency Theory, 11th International Conference,
University Park, PA, USA, August 22-25, 2000, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1877},
pages = {214--228},
publisher = {Springer},
year = {2000},
url = {https://doi.org/10.1007/3-540-44618-4\_17},
doi = {10.1007/3-540-44618-4\_17},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/concur/BoerEHM00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/concur/Brinksma00,
author = {Ed Brinksma},
editor = {Catuscia Palamidessi},
title = {Verification Is Experimentation!},
booktitle = {{CONCUR} 2000 - Concurrency Theory, 11th International Conference,
University Park, PA, USA, August 22-25, 2000, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1877},
pages = {17--24},
publisher = {Springer},
year = {2000},
url = {https://doi.org/10.1007/3-540-44618-4\_2},
doi = {10.1007/3-540-44618-4\_2},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/concur/Brinksma00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/concur/BruniFMM00,
author = {Roberto Bruni and
David de Frutos{-}Escrig and
Narciso Mart{\'{\i}}{-}Oliet and
Ugo Montanari},
editor = {Catuscia Palamidessi},
title = {Bisimilarity Congruences for Open Terms and Term Graphs via Tile Logic},
booktitle = {{CONCUR} 2000 - Concurrency Theory, 11th International Conference,
University Park, PA, USA, August 22-25, 2000, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1877},
pages = {259--274},
publisher = {Springer},
year = {2000},
url = {https://doi.org/10.1007/3-540-44618-4\_20},
doi = {10.1007/3-540-44618-4\_20},
timestamp = {Fri, 02 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/concur/BruniFMM00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/concur/BrunsG00,
author = {Glenn Bruns and
Patrice Godefroid},
editor = {Catuscia Palamidessi},
title = {Generalized Model Checking: Reasoning about Partial State Spaces},
booktitle = {{CONCUR} 2000 - Concurrency Theory, 11th International Conference,
University Park, PA, USA, August 22-25, 2000, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1877},
pages = {168--182},
publisher = {Springer},
year = {2000},
url = {https://doi.org/10.1007/3-540-44618-4\_14},
doi = {10.1007/3-540-44618-4\_14},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/concur/BrunsG00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/concur/BugliesiCC00,
author = {Michele Bugliesi and
Giuseppe Castagna and
Silvia Crafa},
editor = {Catuscia Palamidessi},
title = {Typed Mobile Objects},
booktitle = {{CONCUR} 2000 - Concurrency Theory, 11th International Conference,
University Park, PA, USA, August 22-25, 2000, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1877},
pages = {504--520},
publisher = {Springer},
year = {2000},
url = {https://doi.org/10.1007/3-540-44618-4\_36},
doi = {10.1007/3-540-44618-4\_36},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/concur/BugliesiCC00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/concur/CardelliGG00,
author = {Luca Cardelli and
Giorgio Ghelli and
Andrew D. Gordon},
editor = {Catuscia Palamidessi},
title = {Secrecy and Group Creation},
booktitle = {{CONCUR} 2000 - Concurrency Theory, 11th International Conference,
University Park, PA, USA, August 22-25, 2000, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1877},
pages = {365--379},
publisher = {Springer},
year = {2000},
url = {https://doi.org/10.1007/3-540-44618-4\_27},
doi = {10.1007/3-540-44618-4\_27},
timestamp = {Mon, 14 Feb 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/concur/CardelliGG00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/concur/CassezL00,
author = {Franck Cassez and
Kim Guldstrand Larsen},
editor = {Catuscia Palamidessi},
title = {The Impressive Power of Stopwatches},
booktitle = {{CONCUR} 2000 - Concurrency Theory, 11th International Conference,
University Park, PA, USA, August 22-25, 2000, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1877},
pages = {138--152},
publisher = {Springer},
year = {2000},
url = {https://doi.org/10.1007/3-540-44618-4\_12},
doi = {10.1007/3-540-44618-4\_12},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/concur/CassezL00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/concur/Charron-BostTB00,
author = {Bernadette Charron{-}Bost and
Sam Toueg and
Anindya Basu},
editor = {Catuscia Palamidessi},
title = {Revisiting Safety and Liveness in the Context of Failures},
booktitle = {{CONCUR} 2000 - Concurrency Theory, 11th International Conference,
University Park, PA, USA, August 22-25, 2000, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1877},
pages = {552--565},
publisher = {Springer},
year = {2000},
url = {https://doi.org/10.1007/3-540-44618-4\_39},
doi = {10.1007/3-540-44618-4\_39},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/concur/Charron-BostTB00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/concur/EtessamiH00,
author = {Kousha Etessami and
Gerard J. Holzmann},
editor = {Catuscia Palamidessi},
title = {Optimizing B{\"{u}}chi Automata},
booktitle = {{CONCUR} 2000 - Concurrency Theory, 11th International Conference,
University Park, PA, USA, August 22-25, 2000, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1877},
pages = {153--167},
publisher = {Springer},
year = {2000},
url = {https://doi.org/10.1007/3-540-44618-4\_13},
doi = {10.1007/3-540-44618-4\_13},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/concur/EtessamiH00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/concur/FinkelIS00,
author = {Alain Finkel and
S. Purushothaman Iyer and
Gr{\'{e}}goire Sutre},
editor = {Catuscia Palamidessi},
title = {Well-Abstracted Transition Systems},
booktitle = {{CONCUR} 2000 - Concurrency Theory, 11th International Conference,
University Park, PA, USA, August 22-25, 2000, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1877},
pages = {566--580},
publisher = {Springer},
year = {2000},
url = {https://doi.org/10.1007/3-540-44618-4\_40},
doi = {10.1007/3-540-44618-4\_40},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/concur/FinkelIS00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/concur/FuY00,
author = {Yuxi Fu and
Zhenrong Yang},
editor = {Catuscia Palamidessi},
title = {Chi Calculus with Mismatch},
booktitle = {{CONCUR} 2000 - Concurrency Theory, 11th International Conference,
University Park, PA, USA, August 22-25, 2000, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1877},
pages = {596--610},
publisher = {Springer},
year = {2000},
url = {https://doi.org/10.1007/3-540-44618-4\_42},
doi = {10.1007/3-540-44618-4\_42},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/concur/FuY00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/concur/Gardner00,
author = {Philippa Gardner},
editor = {Catuscia Palamidessi},
title = {From Process Calculi to Process Frameworks},
booktitle = {{CONCUR} 2000 - Concurrency Theory, 11th International Conference,
University Park, PA, USA, August 22-25, 2000, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1877},
pages = {69--88},
publisher = {Springer},
year = {2000},
url = {https://doi.org/10.1007/3-540-44618-4\_7},
doi = {10.1007/3-540-44618-4\_7},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/concur/Gardner00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/concur/Heljanko00,
author = {Keijo Heljanko},
editor = {Catuscia Palamidessi},
title = {Model Checking with Finite Complete Prefixes Is PSPACE-Complete},
booktitle = {{CONCUR} 2000 - Concurrency Theory, 11th International Conference,
University Park, PA, USA, August 22-25, 2000, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1877},
pages = {108--122},
publisher = {Springer},
year = {2000},
url = {https://doi.org/10.1007/3-540-44618-4\_10},
doi = {10.1007/3-540-44618-4\_10},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/concur/Heljanko00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/concur/IbarraBS00,
author = {Oscar H. Ibarra and
Tevfik Bultan and
Jianwen Su},
editor = {Catuscia Palamidessi},
title = {Reachability Analysis for Some Models of Infinite-State Transition
Systems},
booktitle = {{CONCUR} 2000 - Concurrency Theory, 11th International Conference,
University Park, PA, USA, August 22-25, 2000, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1877},
pages = {183--198},
publisher = {Springer},
year = {2000},
url = {https://doi.org/10.1007/3-540-44618-4\_15},
doi = {10.1007/3-540-44618-4\_15},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/concur/IbarraBS00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/concur/Jurjens00,
author = {Jan J{\"{u}}rjens},
editor = {Catuscia Palamidessi},
title = {Secure Information Flow for Concurrent Processes},
booktitle = {{CONCUR} 2000 - Concurrency Theory, 11th International Conference,
University Park, PA, USA, August 22-25, 2000, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1877},
pages = {395--409},
publisher = {Springer},
year = {2000},
url = {https://doi.org/10.1007/3-540-44618-4\_29},
doi = {10.1007/3-540-44618-4\_29},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/concur/Jurjens00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/concur/KhomenkoK00,
author = {Victor Khomenko and
Maciej Koutny},
editor = {Catuscia Palamidessi},
title = {{LP} Deadlock Checking Using Partial Order Dependencies},
booktitle = {{CONCUR} 2000 - Concurrency Theory, 11th International Conference,
University Park, PA, USA, August 22-25, 2000, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1877},
pages = {410--425},
publisher = {Springer},
year = {2000},
url = {https://doi.org/10.1007/3-540-44618-4\_30},
doi = {10.1007/3-540-44618-4\_30},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/concur/KhomenkoK00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/concur/KobayashiSS00,
author = {Naoki Kobayashi and
Shin Saito and
Eijiro Sumii},
editor = {Catuscia Palamidessi},
title = {An Implicitly-Typed Deadlock-Free Process Calculus},
booktitle = {{CONCUR} 2000 - Concurrency Theory, 11th International Conference,
University Park, PA, USA, August 22-25, 2000, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1877},
pages = {489--503},
publisher = {Springer},
year = {2000},
url = {https://doi.org/10.1007/3-540-44618-4\_35},
doi = {10.1007/3-540-44618-4\_35},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/concur/KobayashiSS00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/concur/KupfermanMTV00,
author = {Orna Kupferman and
P. Madhusudan and
P. S. Thiagarajan and
Moshe Y. Vardi},
editor = {Catuscia Palamidessi},
title = {Open Systems in Reactive Environments: Control and Synthesis},
booktitle = {{CONCUR} 2000 - Concurrency Theory, 11th International Conference,
University Park, PA, USA, August 22-25, 2000, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1877},
pages = {92--107},
publisher = {Springer},
year = {2000},
url = {https://doi.org/10.1007/3-540-44618-4\_9},
doi = {10.1007/3-540-44618-4\_9},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/concur/KupfermanMTV00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/concur/Kuske00,
author = {Dietrich Kuske},
editor = {Catuscia Palamidessi},
title = {Emptiness Is Decidable for Asynchronous Cellular Machines},
booktitle = {{CONCUR} 2000 - Concurrency Theory, 11th International Conference,
University Park, PA, USA, August 22-25, 2000, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1877},
pages = {536--551},
publisher = {Springer},
year = {2000},
url = {https://doi.org/10.1007/3-540-44618-4\_38},
doi = {10.1007/3-540-44618-4\_38},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/concur/Kuske00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/concur/KuskeM00,
author = {Dietrich Kuske and
R{\'{e}}mi Morin},
editor = {Catuscia Palamidessi},
title = {Pomsets for Local Trace Languages - Recognizability, Logic {\&}
Petri Nets},
booktitle = {{CONCUR} 2000 - Concurrency Theory, 11th International Conference,
University Park, PA, USA, August 22-25, 2000, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1877},
pages = {426--441},
publisher = {Springer},
year = {2000},
url = {https://doi.org/10.1007/3-540-44618-4\_31},
doi = {10.1007/3-540-44618-4\_31},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/concur/KuskeM00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/concur/KwiatkowskaNSS00,
author = {Marta Z. Kwiatkowska and
Gethin Norman and
Roberto Segala and
Jeremy Sproston},
editor = {Catuscia Palamidessi},
title = {Verifying Quantitative Properties of Continuous Probabilistic Timed
Automata},
booktitle = {{CONCUR} 2000 - Concurrency Theory, 11th International Conference,
University Park, PA, USA, August 22-25, 2000, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1877},
pages = {123--137},
publisher = {Springer},
year = {2000},
url = {https://doi.org/10.1007/3-540-44618-4\_11},
doi = {10.1007/3-540-44618-4\_11},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/concur/KwiatkowskaNSS00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/concur/LazicN00,
author = {Ranko Lazic and
David Nowak},
editor = {Catuscia Palamidessi},
title = {A Unifying Approach to Data-Independence},
booktitle = {{CONCUR} 2000 - Concurrency Theory, 11th International Conference,
University Park, PA, USA, August 22-25, 2000, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1877},
pages = {581--595},
publisher = {Springer},
year = {2000},
url = {https://doi.org/10.1007/3-540-44618-4\_41},
doi = {10.1007/3-540-44618-4\_41},
timestamp = {Thu, 22 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/concur/LazicN00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/concur/LeiferM00,
author = {James J. Leifer and
Robin Milner},
editor = {Catuscia Palamidessi},
title = {Deriving Bisimulation Congruences for Reactive Systems},
booktitle = {{CONCUR} 2000 - Concurrency Theory, 11th International Conference,
University Park, PA, USA, August 22-25, 2000, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1877},
pages = {243--258},
publisher = {Springer},
year = {2000},
url = {https://doi.org/10.1007/3-540-44618-4\_19},
doi = {10.1007/3-540-44618-4\_19},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/concur/LeiferM00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/concur/Mislove00,
author = {Michael W. Mislove},
editor = {Catuscia Palamidessi},
title = {Nondeterminism and Probabilistic Choice: Obeying the Laws},
booktitle = {{CONCUR} 2000 - Concurrency Theory, 11th International Conference,
University Park, PA, USA, August 22-25, 2000, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1877},
pages = {350--364},
publisher = {Springer},
year = {2000},
url = {https://doi.org/10.1007/3-540-44618-4\_26},
doi = {10.1007/3-540-44618-4\_26},
timestamp = {Wed, 07 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/concur/Mislove00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/concur/MukundKS00,
author = {Madhavan Mukund and
K. Narayan Kumar and
Milind A. Sohoni},
editor = {Catuscia Palamidessi},
title = {Synthesizing Distributed Finite-State Systems from MSCs},
booktitle = {{CONCUR} 2000 - Concurrency Theory, 11th International Conference,
University Park, PA, USA, August 22-25, 2000, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1877},
pages = {521--535},
publisher = {Springer},
year = {2000},
url = {https://doi.org/10.1007/3-540-44618-4\_37},
doi = {10.1007/3-540-44618-4\_37},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/concur/MukundKS00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/concur/Negulescu00,
author = {Radu Negulescu},
editor = {Catuscia Palamidessi},
title = {Process Spaces},
booktitle = {{CONCUR} 2000 - Concurrency Theory, 11th International Conference,
University Park, PA, USA, August 22-25, 2000, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1877},
pages = {199--213},
publisher = {Springer},
year = {2000},
url = {https://doi.org/10.1007/3-540-44618-4\_16},
doi = {10.1007/3-540-44618-4\_16},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/concur/Negulescu00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/concur/NicolaFP00,
author = {Rocco De Nicola and
Gian{-}Luigi Ferrari and
Rosario Pugliese},
editor = {Catuscia Palamidessi},
title = {Programming Access Control: The {KLAIM} Experience},
booktitle = {{CONCUR} 2000 - Concurrency Theory, 11th International Conference,
University Park, PA, USA, August 22-25, 2000, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1877},
pages = {48--65},
publisher = {Springer},
year = {2000},
url = {https://doi.org/10.1007/3-540-44618-4\_5},
doi = {10.1007/3-540-44618-4\_5},
timestamp = {Fri, 23 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/concur/NicolaFP00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/concur/PhilippouLS00,
author = {Anna Philippou and
Insup Lee and
Oleg Sokolsky},
editor = {Catuscia Palamidessi},
title = {Weak Bisimulation for Probabilistic Systems},
booktitle = {{CONCUR} 2000 - Concurrency Theory, 11th International Conference,
University Park, PA, USA, August 22-25, 2000, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1877},
pages = {334--349},
publisher = {Springer},
year = {2000},
url = {https://doi.org/10.1007/3-540-44618-4\_25},
doi = {10.1007/3-540-44618-4\_25},
timestamp = {Thu, 26 Jan 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/concur/PhilippouLS00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/concur/Ramakrishnan00,
author = {C. R. Ramakrishnan},
editor = {Catuscia Palamidessi},
title = {Verification Using Tabled Logic Programming},
booktitle = {{CONCUR} 2000 - Concurrency Theory, 11th International Conference,
University Park, PA, USA, August 22-25, 2000, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1877},
pages = {89--91},
publisher = {Springer},
year = {2000},
url = {https://doi.org/10.1007/3-540-44618-4\_8},
doi = {10.1007/3-540-44618-4\_8},
timestamp = {Mon, 03 Apr 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/concur/Ramakrishnan00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/concur/RavaraV00,
author = {Ant{\'{o}}nio Ravara and
Vasco Thudichum Vasconcelos},
editor = {Catuscia Palamidessi},
title = {Typing Non-uniform Concurrent Objects},
booktitle = {{CONCUR} 2000 - Concurrency Theory, 11th International Conference,
University Park, PA, USA, August 22-25, 2000, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1877},
pages = {474--488},
publisher = {Springer},
year = {2000},
url = {https://doi.org/10.1007/3-540-44618-4\_34},
doi = {10.1007/3-540-44618-4\_34},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/concur/RavaraV00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/concur/Rensink00,
author = {Arend Rensink},
editor = {Catuscia Palamidessi},
title = {Action Contraction},
booktitle = {{CONCUR} 2000 - Concurrency Theory, 11th International Conference,
University Park, PA, USA, August 22-25, 2000, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1877},
pages = {290--304},
publisher = {Springer},
year = {2000},
url = {https://doi.org/10.1007/3-540-44618-4\_22},
doi = {10.1007/3-540-44618-4\_22},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/concur/Rensink00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/concur/Sangiovanni-VincentelliSL00,
author = {Alberto L. Sangiovanni{-}Vincentelli and
Marco Sgroi and
Luciano Lavagno},
editor = {Catuscia Palamidessi},
title = {Formal Models for Communication-Based Design},
booktitle = {{CONCUR} 2000 - Concurrency Theory, 11th International Conference,
University Park, PA, USA, August 22-25, 2000, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1877},
pages = {29--47},
publisher = {Springer},
year = {2000},
url = {https://doi.org/10.1007/3-540-44618-4\_4},
doi = {10.1007/3-540-44618-4\_4},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/concur/Sangiovanni-VincentelliSL00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/concur/Shankar00,
author = {Natarajan Shankar},
editor = {Catuscia Palamidessi},
title = {Combining Theorem Proving and Model Checking through Symbolic Analysis},
booktitle = {{CONCUR} 2000 - Concurrency Theory, 11th International Conference,
University Park, PA, USA, August 22-25, 2000, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1877},
pages = {1--16},
publisher = {Springer},
year = {2000},
url = {https://doi.org/10.1007/3-540-44618-4\_1},
doi = {10.1007/3-540-44618-4\_1},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/concur/Shankar00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/concur/Stark00,
author = {Eugene W. Stark},
editor = {Catuscia Palamidessi},
title = {Compositional Performance Analysis Using Probabilistic {I/O} Automata},
booktitle = {{CONCUR} 2000 - Concurrency Theory, 11th International Conference,
University Park, PA, USA, August 22-25, 2000, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1877},
pages = {25--28},
publisher = {Springer},
year = {2000},
url = {https://doi.org/10.1007/3-540-44618-4\_3},
doi = {10.1007/3-540-44618-4\_3},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/concur/Stark00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/concur/UlidowskiY00,
author = {Irek Ulidowski and
Shoji Yuen},
editor = {Catuscia Palamidessi},
title = {Process Languages for Rooted Eager Bisimulation},
booktitle = {{CONCUR} 2000 - Concurrency Theory, 11th International Conference,
University Park, PA, USA, August 22-25, 2000, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1877},
pages = {275--289},
publisher = {Springer},
year = {2000},
url = {https://doi.org/10.1007/3-540-44618-4\_21},
doi = {10.1007/3-540-44618-4\_21},
timestamp = {Wed, 07 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/concur/UlidowskiY00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/concur/2000,
editor = {Catuscia Palamidessi},
title = {{CONCUR} 2000 - Concurrency Theory, 11th International Conference,
University Park, PA, USA, August 22-25, 2000, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1877},
publisher = {Springer},
year = {2000},
url = {https://doi.org/10.1007/3-540-44618-4},
doi = {10.1007/3-540-44618-4},
isbn = {3-540-67897-2},
timestamp = {Tue, 14 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/concur/2000.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of 
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.
retrieved on 2024-04-18 02:30 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
