26th International Conference on Concurrency Theory (CONCUR 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 42, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)
@Proceedings{aceto_et_al:LIPIcs.CONCUR.2015, title = {{LIPIcs, Volume 42, CONCUR'15, Complete Volume}}, booktitle = {26th International Conference on Concurrency Theory (CONCUR 2015)}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-91-0}, ISSN = {1868-8969}, year = {2015}, volume = {42}, editor = {Aceto, Luca and de Frutos Escrig, David}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2015}, URN = {urn:nbn:de:0030-drops-54628}, doi = {10.4230/LIPIcs.CONCUR.2015}, annote = {Keywords: Computer-Communication Networks, Software Engineering, Computation by Abstract Devices, Logics and Meanings of Programs, Simulation and Modeling} }
26th International Conference on Concurrency Theory (CONCUR 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 42, pp. i-xiv, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)
@InProceedings{aceto_et_al:LIPIcs.CONCUR.2015.i, author = {Aceto, Luca and de Frutos Escrig, David}, title = {{Front Matter, Table of Contents, Preface, Committees, External Reviewers}}, booktitle = {26th International Conference on Concurrency Theory (CONCUR 2015)}, pages = {i--xiv}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-91-0}, ISSN = {1868-8969}, year = {2015}, volume = {42}, editor = {Aceto, Luca and de Frutos Escrig, David}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2015.i}, URN = {urn:nbn:de:0030-drops-53610}, doi = {10.4230/LIPIcs.CONCUR.2015.i}, annote = {Keywords: Front Matter, Table of Contents, Preface, Committees, External Reviewers} }
Roberto Di Cosmo, Michael Lienhardt, Jacopo Mauro, Stefano Zacchiroli, Gianluigi Zavattaro, and Jakub Zwolakowski. Automatic Application Deployment in the Cloud: from Practice to Theory and Back (Invited Paper). In 26th International Conference on Concurrency Theory (CONCUR 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 42, pp. 1-16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)
@InProceedings{dicosmo_et_al:LIPIcs.CONCUR.2015.1, author = {Di Cosmo, Roberto and Lienhardt, Michael and Mauro, Jacopo and Zacchiroli, Stefano and Zavattaro, Gianluigi and Zwolakowski, Jakub}, title = {{Automatic Application Deployment in the Cloud: from Practice to Theory and Back}}, booktitle = {26th International Conference on Concurrency Theory (CONCUR 2015)}, pages = {1--16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-91-0}, ISSN = {1868-8969}, year = {2015}, volume = {42}, editor = {Aceto, Luca and de Frutos Escrig, David}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2015.1}, URN = {urn:nbn:de:0030-drops-53956}, doi = {10.4230/LIPIcs.CONCUR.2015.1}, annote = {Keywords: Automatic deployment, Planning, DevOps, Constraint Programming} }
James Worrell. Reachability Problems for Continuous Linear Dynamical Systems (Invited Paper). In 26th International Conference on Concurrency Theory (CONCUR 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 42, p. 17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)
@InProceedings{worrell:LIPIcs.CONCUR.2015.17, author = {Worrell, James}, title = {{Reachability Problems for Continuous Linear Dynamical Systems}}, booktitle = {26th International Conference on Concurrency Theory (CONCUR 2015)}, pages = {17--17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-91-0}, ISSN = {1868-8969}, year = {2015}, volume = {42}, editor = {Aceto, Luca and de Frutos Escrig, David}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2015.17}, URN = {urn:nbn:de:0030-drops-53960}, doi = {10.4230/LIPIcs.CONCUR.2015.17}, annote = {Keywords: Linear differential Equations, Hybrid Automata, Schanuel's Conjecture} }
Narges Khakpour and Mohammad Reza Mousavi. Notions of Conformance Testing for Cyber-Physical Systems: Overview and Roadmap (Invited Paper). In 26th International Conference on Concurrency Theory (CONCUR 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 42, pp. 18-40, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)
@InProceedings{khakpour_et_al:LIPIcs.CONCUR.2015.18, author = {Khakpour, Narges and Mousavi, Mohammad Reza}, title = {{Notions of Conformance Testing for Cyber-Physical Systems: Overview and Roadmap}}, booktitle = {26th International Conference on Concurrency Theory (CONCUR 2015)}, pages = {18--40}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-91-0}, ISSN = {1868-8969}, year = {2015}, volume = {42}, editor = {Aceto, Luca and de Frutos Escrig, David}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2015.18}, URN = {urn:nbn:de:0030-drops-53975}, doi = {10.4230/LIPIcs.CONCUR.2015.18}, annote = {Keywords: Cyber-physical systems, hybrid systems, conformance testing, model-based testing, behavioral pre-orders, hybrid input-output conformance testing, (tau} }
Matthew Hennessy. Behavioural Equivalences for Co-operating Transactions (Invited Paper). In 26th International Conference on Concurrency Theory (CONCUR 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 42, p. 41, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)
@InProceedings{hennessy:LIPIcs.CONCUR.2015.41, author = {Hennessy, Matthew}, title = {{Behavioural Equivalences for Co-operating Transactions}}, booktitle = {26th International Conference on Concurrency Theory (CONCUR 2015)}, pages = {41--41}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-91-0}, ISSN = {1868-8969}, year = {2015}, volume = {42}, editor = {Aceto, Luca and de Frutos Escrig, David}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2015.41}, URN = {urn:nbn:de:0030-drops-53985}, doi = {10.4230/LIPIcs.CONCUR.2015.41}, annote = {Keywords: Behavioural equivalences, transactional systems} }
Alexandra Silva. Applications of Automata and Concurrency Theory in Networks (Invited Paper). In 26th International Conference on Concurrency Theory (CONCUR 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 42, pp. 42-43, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)
@InProceedings{silva:LIPIcs.CONCUR.2015.42, author = {Silva, Alexandra}, title = {{Applications of Automata and Concurrency Theory in Networks}}, booktitle = {26th International Conference on Concurrency Theory (CONCUR 2015)}, pages = {42--43}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-91-0}, ISSN = {1868-8969}, year = {2015}, volume = {42}, editor = {Aceto, Luca and de Frutos Escrig, David}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2015.42}, URN = {urn:nbn:de:0030-drops-53993}, doi = {10.4230/LIPIcs.CONCUR.2015.42}, annote = {Keywords: Automata, network programming, coalgebra} }
Nathalie Bertrand, Paulin Fournier, and Arnaud Sangnier. Distributed Local Strategies in Broadcast Networks. In 26th International Conference on Concurrency Theory (CONCUR 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 42, pp. 44-57, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)
@InProceedings{bertrand_et_al:LIPIcs.CONCUR.2015.44, author = {Bertrand, Nathalie and Fournier, Paulin and Sangnier, Arnaud}, title = {{Distributed Local Strategies in Broadcast Networks}}, booktitle = {26th International Conference on Concurrency Theory (CONCUR 2015)}, pages = {44--57}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-91-0}, ISSN = {1868-8969}, year = {2015}, volume = {42}, editor = {Aceto, Luca and de Frutos Escrig, David}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2015.44}, URN = {urn:nbn:de:0030-drops-53796}, doi = {10.4230/LIPIcs.CONCUR.2015.44}, annote = {Keywords: Broadcast networks, parameterized verification, local strategies} }
Andrea Cerone, Giovanni Bernardi, and Alexey Gotsman. A Framework for Transactional Consistency Models with Atomic Visibility. In 26th International Conference on Concurrency Theory (CONCUR 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 42, pp. 58-71, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)
@InProceedings{cerone_et_al:LIPIcs.CONCUR.2015.58, author = {Cerone, Andrea and Bernardi, Giovanni and Gotsman, Alexey}, title = {{A Framework for Transactional Consistency Models with Atomic Visibility}}, booktitle = {26th International Conference on Concurrency Theory (CONCUR 2015)}, pages = {58--71}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-91-0}, ISSN = {1868-8969}, year = {2015}, volume = {42}, editor = {Aceto, Luca and de Frutos Escrig, David}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2015.58}, URN = {urn:nbn:de:0030-drops-53756}, doi = {10.4230/LIPIcs.CONCUR.2015.58}, annote = {Keywords: Replication, Consistency models, Transactions} }
Salvatore La Torre, Anca Muscholl, and Igor Walukiewicz. Safety of Parametrized Asynchronous Shared-Memory Systems is Almost Always Decidable. In 26th International Conference on Concurrency Theory (CONCUR 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 42, pp. 72-84, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)
@InProceedings{latorre_et_al:LIPIcs.CONCUR.2015.72, author = {La Torre, Salvatore and Muscholl, Anca and Walukiewicz, Igor}, title = {{Safety of Parametrized Asynchronous Shared-Memory Systems is Almost Always Decidable}}, booktitle = {26th International Conference on Concurrency Theory (CONCUR 2015)}, pages = {72--84}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-91-0}, ISSN = {1868-8969}, year = {2015}, volume = {42}, editor = {Aceto, Luca and de Frutos Escrig, David}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2015.72}, URN = {urn:nbn:de:0030-drops-53813}, doi = {10.4230/LIPIcs.CONCUR.2015.72}, annote = {Keywords: Verification, parametrized systems, shared memory} }
David Harel, Guy Katz, Robby Lampert, Assaf Marron, and Gera Weiss. On the Succinctness of Idioms for Concurrent Programming. In 26th International Conference on Concurrency Theory (CONCUR 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 42, pp. 85-99, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)
@InProceedings{harel_et_al:LIPIcs.CONCUR.2015.85, author = {Harel, David and Katz, Guy and Lampert, Robby and Marron, Assaf and Weiss, Gera}, title = {{On the Succinctness of Idioms for Concurrent Programming}}, booktitle = {26th International Conference on Concurrency Theory (CONCUR 2015)}, pages = {85--99}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-91-0}, ISSN = {1868-8969}, year = {2015}, volume = {42}, editor = {Aceto, Luca and de Frutos Escrig, David}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2015.85}, URN = {urn:nbn:de:0030-drops-53849}, doi = {10.4230/LIPIcs.CONCUR.2015.85}, annote = {Keywords: Descriptive Succinctness, Module Size, Automata, Bounded Concurrency} }
Romain Brenguier, Jean-François Raskin, and Ocan Sankur. Assume-Admissible Synthesis. In 26th International Conference on Concurrency Theory (CONCUR 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 42, pp. 100-113, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)
@InProceedings{brenguier_et_al:LIPIcs.CONCUR.2015.100, author = {Brenguier, Romain and Raskin, Jean-Fran\c{c}ois and Sankur, Ocan}, title = {{Assume-Admissible Synthesis}}, booktitle = {26th International Conference on Concurrency Theory (CONCUR 2015)}, pages = {100--113}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-91-0}, ISSN = {1868-8969}, year = {2015}, volume = {42}, editor = {Aceto, Luca and de Frutos Escrig, David}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2015.100}, URN = {urn:nbn:de:0030-drops-53711}, doi = {10.4230/LIPIcs.CONCUR.2015.100}, annote = {Keywords: Multi-player games, controller synthesis, admissibility} }
Paul Hunter, Guillermo A. Pérez, and Jean-François Raskin. Reactive Synthesis Without Regret. In 26th International Conference on Concurrency Theory (CONCUR 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 42, pp. 114-127, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)
@InProceedings{hunter_et_al:LIPIcs.CONCUR.2015.114, author = {Hunter, Paul and P\'{e}rez, Guillermo A. and Raskin, Jean-Fran\c{c}ois}, title = {{Reactive Synthesis Without Regret}}, booktitle = {26th International Conference on Concurrency Theory (CONCUR 2015)}, pages = {114--127}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-91-0}, ISSN = {1868-8969}, year = {2015}, volume = {42}, editor = {Aceto, Luca and de Frutos Escrig, David}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2015.114}, URN = {urn:nbn:de:0030-drops-53675}, doi = {10.4230/LIPIcs.CONCUR.2015.114}, annote = {Keywords: Quantitative games, regret, verification, synthesis, game theory} }
Eike Best and Raymond Devillers. Synthesis of Bounded Choice-Free Petri Nets. In 26th International Conference on Concurrency Theory (CONCUR 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 42, pp. 128-141, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)
@InProceedings{best_et_al:LIPIcs.CONCUR.2015.128, author = {Best, Eike and Devillers, Raymond}, title = {{Synthesis of Bounded Choice-Free Petri Nets}}, booktitle = {26th International Conference on Concurrency Theory (CONCUR 2015)}, pages = {128--141}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-91-0}, ISSN = {1868-8969}, year = {2015}, volume = {42}, editor = {Aceto, Luca and de Frutos Escrig, David}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2015.128}, URN = {urn:nbn:de:0030-drops-53853}, doi = {10.4230/LIPIcs.CONCUR.2015.128}, annote = {Keywords: Choice-freeness, labelled transition systems, persistence, Petri nets, system synthesis} }
Jan Kretinsky, Kim Guldstrand Larsen, Simon Laursen, and Jiri Srba. Polynomial Time Decidability of Weighted Synchronization under Partial Observability. In 26th International Conference on Concurrency Theory (CONCUR 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 42, pp. 142-154, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)
@InProceedings{kretinsky_et_al:LIPIcs.CONCUR.2015.142, author = {Kretinsky, Jan and Larsen, Kim Guldstrand and Laursen, Simon and Srba, Jiri}, title = {{Polynomial Time Decidability of Weighted Synchronization under Partial Observability}}, booktitle = {26th International Conference on Concurrency Theory (CONCUR 2015)}, pages = {142--154}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-91-0}, ISSN = {1868-8969}, year = {2015}, volume = {42}, editor = {Aceto, Luca and de Frutos Escrig, David}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2015.142}, URN = {urn:nbn:de:0030-drops-53927}, doi = {10.4230/LIPIcs.CONCUR.2015.142}, annote = {Keywords: weighted automata, partial observability, synchronization, complexity} }
Daniel Gebler and Simone Tini. SOS Specifications of Probabilistic Systems by Uniformly Continuous Operators. In 26th International Conference on Concurrency Theory (CONCUR 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 42, pp. 155-168, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)
@InProceedings{gebler_et_al:LIPIcs.CONCUR.2015.155, author = {Gebler, Daniel and Tini, Simone}, title = {{SOS Specifications of Probabilistic Systems by Uniformly Continuous Operators}}, booktitle = {26th International Conference on Concurrency Theory (CONCUR 2015)}, pages = {155--168}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-91-0}, ISSN = {1868-8969}, year = {2015}, volume = {42}, editor = {Aceto, Luca and de Frutos Escrig, David}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2015.155}, URN = {urn:nbn:de:0030-drops-53876}, doi = {10.4230/LIPIcs.CONCUR.2015.155}, annote = {Keywords: SOS, probabilistic process algebra, bisimulation metric semantics, compositional metric reasoning, uniform continuity} }
Sadegh Esmaeil Zadeh Soudjani, Alessandro Abate, and Rupak Majumdar. Dynamic Bayesian Networks as Formal Abstractions of Structured Stochastic Processes. In 26th International Conference on Concurrency Theory (CONCUR 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 42, pp. 169-183, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)
@InProceedings{esmaeilzadehsoudjani_et_al:LIPIcs.CONCUR.2015.169, author = {Esmaeil Zadeh Soudjani, Sadegh and Abate, Alessandro and Majumdar, Rupak}, title = {{Dynamic Bayesian Networks as Formal Abstractions of Structured Stochastic Processes}}, booktitle = {26th International Conference on Concurrency Theory (CONCUR 2015)}, pages = {169--183}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-91-0}, ISSN = {1868-8969}, year = {2015}, volume = {42}, editor = {Aceto, Luca and de Frutos Escrig, David}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2015.169}, URN = {urn:nbn:de:0030-drops-53693}, doi = {10.4230/LIPIcs.CONCUR.2015.169}, annote = {Keywords: Structured stochastic systems, general space Markov processes, formal verification, dynamic Bayesian networks, Markov chain abstraction} }
Vojtech Forejt and Jan Krcal. On Frequency LTL in Probabilistic Systems. In 26th International Conference on Concurrency Theory (CONCUR 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 42, pp. 184-197, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)
@InProceedings{forejt_et_al:LIPIcs.CONCUR.2015.184, author = {Forejt, Vojtech and Krcal, Jan}, title = {{On Frequency LTL in Probabilistic Systems}}, booktitle = {26th International Conference on Concurrency Theory (CONCUR 2015)}, pages = {184--197}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-91-0}, ISSN = {1868-8969}, year = {2015}, volume = {42}, editor = {Aceto, Luca and de Frutos Escrig, David}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2015.184}, URN = {urn:nbn:de:0030-drops-53789}, doi = {10.4230/LIPIcs.CONCUR.2015.184}, annote = {Keywords: Markov chains, Markov decision processes, LTL, controller synthesis} }
Joachim Parrow, Johannes Borgström, Lars-Henrik Eriksson, Ramunas Gutkovas, and Tjark Weber. Modal Logics for Nominal Transition Systems. In 26th International Conference on Concurrency Theory (CONCUR 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 42, pp. 198-211, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)
@InProceedings{parrow_et_al:LIPIcs.CONCUR.2015.198, author = {Parrow, Joachim and Borgstr\"{o}m, Johannes and Eriksson, Lars-Henrik and Gutkovas, Ramunas and Weber, Tjark}, title = {{Modal Logics for Nominal Transition Systems}}, booktitle = {26th International Conference on Concurrency Theory (CONCUR 2015)}, pages = {198--211}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-91-0}, ISSN = {1868-8969}, year = {2015}, volume = {42}, editor = {Aceto, Luca and de Frutos Escrig, David}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2015.198}, URN = {urn:nbn:de:0030-drops-53823}, doi = {10.4230/LIPIcs.CONCUR.2015.198}, annote = {Keywords: Process algebra, nominal sets, bisimulation, modal logic} }
Serguei Lenglet and Alan Schmitt. Howe's Method for Contextual Semantics. In 26th International Conference on Concurrency Theory (CONCUR 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 42, pp. 212-225, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)
@InProceedings{lenglet_et_al:LIPIcs.CONCUR.2015.212, author = {Lenglet, Serguei and Schmitt, Alan}, title = {{Howe's Method for Contextual Semantics}}, booktitle = {26th International Conference on Concurrency Theory (CONCUR 2015)}, pages = {212--225}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-91-0}, ISSN = {1868-8969}, year = {2015}, volume = {42}, editor = {Aceto, Luca and de Frutos Escrig, David}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2015.212}, URN = {urn:nbn:de:0030-drops-53642}, doi = {10.4230/LIPIcs.CONCUR.2015.212}, annote = {Keywords: Bisimulation, process calculi, Howe's method} }
Luca Cardelli, Mirco Tribastone, Max Tschaikowski, and Andrea Vandin. Forward and Backward Bisimulations for Chemical Reaction Networks. In 26th International Conference on Concurrency Theory (CONCUR 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 42, pp. 226-239, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)
@InProceedings{cardelli_et_al:LIPIcs.CONCUR.2015.226, author = {Cardelli, Luca and Tribastone, Mirco and Tschaikowski, Max and Vandin, Andrea}, title = {{Forward and Backward Bisimulations for Chemical Reaction Networks}}, booktitle = {26th International Conference on Concurrency Theory (CONCUR 2015)}, pages = {226--239}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-91-0}, ISSN = {1868-8969}, year = {2015}, volume = {42}, editor = {Aceto, Luca and de Frutos Escrig, David}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2015.226}, URN = {urn:nbn:de:0030-drops-53684}, doi = {10.4230/LIPIcs.CONCUR.2015.226}, annote = {Keywords: Chemical reaction networks, ordinary differential equations, bisimulation, partition refinement} }
Filippo Bonchi, Daniela Petrisan, Damien Pous, and Jurriaan Rot. Lax Bialgebras and Up-To Techniques for Weak Bisimulations. In 26th International Conference on Concurrency Theory (CONCUR 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 42, pp. 240-253, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)
@InProceedings{bonchi_et_al:LIPIcs.CONCUR.2015.240, author = {Bonchi, Filippo and Petrisan, Daniela and Pous, Damien and Rot, Jurriaan}, title = {{Lax Bialgebras and Up-To Techniques for Weak Bisimulations}}, booktitle = {26th International Conference on Concurrency Theory (CONCUR 2015)}, pages = {240--253}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-91-0}, ISSN = {1868-8969}, year = {2015}, volume = {42}, editor = {Aceto, Luca and de Frutos Escrig, David}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2015.240}, URN = {urn:nbn:de:0030-drops-53709}, doi = {10.4230/LIPIcs.CONCUR.2015.240}, annote = {Keywords: Up-to techniques, weak bisimulation, (lax) bialgebras} }
Taolue Chen, Fu Song, and Zhilin Wu. On the Satisfiability of Indexed Linear Temporal Logics. In 26th International Conference on Concurrency Theory (CONCUR 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 42, pp. 254-267, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)
@InProceedings{chen_et_al:LIPIcs.CONCUR.2015.254, author = {Chen, Taolue and Song, Fu and Wu, Zhilin}, title = {{On the Satisfiability of Indexed Linear Temporal Logics}}, booktitle = {26th International Conference on Concurrency Theory (CONCUR 2015)}, pages = {254--267}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-91-0}, ISSN = {1868-8969}, year = {2015}, volume = {42}, editor = {Aceto, Luca and de Frutos Escrig, David}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2015.254}, URN = {urn:nbn:de:0030-drops-53767}, doi = {10.4230/LIPIcs.CONCUR.2015.254}, annote = {Keywords: Satisfiability, Indexed linear temporal logic, Parameterised systems} }
Julian Gutierrez, Paul Harrenstein, and Michael Wooldridge. Expresiveness and Complexity Results for Strategic Reasoning. In 26th International Conference on Concurrency Theory (CONCUR 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 42, pp. 268-282, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)
@InProceedings{gutierrez_et_al:LIPIcs.CONCUR.2015.268, author = {Gutierrez, Julian and Harrenstein, Paul and Wooldridge, Michael}, title = {{Expresiveness and Complexity Results for Strategic Reasoning}}, booktitle = {26th International Conference on Concurrency Theory (CONCUR 2015)}, pages = {268--282}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-91-0}, ISSN = {1868-8969}, year = {2015}, volume = {42}, editor = {Aceto, Luca and de Frutos Escrig, David}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2015.268}, URN = {urn:nbn:de:0030-drops-53802}, doi = {10.4230/LIPIcs.CONCUR.2015.268}, annote = {Keywords: Temporal logic, Nash equilibrium, game models, formal verification} }
Laura Bocchi, Julien Lange, and Nobuko Yoshida. Meeting Deadlines Together. In 26th International Conference on Concurrency Theory (CONCUR 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 42, pp. 283-296, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)
@InProceedings{bocchi_et_al:LIPIcs.CONCUR.2015.283, author = {Bocchi, Laura and Lange, Julien and Yoshida, Nobuko}, title = {{Meeting Deadlines Together}}, booktitle = {26th International Conference on Concurrency Theory (CONCUR 2015)}, pages = {283--296}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-91-0}, ISSN = {1868-8969}, year = {2015}, volume = {42}, editor = {Aceto, Luca and de Frutos Escrig, David}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2015.283}, URN = {urn:nbn:de:0030-drops-53838}, doi = {10.4230/LIPIcs.CONCUR.2015.283}, annote = {Keywords: timed automata, multiparty session types, global specification} }
Thomas Brihaye, Gilles Geeraerts, Axel Haddad, and Benjamin Monmege. To Reach or not to Reach? Efficient Algorithms for Total-Payoff Games. In 26th International Conference on Concurrency Theory (CONCUR 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 42, pp. 297-310, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)
@InProceedings{brihaye_et_al:LIPIcs.CONCUR.2015.297, author = {Brihaye, Thomas and Geeraerts, Gilles and Haddad, Axel and Monmege, Benjamin}, title = {{To Reach or not to Reach? Efficient Algorithms for Total-Payoff Games}}, booktitle = {26th International Conference on Concurrency Theory (CONCUR 2015)}, pages = {297--310}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-91-0}, ISSN = {1868-8969}, year = {2015}, volume = {42}, editor = {Aceto, Luca and de Frutos Escrig, David}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2015.297}, URN = {urn:nbn:de:0030-drops-53729}, doi = {10.4230/LIPIcs.CONCUR.2015.297}, annote = {Keywords: Games on graphs, reachability, quantitative games, value iteration} }
Patricia Bouyer, Samy Jaziri, and Nicolas Markey. On the Value Problem in Weighted Timed Games. In 26th International Conference on Concurrency Theory (CONCUR 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 42, pp. 311-324, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)
@InProceedings{bouyer_et_al:LIPIcs.CONCUR.2015.311, author = {Bouyer, Patricia and Jaziri, Samy and Markey, Nicolas}, title = {{On the Value Problem in Weighted Timed Games}}, booktitle = {26th International Conference on Concurrency Theory (CONCUR 2015)}, pages = {311--324}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-91-0}, ISSN = {1868-8969}, year = {2015}, volume = {42}, editor = {Aceto, Luca and de Frutos Escrig, David}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2015.311}, URN = {urn:nbn:de:0030-drops-53863}, doi = {10.4230/LIPIcs.CONCUR.2015.311}, annote = {Keywords: Timed games, undecidability, approximation} }
Shaull Almagor, Guy Avni, and Orna Kupferman. Repairing Multi-Player Games. In 26th International Conference on Concurrency Theory (CONCUR 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 42, pp. 325-339, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)
@InProceedings{almagor_et_al:LIPIcs.CONCUR.2015.325, author = {Almagor, Shaull and Avni, Guy and Kupferman, Orna}, title = {{Repairing Multi-Player Games}}, booktitle = {26th International Conference on Concurrency Theory (CONCUR 2015)}, pages = {325--339}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-91-0}, ISSN = {1868-8969}, year = {2015}, volume = {42}, editor = {Aceto, Luca and de Frutos Escrig, David}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2015.325}, URN = {urn:nbn:de:0030-drops-53741}, doi = {10.4230/LIPIcs.CONCUR.2015.325}, annote = {Keywords: Nash equilibrium, concurrent games, repair} }
Cyriac Aiswarya, Benedikt Bollig, and Paul Gastin. An Automata-Theoretic Approach to the Verification of Distributed Algorithms. In 26th International Conference on Concurrency Theory (CONCUR 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 42, pp. 340-353, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)
@InProceedings{aiswarya_et_al:LIPIcs.CONCUR.2015.340, author = {Aiswarya, Cyriac and Bollig, Benedikt and Gastin, Paul}, title = {{An Automata-Theoretic Approach to the Verification of Distributed Algorithms}}, booktitle = {26th International Conference on Concurrency Theory (CONCUR 2015)}, pages = {340--353}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-91-0}, ISSN = {1868-8969}, year = {2015}, volume = {42}, editor = {Aceto, Luca and de Frutos Escrig, David}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2015.340}, URN = {urn:nbn:de:0030-drops-53737}, doi = {10.4230/LIPIcs.CONCUR.2015.340}, annote = {Keywords: distributed algorithms, verification, leader election} }
Ernst Moritz Hahn, Guangyuan Li, Sven Schewe, Andrea Turrini, and Lijun Zhang. Lazy Probabilistic Model Checking without Determinisation. In 26th International Conference on Concurrency Theory (CONCUR 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 42, pp. 354-367, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)
@InProceedings{hahn_et_al:LIPIcs.CONCUR.2015.354, author = {Hahn, Ernst Moritz and Li, Guangyuan and Schewe, Sven and Turrini, Andrea and Zhang, Lijun}, title = {{Lazy Probabilistic Model Checking without Determinisation}}, booktitle = {26th International Conference on Concurrency Theory (CONCUR 2015)}, pages = {354--367}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-91-0}, ISSN = {1868-8969}, year = {2015}, volume = {42}, editor = {Aceto, Luca and de Frutos Escrig, David}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2015.354}, URN = {urn:nbn:de:0030-drops-53918}, doi = {10.4230/LIPIcs.CONCUR.2015.354}, annote = {Keywords: Markov decision processes, model checking, PLTL, determinisation} }
Dana Fisman and Yoad Lustig. A Modular Approach for Büchi Determinization. In 26th International Conference on Concurrency Theory (CONCUR 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 42, pp. 368-382, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)
@InProceedings{fisman_et_al:LIPIcs.CONCUR.2015.368, author = {Fisman, Dana and Lustig, Yoad}, title = {{A Modular Approach for B\"{u}chi Determinization}}, booktitle = {26th International Conference on Concurrency Theory (CONCUR 2015)}, pages = {368--382}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-91-0}, ISSN = {1868-8969}, year = {2015}, volume = {42}, editor = {Aceto, Luca and de Frutos Escrig, David}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2015.368}, URN = {urn:nbn:de:0030-drops-53899}, doi = {10.4230/LIPIcs.CONCUR.2015.368}, annote = {Keywords: B\"{u}chi automata, Determinization, Verification, Games, Synthesis} }
Fu Song, Weikai Miao, Geguang Pu, and Min Zhang. On Reachability Analysis of Pushdown Systems with Transductions: Application to Boolean Programs with Call-by-Reference. In 26th International Conference on Concurrency Theory (CONCUR 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 42, pp. 383-397, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)
@InProceedings{song_et_al:LIPIcs.CONCUR.2015.383, author = {Song, Fu and Miao, Weikai and Pu, Geguang and Zhang, Min}, title = {{On Reachability Analysis of Pushdown Systems with Transductions: Application to Boolean Programs with Call-by-Reference}}, booktitle = {26th International Conference on Concurrency Theory (CONCUR 2015)}, pages = {383--397}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-91-0}, ISSN = {1868-8969}, year = {2015}, volume = {42}, editor = {Aceto, Luca and de Frutos Escrig, David}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2015.383}, URN = {urn:nbn:de:0030-drops-53624}, doi = {10.4230/LIPIcs.CONCUR.2015.383}, annote = {Keywords: Verification, Reachability problem, Pushdown system with transductions, Boolean programs with call-by-reference} }
Dimitrios Kouzapas, Jorge A. Pérez, and Nobuko Yoshida. Characteristic Bisimulation for Higher-Order Session Processes. In 26th International Conference on Concurrency Theory (CONCUR 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 42, pp. 398-411, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)
@InProceedings{kouzapas_et_al:LIPIcs.CONCUR.2015.398, author = {Kouzapas, Dimitrios and P\'{e}rez, Jorge A. and Yoshida, Nobuko}, title = {{Characteristic Bisimulation for Higher-Order Session Processes}}, booktitle = {26th International Conference on Concurrency Theory (CONCUR 2015)}, pages = {398--411}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-91-0}, ISSN = {1868-8969}, year = {2015}, volume = {42}, editor = {Aceto, Luca and de Frutos Escrig, David}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2015.398}, URN = {urn:nbn:de:0030-drops-53659}, doi = {10.4230/LIPIcs.CONCUR.2015.398}, annote = {Keywords: Behavioural equivalences, session types, higher-order process calculi} }
Marco Carbone, Fabrizio Montesi, Carsten Schürmann, and Nobuko Yoshida. Multiparty Session Types as Coherence Proofs. In 26th International Conference on Concurrency Theory (CONCUR 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 42, pp. 412-426, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)
@InProceedings{carbone_et_al:LIPIcs.CONCUR.2015.412, author = {Carbone, Marco and Montesi, Fabrizio and Sch\"{u}rmann, Carsten and Yoshida, Nobuko}, title = {{Multiparty Session Types as Coherence Proofs}}, booktitle = {26th International Conference on Concurrency Theory (CONCUR 2015)}, pages = {412--426}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-91-0}, ISSN = {1868-8969}, year = {2015}, volume = {42}, editor = {Aceto, Luca and de Frutos Escrig, David}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2015.412}, URN = {urn:nbn:de:0030-drops-53661}, doi = {10.4230/LIPIcs.CONCUR.2015.412}, annote = {Keywords: Programming languages, Type systems, Session Types, Linear Logic} }
Yuxin Deng, Yuan Feng, and Ugo Dal Lago. On Coinduction and Quantum Lambda Calculi. In 26th International Conference on Concurrency Theory (CONCUR 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 42, pp. 427-440, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)
@InProceedings{deng_et_al:LIPIcs.CONCUR.2015.427, author = {Deng, Yuxin and Feng, Yuan and Dal Lago, Ugo}, title = {{On Coinduction and Quantum Lambda Calculi}}, booktitle = {26th International Conference on Concurrency Theory (CONCUR 2015)}, pages = {427--440}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-91-0}, ISSN = {1868-8969}, year = {2015}, volume = {42}, editor = {Aceto, Luca and de Frutos Escrig, David}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2015.427}, URN = {urn:nbn:de:0030-drops-53883}, doi = {10.4230/LIPIcs.CONCUR.2015.427}, annote = {Keywords: Quantum lambda calculi, contextual equivalence, bisimulation} }
Yuan Feng and Mingsheng Ying. Toward Automatic Verification of Quantum Cryptographic Protocols. In 26th International Conference on Concurrency Theory (CONCUR 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 42, pp. 441-455, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)
@InProceedings{feng_et_al:LIPIcs.CONCUR.2015.441, author = {Feng, Yuan and Ying, Mingsheng}, title = {{Toward Automatic Verification of Quantum Cryptographic Protocols}}, booktitle = {26th International Conference on Concurrency Theory (CONCUR 2015)}, pages = {441--455}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-91-0}, ISSN = {1868-8969}, year = {2015}, volume = {42}, editor = {Aceto, Luca and de Frutos Escrig, David}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2015.441}, URN = {urn:nbn:de:0030-drops-53936}, doi = {10.4230/LIPIcs.CONCUR.2015.441}, annote = {Keywords: Quantum cryptographic protocols, Verification, Bisimulation, Security} }
César Rodríguez, Marcelo Sousa, Subodh Sharma, and Daniel Kroening. Unfolding-based Partial Order Reduction. In 26th International Conference on Concurrency Theory (CONCUR 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 42, pp. 456-469, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)
@InProceedings{rodriguez_et_al:LIPIcs.CONCUR.2015.456, author = {Rodr{\'\i}guez, C\'{e}sar and Sousa, Marcelo and Sharma, Subodh and Kroening, Daniel}, title = {{Unfolding-based Partial Order Reduction}}, booktitle = {26th International Conference on Concurrency Theory (CONCUR 2015)}, pages = {456--469}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-91-0}, ISSN = {1868-8969}, year = {2015}, volume = {42}, editor = {Aceto, Luca and de Frutos Escrig, David}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2015.456}, URN = {urn:nbn:de:0030-drops-53637}, doi = {10.4230/LIPIcs.CONCUR.2015.456}, annote = {Keywords: Partial order reduction, unfoldings, concurrency, model checking} }
Javier Esparza, Pierre Ganty, Jérôme Leroux, and Rupak Majumdar. Verification of Population Protocols. In 26th International Conference on Concurrency Theory (CONCUR 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 42, pp. 470-482, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)
@InProceedings{esparza_et_al:LIPIcs.CONCUR.2015.470, author = {Esparza, Javier and Ganty, Pierre and Leroux, J\'{e}r\^{o}me and Majumdar, Rupak}, title = {{Verification of Population Protocols}}, booktitle = {26th International Conference on Concurrency Theory (CONCUR 2015)}, pages = {470--482}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-91-0}, ISSN = {1868-8969}, year = {2015}, volume = {42}, editor = {Aceto, Luca and de Frutos Escrig, David}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2015.470}, URN = {urn:nbn:de:0030-drops-53770}, doi = {10.4230/LIPIcs.CONCUR.2015.470}, annote = {Keywords: Population protocols, Petri nets, parametrized verification} }
Ivan Gavran, Filip Niksic, Aditya Kanade, Rupak Majumdar, and Viktor Vafeiadis. Rely/Guarantee Reasoning for Asynchronous Programs. In 26th International Conference on Concurrency Theory (CONCUR 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 42, pp. 483-496, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)
@InProceedings{gavran_et_al:LIPIcs.CONCUR.2015.483, author = {Gavran, Ivan and Niksic, Filip and Kanade, Aditya and Majumdar, Rupak and Vafeiadis, Viktor}, title = {{Rely/Guarantee Reasoning for Asynchronous Programs}}, booktitle = {26th International Conference on Concurrency Theory (CONCUR 2015)}, pages = {483--496}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-91-0}, ISSN = {1868-8969}, year = {2015}, volume = {42}, editor = {Aceto, Luca and de Frutos Escrig, David}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2015.483}, URN = {urn:nbn:de:0030-drops-53902}, doi = {10.4230/LIPIcs.CONCUR.2015.483}, annote = {Keywords: Asynchronous programs, rely/guarantee reasoning} }
David Baelde, Stéphanie Delaune, and Lucca Hirschi. Partial Order Reduction for Security Protocols. In 26th International Conference on Concurrency Theory (CONCUR 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 42, pp. 497-510, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)
@InProceedings{baelde_et_al:LIPIcs.CONCUR.2015.497, author = {Baelde, David and Delaune, St\'{e}phanie and Hirschi, Lucca}, title = {{Partial Order Reduction for Security Protocols}}, booktitle = {26th International Conference on Concurrency Theory (CONCUR 2015)}, pages = {497--510}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-91-0}, ISSN = {1868-8969}, year = {2015}, volume = {42}, editor = {Aceto, Luca and de Frutos Escrig, David}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2015.497}, URN = {urn:nbn:de:0030-drops-53946}, doi = {10.4230/LIPIcs.CONCUR.2015.497}, annote = {Keywords: Cryptographic protocols, verification, process algebra, trace equivalence} }
Feedback for Dagstuhl Publishing