27th International Conference on Concurrency Theory (CONCUR 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 59, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
@Proceedings{desharnais_et_al:LIPIcs.CONCUR.2016, title = {{LIPIcs, Volume 59, CONCUR'16, Complete Volume}}, booktitle = {27th International Conference on Concurrency Theory (CONCUR 2016)}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-017-0}, ISSN = {1868-8969}, year = {2016}, volume = {59}, editor = {Desharnais, Jos\'{e}e and Jagadeesan, Radha}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2016}, URN = {urn:nbn:de:0030-drops-65871}, doi = {10.4230/LIPIcs.CONCUR.2016}, annote = {Keywords: Software, Data, Theory of Computation} }
27th International Conference on Concurrency Theory (CONCUR 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 59, pp. 0:i-0:xxii, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
@InProceedings{desharnais_et_al:LIPIcs.CONCUR.2016.0, author = {Desharnais, Jos\'{e}e and Jagadeesan, Radha}, title = {{Front Matter, Table of Contents, Preface, Conference Organization}}, booktitle = {27th International Conference on Concurrency Theory (CONCUR 2016)}, pages = {0:i--0:xxii}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-017-0}, ISSN = {1868-8969}, year = {2016}, volume = {59}, editor = {Desharnais, Jos\'{e}e and Jagadeesan, Radha}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2016.0}, URN = {urn:nbn:de:0030-drops-61535}, doi = {10.4230/LIPIcs.CONCUR.2016.0}, annote = {Keywords: Front Matter, Table of Contents, Preface, Conference Organization} }
Fredrik Dahlqvist, Vincent Danos, Ilias Garnier, and Ohad Kammar. Bayesian Inversion by Omega-Complete Cone Duality (Invited Paper). In 27th International Conference on Concurrency Theory (CONCUR 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 59, pp. 1:1-1:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
@InProceedings{dahlqvist_et_al:LIPIcs.CONCUR.2016.1, author = {Dahlqvist, Fredrik and Danos, Vincent and Garnier, Ilias and Kammar, Ohad}, title = {{Bayesian Inversion by Omega-Complete Cone Duality}}, booktitle = {27th International Conference on Concurrency Theory (CONCUR 2016)}, pages = {1:1--1:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-017-0}, ISSN = {1868-8969}, year = {2016}, volume = {59}, editor = {Desharnais, Jos\'{e}e and Jagadeesan, Radha}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2016.1}, URN = {urn:nbn:de:0030-drops-61909}, doi = {10.4230/LIPIcs.CONCUR.2016.1}, annote = {Keywords: probabilistic models, bayesian learning, markov operators} }
Francesca Rossi. Ethical Preference-Based Decision Support Systems (Invited Paper). In 27th International Conference on Concurrency Theory (CONCUR 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 59, pp. 2:1-2:7, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
@InProceedings{rossi:LIPIcs.CONCUR.2016.2, author = {Rossi, Francesca}, title = {{Ethical Preference-Based Decision Support Systems}}, booktitle = {27th International Conference on Concurrency Theory (CONCUR 2016)}, pages = {2:1--2:7}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-017-0}, ISSN = {1868-8969}, year = {2016}, volume = {59}, editor = {Desharnais, Jos\'{e}e and Jagadeesan, Radha}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2016.2}, URN = {urn:nbn:de:0030-drops-61870}, doi = {10.4230/LIPIcs.CONCUR.2016.2}, annote = {Keywords: preferences, decision making, multi-agent systems} }
Marc Shapiro, Masoud Saeida Ardekani, and Gustavo Petri. Consistency in 3D (Invited Paper). In 27th International Conference on Concurrency Theory (CONCUR 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 59, pp. 3:1-3:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
@InProceedings{shapiro_et_al:LIPIcs.CONCUR.2016.3, author = {Shapiro, Marc and Ardekani, Masoud Saeida and Petri, Gustavo}, title = {{Consistency in 3D}}, booktitle = {27th International Conference on Concurrency Theory (CONCUR 2016)}, pages = {3:1--3:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-017-0}, ISSN = {1868-8969}, year = {2016}, volume = {59}, editor = {Desharnais, Jos\'{e}e and Jagadeesan, Radha}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2016.3}, URN = {urn:nbn:de:0030-drops-61889}, doi = {10.4230/LIPIcs.CONCUR.2016.3}, annote = {Keywords: Consistency models, replicated data, structural invariants, correctness of distributed systems} }
Junxing Yang, Radu Grosu, Scott A. Smolka, and Ashish Tiwari. Love Thy Neighbor: V-Formation as a Problem of Model Predictive Control (Invited Paper). In 27th International Conference on Concurrency Theory (CONCUR 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 59, pp. 4:1-4:5, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
@InProceedings{yang_et_al:LIPIcs.CONCUR.2016.4, author = {Yang, Junxing and Grosu, Radu and Smolka, Scott A. and Tiwari, Ashish}, title = {{Love Thy Neighbor: V-Formation as a Problem of Model Predictive Control}}, booktitle = {27th International Conference on Concurrency Theory (CONCUR 2016)}, pages = {4:1--4:5}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-017-0}, ISSN = {1868-8969}, year = {2016}, volume = {59}, editor = {Desharnais, Jos\'{e}e and Jagadeesan, Radha}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2016.4}, URN = {urn:nbn:de:0030-drops-61896}, doi = {10.4230/LIPIcs.CONCUR.2016.4}, annote = {Keywords: bird flocking, v-formation, model predictive control, particle swarm optimization} }
Parosh Aziz Abdulla, Mohamed Faouzi Atig, Ahmed Bouajjani, and Tuan Phong Ngo. The Benefits of Duality in Verifying Concurrent Programs under TSO. In 27th International Conference on Concurrency Theory (CONCUR 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 59, pp. 5:1-5:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
@InProceedings{abdulla_et_al:LIPIcs.CONCUR.2016.5, author = {Abdulla, Parosh Aziz and Atig, Mohamed Faouzi and Bouajjani, Ahmed and Ngo, Tuan Phong}, title = {{The Benefits of Duality in Verifying Concurrent Programs under TSO}}, booktitle = {27th International Conference on Concurrency Theory (CONCUR 2016)}, pages = {5:1--5:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-017-0}, ISSN = {1868-8969}, year = {2016}, volume = {59}, editor = {Desharnais, Jos\'{e}e and Jagadeesan, Radha}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2016.5}, URN = {urn:nbn:de:0030-drops-61710}, doi = {10.4230/LIPIcs.CONCUR.2016.5}, annote = {Keywords: Weak Memory Models, Reachability Problem, Parameterized Systems} }
Andreas Haas, Thomas A. Henzinger, Andreas Holzer, Christoph M. Kirsch, Michael Lippautz, Hannes Payer, Ali Sezgin, Ana Sokolova, and Helmut Veith. Local Linearizability for Concurrent Container-Type Data Structures. In 27th International Conference on Concurrency Theory (CONCUR 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 59, pp. 6:1-6:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
@InProceedings{haas_et_al:LIPIcs.CONCUR.2016.6, author = {Haas, Andreas and Henzinger, Thomas A. and Holzer, Andreas and Kirsch, Christoph M. and Lippautz, Michael and Payer, Hannes and Sezgin, Ali and Sokolova, Ana and Veith, Helmut}, title = {{Local Linearizability for Concurrent Container-Type Data Structures}}, booktitle = {27th International Conference on Concurrency Theory (CONCUR 2016)}, pages = {6:1--6:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-017-0}, ISSN = {1868-8969}, year = {2016}, volume = {59}, editor = {Desharnais, Jos\'{e}e and Jagadeesan, Radha}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2016.6}, URN = {urn:nbn:de:0030-drops-61809}, doi = {10.4230/LIPIcs.CONCUR.2016.6}, annote = {Keywords: (concurrent) data structures, relaxed semantics, linearizability} }
Giovanni Bernardi and Alexey Gotsman. Robustness against Consistency Models with Atomic Visibility. In 27th International Conference on Concurrency Theory (CONCUR 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 59, pp. 7:1-7:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
@InProceedings{bernardi_et_al:LIPIcs.CONCUR.2016.7, author = {Bernardi, Giovanni and Gotsman, Alexey}, title = {{Robustness against Consistency Models with Atomic Visibility}}, booktitle = {27th International Conference on Concurrency Theory (CONCUR 2016)}, pages = {7:1--7:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-017-0}, ISSN = {1868-8969}, year = {2016}, volume = {59}, editor = {Desharnais, Jos\'{e}e and Jagadeesan, Radha}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2016.7}, URN = {urn:nbn:de:0030-drops-61652}, doi = {10.4230/LIPIcs.CONCUR.2016.7}, annote = {Keywords: Robustness, Replication, Consistency models, Transactions} }
Romain Brenguier. Optimal Assumptions for Synthesis. In 27th International Conference on Concurrency Theory (CONCUR 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 59, pp. 8:1-8:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
@InProceedings{brenguier:LIPIcs.CONCUR.2016.8, author = {Brenguier, Romain}, title = {{Optimal Assumptions for Synthesis}}, booktitle = {27th International Conference on Concurrency Theory (CONCUR 2016)}, pages = {8:1--8:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-017-0}, ISSN = {1868-8969}, year = {2016}, volume = {59}, editor = {Desharnais, Jos\'{e}e and Jagadeesan, Radha}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2016.8}, URN = {urn:nbn:de:0030-drops-61742}, doi = {10.4230/LIPIcs.CONCUR.2016.8}, annote = {Keywords: Controller synthesis, Parity games, Admissible strategies} }
Shaull Almagor, Orna Kupferman, and Yaron Velner. Minimizing Expected Cost Under Hard Boolean Constraints, with Applications to Quantitative Synthesis. In 27th International Conference on Concurrency Theory (CONCUR 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 59, pp. 9:1-9:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
@InProceedings{almagor_et_al:LIPIcs.CONCUR.2016.9, author = {Almagor, Shaull and Kupferman, Orna and Velner, Yaron}, title = {{Minimizing Expected Cost Under Hard Boolean Constraints, with Applications to Quantitative Synthesis}}, booktitle = {27th International Conference on Concurrency Theory (CONCUR 2016)}, pages = {9:1--9:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-017-0}, ISSN = {1868-8969}, year = {2016}, volume = {59}, editor = {Desharnais, Jos\'{e}e and Jagadeesan, Radha}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2016.9}, URN = {urn:nbn:de:0030-drops-61689}, doi = {10.4230/LIPIcs.CONCUR.2016.9}, annote = {Keywords: Stochastic and Quantitative Synthesis, Mean Payoff Games, Sensing.} }
Tomas Brazdil, Vojtech Forejt, Antonin Kucera, and Petr Novotny. Stability in Graphs and Games. In 27th International Conference on Concurrency Theory (CONCUR 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 59, pp. 10:1-10:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
@InProceedings{brazdil_et_al:LIPIcs.CONCUR.2016.10, author = {Brazdil, Tomas and Forejt, Vojtech and Kucera, Antonin and Novotny, Petr}, title = {{Stability in Graphs and Games}}, booktitle = {27th International Conference on Concurrency Theory (CONCUR 2016)}, pages = {10:1--10:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-017-0}, ISSN = {1868-8969}, year = {2016}, volume = {59}, editor = {Desharnais, Jos\'{e}e and Jagadeesan, Radha}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2016.10}, URN = {urn:nbn:de:0030-drops-61784}, doi = {10.4230/LIPIcs.CONCUR.2016.10}, annote = {Keywords: Games, Stability, Mean-Payoff, Window Objectives} }
Veronique Bruyere, Quentin Hautem, and Jean-Francois Raskin. On the Complexity of Heterogeneous Multidimensional Games. In 27th International Conference on Concurrency Theory (CONCUR 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 59, pp. 11:1-11:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
@InProceedings{bruyere_et_al:LIPIcs.CONCUR.2016.11, author = {Bruyere, Veronique and Hautem, Quentin and Raskin, Jean-Francois}, title = {{On the Complexity of Heterogeneous Multidimensional Games}}, booktitle = {27th International Conference on Concurrency Theory (CONCUR 2016)}, pages = {11:1--11:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-017-0}, ISSN = {1868-8969}, year = {2016}, volume = {59}, editor = {Desharnais, Jos\'{e}e and Jagadeesan, Radha}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2016.11}, URN = {urn:nbn:de:0030-drops-61618}, doi = {10.4230/LIPIcs.CONCUR.2016.11}, annote = {Keywords: wo-player zero-sum games played on graphs, quantitative objectives, multidimensional heterogeneous objectives} }
Javier Esparza, Denis Kuperberg, Anca Muscholl, and Igor Walukiewicz. Soundness in Negotiations. In 27th International Conference on Concurrency Theory (CONCUR 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 59, pp. 12:1-12:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
@InProceedings{esparza_et_al:LIPIcs.CONCUR.2016.12, author = {Esparza, Javier and Kuperberg, Denis and Muscholl, Anca and Walukiewicz, Igor}, title = {{Soundness in Negotiations}}, booktitle = {27th International Conference on Concurrency Theory (CONCUR 2016)}, pages = {12:1--12:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-017-0}, ISSN = {1868-8969}, year = {2016}, volume = {59}, editor = {Desharnais, Jos\'{e}e and Jagadeesan, Radha}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2016.12}, URN = {urn:nbn:de:0030-drops-61636}, doi = {10.4230/LIPIcs.CONCUR.2016.12}, annote = {Keywords: Negotiations, workflows, soundness, verification, concurrency} }
Bernd Finkbeiner and Christopher Hahn. Deciding Hyperproperties. In 27th International Conference on Concurrency Theory (CONCUR 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 59, pp. 13:1-13:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
@InProceedings{finkbeiner_et_al:LIPIcs.CONCUR.2016.13, author = {Finkbeiner, Bernd and Hahn, Christopher}, title = {{Deciding Hyperproperties}}, booktitle = {27th International Conference on Concurrency Theory (CONCUR 2016)}, pages = {13:1--13:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-017-0}, ISSN = {1868-8969}, year = {2016}, volume = {59}, editor = {Desharnais, Jos\'{e}e and Jagadeesan, Radha}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2016.13}, URN = {urn:nbn:de:0030-drops-61706}, doi = {10.4230/LIPIcs.CONCUR.2016.13}, annote = {Keywords: temporal logics, satisfiability, hyperproperties, complexity} }
Marvin Triebel and Jan Sürmeli. Homogeneous Equations of Algebraic Petri Nets. In 27th International Conference on Concurrency Theory (CONCUR 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 59, pp. 14:1-14:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
@InProceedings{triebel_et_al:LIPIcs.CONCUR.2016.14, author = {Triebel, Marvin and S\"{u}rmeli, Jan}, title = {{Homogeneous Equations of Algebraic Petri Nets}}, booktitle = {27th International Conference on Concurrency Theory (CONCUR 2016)}, pages = {14:1--14:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-017-0}, ISSN = {1868-8969}, year = {2016}, volume = {59}, editor = {Desharnais, Jos\'{e}e and Jagadeesan, Radha}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2016.14}, URN = {urn:nbn:de:0030-drops-61574}, doi = {10.4230/LIPIcs.CONCUR.2016.14}, annote = {Keywords: Algebraic Petri Nets, Invariants, Linear Equations, Validity, Stability} }
Uli Schlachter. Bounded Petri Net Synthesis from Modal Transition Systems is Undecidable. In 27th International Conference on Concurrency Theory (CONCUR 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 59, pp. 15:1-15:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
@InProceedings{schlachter:LIPIcs.CONCUR.2016.15, author = {Schlachter, Uli}, title = {{Bounded Petri Net Synthesis from Modal Transition Systems is Undecidable}}, booktitle = {27th International Conference on Concurrency Theory (CONCUR 2016)}, pages = {15:1--15:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-017-0}, ISSN = {1868-8969}, year = {2016}, volume = {59}, editor = {Desharnais, Jos\'{e}e and Jagadeesan, Radha}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2016.15}, URN = {urn:nbn:de:0030-drops-61603}, doi = {10.4230/LIPIcs.CONCUR.2016.15}, annote = {Keywords: Petri net synthesis, conjunctive nu-Calculus, modal transition systems} }
Borzoo Bonakdarpour, Pierre Fraigniaud, Sergio Rajsbaum, David A. Rosenblueth, and Corentin Travers. Decentralized Asynchronous Crash-Resilient Runtime Verification. In 27th International Conference on Concurrency Theory (CONCUR 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 59, pp. 16:1-16:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
@InProceedings{bonakdarpour_et_al:LIPIcs.CONCUR.2016.16, author = {Bonakdarpour, Borzoo and Fraigniaud, Pierre and Rajsbaum, Sergio and Rosenblueth, David A. and Travers, Corentin}, title = {{Decentralized Asynchronous Crash-Resilient Runtime Verification}}, booktitle = {27th International Conference on Concurrency Theory (CONCUR 2016)}, pages = {16:1--16:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-017-0}, ISSN = {1868-8969}, year = {2016}, volume = {59}, editor = {Desharnais, Jos\'{e}e and Jagadeesan, Radha}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2016.16}, URN = {urn:nbn:de:0030-drops-61856}, doi = {10.4230/LIPIcs.CONCUR.2016.16}, annote = {Keywords: Runtime monitoring, Distributed algorithms, Fault-tolerance} }
Loïg Jezequel and Didier Lime. Lazy Reachability Analysis in Distributed Systems. In 27th International Conference on Concurrency Theory (CONCUR 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 59, pp. 17:1-17:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
@InProceedings{jezequel_et_al:LIPIcs.CONCUR.2016.17, author = {Jezequel, Lo\"{i}g and Lime, Didier}, title = {{Lazy Reachability Analysis in Distributed Systems}}, booktitle = {27th International Conference on Concurrency Theory (CONCUR 2016)}, pages = {17:1--17:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-017-0}, ISSN = {1868-8969}, year = {2016}, volume = {59}, editor = {Desharnais, Jos\'{e}e and Jagadeesan, Radha}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2016.17}, URN = {urn:nbn:de:0030-drops-61545}, doi = {10.4230/LIPIcs.CONCUR.2016.17}, annote = {Keywords: Reachability analysis, Compositional verification, Automata} }
Roly Perera, Deepak Garg, and James Cheney. Causally Consistent Dynamic Slicing. In 27th International Conference on Concurrency Theory (CONCUR 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 59, pp. 18:1-18:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
@InProceedings{perera_et_al:LIPIcs.CONCUR.2016.18, author = {Perera, Roly and Garg, Deepak and Cheney, James}, title = {{Causally Consistent Dynamic Slicing}}, booktitle = {27th International Conference on Concurrency Theory (CONCUR 2016)}, pages = {18:1--18:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-017-0}, ISSN = {1868-8969}, year = {2016}, volume = {59}, editor = {Desharnais, Jos\'{e}e and Jagadeesan, Radha}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2016.18}, URN = {urn:nbn:de:0030-drops-61584}, doi = {10.4230/LIPIcs.CONCUR.2016.18}, annote = {Keywords: pi-calculus; dynamic slicing; causal equivalence; Galois connection} }
Christina Rickmann, Christoph Wagner, Uwe Nestmann, and Stefan Schmid. Topological Self-Stabilization with Name-Passing Process Calculi. In 27th International Conference on Concurrency Theory (CONCUR 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 59, pp. 19:1-19:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
@InProceedings{rickmann_et_al:LIPIcs.CONCUR.2016.19, author = {Rickmann, Christina and Wagner, Christoph and Nestmann, Uwe and Schmid, Stefan}, title = {{Topological Self-Stabilization with Name-Passing Process Calculi}}, booktitle = {27th International Conference on Concurrency Theory (CONCUR 2016)}, pages = {19:1--19:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-017-0}, ISSN = {1868-8969}, year = {2016}, volume = {59}, editor = {Desharnais, Jos\'{e}e and Jagadeesan, Radha}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2016.19}, URN = {urn:nbn:de:0030-drops-61761}, doi = {10.4230/LIPIcs.CONCUR.2016.19}, annote = {Keywords: Distributed Algorithms, Fault Tolerance, Topological Self-Stabilization, Linearization, Process Calculi} }
Przemyslaw Daca, Thomas A. Henzinger, Jan Kretinsky, and Tatjana Petrov. Linear Distances between Markov Chains. In 27th International Conference on Concurrency Theory (CONCUR 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 59, pp. 20:1-20:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
@InProceedings{daca_et_al:LIPIcs.CONCUR.2016.20, author = {Daca, Przemyslaw and Henzinger, Thomas A. and Kretinsky, Jan and Petrov, Tatjana}, title = {{Linear Distances between Markov Chains}}, booktitle = {27th International Conference on Concurrency Theory (CONCUR 2016)}, pages = {20:1--20:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-017-0}, ISSN = {1868-8969}, year = {2016}, volume = {59}, editor = {Desharnais, Jos\'{e}e and Jagadeesan, Radha}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2016.20}, URN = {urn:nbn:de:0030-drops-61829}, doi = {10.4230/LIPIcs.CONCUR.2016.20}, annote = {Keywords: probabilistic systems, verification, statistical model checking, temporal logic, behavioural equivalence} }
Giorgio Bacci, Giovanni Bacci, Kim G. Larsen, and Radu Mardare. Complete Axiomatization for the Bisimilarity Distance on Markov Chains. In 27th International Conference on Concurrency Theory (CONCUR 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 59, pp. 21:1-21:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
@InProceedings{bacci_et_al:LIPIcs.CONCUR.2016.21, author = {Bacci, Giorgio and Bacci, Giovanni and G. Larsen, Kim and Mardare, Radu}, title = {{Complete Axiomatization for the Bisimilarity Distance on Markov Chains}}, booktitle = {27th International Conference on Concurrency Theory (CONCUR 2016)}, pages = {21:1--21:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-017-0}, ISSN = {1868-8969}, year = {2016}, volume = {59}, editor = {Desharnais, Jos\'{e}e and Jagadeesan, Radha}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2016.21}, URN = {urn:nbn:de:0030-drops-61569}, doi = {10.4230/LIPIcs.CONCUR.2016.21}, annote = {Keywords: Markov chains, Behavioral distances, Axiomatization} }
Qiyi Tang and Franck van Breugel. Computing Probabilistic Bisimilarity Distances via Policy Iteration. In 27th International Conference on Concurrency Theory (CONCUR 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 59, pp. 22:1-22:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
@InProceedings{tang_et_al:LIPIcs.CONCUR.2016.22, author = {Tang, Qiyi and van Breugel, Franck}, title = {{Computing Probabilistic Bisimilarity Distances via Policy Iteration}}, booktitle = {27th International Conference on Concurrency Theory (CONCUR 2016)}, pages = {22:1--22:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-017-0}, ISSN = {1868-8969}, year = {2016}, volume = {59}, editor = {Desharnais, Jos\'{e}e and Jagadeesan, Radha}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2016.22}, URN = {urn:nbn:de:0030-drops-61837}, doi = {10.4230/LIPIcs.CONCUR.2016.22}, annote = {Keywords: labelled Markov chain, simple stochastic game, probabilistic bisimilarity, pseudometric, value function, policy iteration} }
Fredrik Dahlqvist, Vincent Danos, and Ilias Garnier. Robustly Parameterised Higher-Order Probabilistic Models. In 27th International Conference on Concurrency Theory (CONCUR 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 59, pp. 23:1-23:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
@InProceedings{dahlqvist_et_al:LIPIcs.CONCUR.2016.23, author = {Dahlqvist, Fredrik and Danos, Vincent and Garnier, Ilias}, title = {{Robustly Parameterised Higher-Order Probabilistic Models}}, booktitle = {27th International Conference on Concurrency Theory (CONCUR 2016)}, pages = {23:1--23:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-017-0}, ISSN = {1868-8969}, year = {2016}, volume = {59}, editor = {Desharnais, Jos\'{e}e and Jagadeesan, Radha}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2016.23}, URN = {urn:nbn:de:0030-drops-61737}, doi = {10.4230/LIPIcs.CONCUR.2016.23}, annote = {Keywords: Probability, category theory, Giry monad} }
Natsuki Urabe, Shunsuke Shimizu, and Ichiro Hasuo. Coalgebraic Trace Semantics for Buechi and Parity Automata. In 27th International Conference on Concurrency Theory (CONCUR 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 59, pp. 24:1-24:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
@InProceedings{urabe_et_al:LIPIcs.CONCUR.2016.24, author = {Urabe, Natsuki and Shimizu, Shunsuke and Hasuo, Ichiro}, title = {{Coalgebraic Trace Semantics for Buechi and Parity Automata}}, booktitle = {27th International Conference on Concurrency Theory (CONCUR 2016)}, pages = {24:1--24:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-017-0}, ISSN = {1868-8969}, year = {2016}, volume = {59}, editor = {Desharnais, Jos\'{e}e and Jagadeesan, Radha}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2016.24}, URN = {urn:nbn:de:0030-drops-61867}, doi = {10.4230/LIPIcs.CONCUR.2016.24}, annote = {Keywords: coalgebra, Buechi automaton, parity automaton, probabilistic automaton, tree automaton} }
Jérémy Dubut, Eric Goubault, and Jean Goubault-Larrecq. Bisimulations and Unfolding in P-Accessible Categorical Models. In 27th International Conference on Concurrency Theory (CONCUR 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 59, pp. 25:1-25:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
@InProceedings{dubut_et_al:LIPIcs.CONCUR.2016.25, author = {Dubut, J\'{e}r\'{e}my and Goubault, Eric and Goubault-Larrecq, Jean}, title = {{Bisimulations and Unfolding in P-Accessible Categorical Models}}, booktitle = {27th International Conference on Concurrency Theory (CONCUR 2016)}, pages = {25:1--25:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-017-0}, ISSN = {1868-8969}, year = {2016}, volume = {59}, editor = {Desharnais, Jos\'{e}e and Jagadeesan, Radha}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2016.25}, URN = {urn:nbn:de:0030-drops-61555}, doi = {10.4230/LIPIcs.CONCUR.2016.25}, annote = {Keywords: categorical models, bisimulation, coreflexions, unfolding, universal covering} }
Tomasz Brengos and Marco Peressotti. A Uniform Framework for Timed Automata. In 27th International Conference on Concurrency Theory (CONCUR 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 59, pp. 26:1-26:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
@InProceedings{brengos_et_al:LIPIcs.CONCUR.2016.26, author = {Brengos, Tomasz and Peressotti, Marco}, title = {{A Uniform Framework for Timed Automata}}, booktitle = {27th International Conference on Concurrency Theory (CONCUR 2016)}, pages = {26:1--26:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-017-0}, ISSN = {1868-8969}, year = {2016}, volume = {59}, editor = {Desharnais, Jos\'{e}e and Jagadeesan, Radha}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2016.26}, URN = {urn:nbn:de:0030-drops-61690}, doi = {10.4230/LIPIcs.CONCUR.2016.26}, annote = {Keywords: coalgebras, lax functors, general saturation, timed behavioural equivalence, timed language equivalence} }
S. Akshay, Paul Gastin, and Shankara Narayanan Krishna. Analyzing Timed Systems Using Tree Automata. In 27th International Conference on Concurrency Theory (CONCUR 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 59, pp. 27:1-27:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
@InProceedings{akshay_et_al:LIPIcs.CONCUR.2016.27, author = {Akshay, S. and Gastin, Paul and Krishna, Shankara Narayanan}, title = {{Analyzing Timed Systems Using Tree Automata}}, booktitle = {27th International Conference on Concurrency Theory (CONCUR 2016)}, pages = {27:1--27:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-017-0}, ISSN = {1868-8969}, year = {2016}, volume = {59}, editor = {Desharnais, Jos\'{e}e and Jagadeesan, Radha}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2016.27}, URN = {urn:nbn:de:0030-drops-61775}, doi = {10.4230/LIPIcs.CONCUR.2016.27}, annote = {Keywords: Timed automata, tree automata, pushdown systems, tree-width} }
Amélie David, Francois Laroussinie, and Nicolas Markey. On the Expressiveness of QCTL. In 27th International Conference on Concurrency Theory (CONCUR 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 59, pp. 28:1-28:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
@InProceedings{david_et_al:LIPIcs.CONCUR.2016.28, author = {David, Am\'{e}lie and Laroussinie, Francois and Markey, Nicolas}, title = {{On the Expressiveness of QCTL}}, booktitle = {27th International Conference on Concurrency Theory (CONCUR 2016)}, pages = {28:1--28:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-017-0}, ISSN = {1868-8969}, year = {2016}, volume = {59}, editor = {Desharnais, Jos\'{e}e and Jagadeesan, Radha}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2016.28}, URN = {urn:nbn:de:0030-drops-61643}, doi = {10.4230/LIPIcs.CONCUR.2016.28}, annote = {Keywords: Specification, Verification, Temporal Logic, Expressiveness, Tree automata} }
Antonia Lechner, Richard Mayr, Joël Ouaknine, Amaury Pouly, and James Worrell. Model Checking Flat Freeze LTL on One-Counter Automata. In 27th International Conference on Concurrency Theory (CONCUR 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 59, pp. 29:1-29:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
@InProceedings{lechner_et_al:LIPIcs.CONCUR.2016.29, author = {Lechner, Antonia and Mayr, Richard and Ouaknine, Jo\"{e}l and Pouly, Amaury and Worrell, James}, title = {{Model Checking Flat Freeze LTL on One-Counter Automata}}, booktitle = {27th International Conference on Concurrency Theory (CONCUR 2016)}, pages = {29:1--29:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-017-0}, ISSN = {1868-8969}, year = {2016}, volume = {59}, editor = {Desharnais, Jos\'{e}e and Jagadeesan, Radha}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2016.29}, URN = {urn:nbn:de:0030-drops-61841}, doi = {10.4230/LIPIcs.CONCUR.2016.29}, annote = {Keywords: one-counter automata, disequality tests, reachability, freeze LTL, Presburger arithmetic} }
Igor Konnov, Tomer Kotek, Qiang Wang, Helmut Veith, Simon Bliudze, and Joseph Sifakis. Parameterized Systems in BIP: Design and Model Checking. In 27th International Conference on Concurrency Theory (CONCUR 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 59, pp. 30:1-30:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
@InProceedings{konnov_et_al:LIPIcs.CONCUR.2016.30, author = {Konnov, Igor and Kotek, Tomer and Wang, Qiang and Veith, Helmut and Bliudze, Simon and Joseph Sifakis}, title = {{Parameterized Systems in BIP: Design and Model Checking}}, booktitle = {27th International Conference on Concurrency Theory (CONCUR 2016)}, pages = {30:1--30:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-017-0}, ISSN = {1868-8969}, year = {2016}, volume = {59}, editor = {Desharnais, Jos\'{e}e and Jagadeesan, Radha}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2016.30}, URN = {urn:nbn:de:0030-drops-61670}, doi = {10.4230/LIPIcs.CONCUR.2016.30}, annote = {Keywords: Rigorous system design, BIP, verification, parameterized model checking} }
Ross Horne, Alwen Tiu, Bogdan Aman, and Gabriel Ciobanu. Private Names in Non-Commutative Logic. In 27th International Conference on Concurrency Theory (CONCUR 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 59, pp. 31:1-31:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
@InProceedings{horne_et_al:LIPIcs.CONCUR.2016.31, author = {Horne, Ross and Tiu, Alwen and Aman, Bogdan and Ciobanu, Gabriel}, title = {{Private Names in Non-Commutative Logic}}, booktitle = {27th International Conference on Concurrency Theory (CONCUR 2016)}, pages = {31:1--31:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-017-0}, ISSN = {1868-8969}, year = {2016}, volume = {59}, editor = {Desharnais, Jos\'{e}e and Jagadeesan, Radha}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2016.31}, URN = {urn:nbn:de:0030-drops-61759}, doi = {10.4230/LIPIcs.CONCUR.2016.31}, annote = {Keywords: process calculi, calculus of structures, nominal logic, causal consistency} }
Simon Castellan and Pierre Clairambault. Causality vs. Interleavings in Concurrent Game Semantics. In 27th International Conference on Concurrency Theory (CONCUR 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 59, pp. 32:1-32:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
@InProceedings{castellan_et_al:LIPIcs.CONCUR.2016.32, author = {Castellan, Simon and Clairambault, Pierre}, title = {{Causality vs. Interleavings in Concurrent Game Semantics}}, booktitle = {27th International Conference on Concurrency Theory (CONCUR 2016)}, pages = {32:1--32:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-017-0}, ISSN = {1868-8969}, year = {2016}, volume = {59}, editor = {Desharnais, Jos\'{e}e and Jagadeesan, Radha}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2016.32}, URN = {urn:nbn:de:0030-drops-61620}, doi = {10.4230/LIPIcs.CONCUR.2016.32}, annote = {Keywords: Game semantics, concurrency, causality, event structures} }
Marco Carbone, Sam Lindley, Fabrizio Montesi, Carsten Schürmann, and Philip Wadler. Coherence Generalises Duality: A Logical Explanation of Multiparty Session Types. In 27th International Conference on Concurrency Theory (CONCUR 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 59, pp. 33:1-33:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
@InProceedings{carbone_et_al:LIPIcs.CONCUR.2016.33, author = {Carbone, Marco and Lindley, Sam and Montesi, Fabrizio and Sch\"{u}rmann, Carsten and Wadler, Philip}, title = {{Coherence Generalises Duality: A Logical Explanation of Multiparty Session Types}}, booktitle = {27th International Conference on Concurrency Theory (CONCUR 2016)}, pages = {33:1--33:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-017-0}, ISSN = {1868-8969}, year = {2016}, volume = {59}, editor = {Desharnais, Jos\'{e}e and Jagadeesan, Radha}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2016.33}, URN = {urn:nbn:de:0030-drops-61811}, doi = {10.4230/LIPIcs.CONCUR.2016.33}, annote = {Keywords: Multiparty Session Types, Linear Logic, Propositions as Types} }
Daniel Hausmann, Lutz Schröder, and Christoph Egger. Global Caching for the Alternation-free µ-Calculus. In 27th International Conference on Concurrency Theory (CONCUR 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 59, pp. 34:1-34:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
@InProceedings{hausmann_et_al:LIPIcs.CONCUR.2016.34, author = {Hausmann, Daniel and Schr\"{o}der, Lutz and Egger, Christoph}, title = {{Global Caching for the Alternation-free µ-Calculus}}, booktitle = {27th International Conference on Concurrency Theory (CONCUR 2016)}, pages = {34:1--34:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-017-0}, ISSN = {1868-8969}, year = {2016}, volume = {59}, editor = {Desharnais, Jos\'{e}e and Jagadeesan, Radha}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2016.34}, URN = {urn:nbn:de:0030-drops-61724}, doi = {10.4230/LIPIcs.CONCUR.2016.34}, annote = {Keywords: modal logic, fixpoint logic, satisfiability, global caching, coalgebraic logic} }
Konstantinos Chatzikokolakis, Catuscia Palamidessi, and Valeria Vignudelli. Up-To Techniques for Generalized Bisimulation Metrics. In 27th International Conference on Concurrency Theory (CONCUR 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 59, pp. 35:1-35:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
@InProceedings{chatzikokolakis_et_al:LIPIcs.CONCUR.2016.35, author = {Chatzikokolakis, Konstantinos and Palamidessi, Catuscia and Vignudelli, Valeria}, title = {{Up-To Techniques for Generalized Bisimulation Metrics}}, booktitle = {27th International Conference on Concurrency Theory (CONCUR 2016)}, pages = {35:1--35:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-017-0}, ISSN = {1868-8969}, year = {2016}, volume = {59}, editor = {Desharnais, Jos\'{e}e and Jagadeesan, Radha}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2016.35}, URN = {urn:nbn:de:0030-drops-61793}, doi = {10.4230/LIPIcs.CONCUR.2016.35}, annote = {Keywords: bisimulation, metrics, up-to techniques, Kantorovich, differential privacy} }
Valentina Castiglioni, Daniel Gebler, and Simone Tini. Modal Decomposition on Nondeterministic Probabilistic Processes. In 27th International Conference on Concurrency Theory (CONCUR 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 59, pp. 36:1-36:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
@InProceedings{castiglioni_et_al:LIPIcs.CONCUR.2016.36, author = {Castiglioni, Valentina and Gebler, Daniel and Tini, Simone}, title = {{Modal Decomposition on Nondeterministic Probabilistic Processes}}, booktitle = {27th International Conference on Concurrency Theory (CONCUR 2016)}, pages = {36:1--36:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-017-0}, ISSN = {1868-8969}, year = {2016}, volume = {59}, editor = {Desharnais, Jos\'{e}e and Jagadeesan, Radha}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2016.36}, URN = {urn:nbn:de:0030-drops-61665}, doi = {10.4230/LIPIcs.CONCUR.2016.36}, annote = {Keywords: SOS, nondeterministic probabilistic process algebras, logical characterization, decomposition of modal formulae} }
Nathalie Bertrand, Serge Haddad, and Engel Lefaucheux. Diagnosis in Infinite-State Probabilistic Systems. In 27th International Conference on Concurrency Theory (CONCUR 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 59, pp. 37:1-37:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
@InProceedings{bertrand_et_al:LIPIcs.CONCUR.2016.37, author = {Bertrand, Nathalie and Haddad, Serge and Lefaucheux, Engel}, title = {{Diagnosis in Infinite-State Probabilistic Systems}}, booktitle = {27th International Conference on Concurrency Theory (CONCUR 2016)}, pages = {37:1--37:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-017-0}, ISSN = {1868-8969}, year = {2016}, volume = {59}, editor = {Desharnais, Jos\'{e}e and Jagadeesan, Radha}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2016.37}, URN = {urn:nbn:de:0030-drops-61597}, doi = {10.4230/LIPIcs.CONCUR.2016.37}, annote = {Keywords: probabilistic systems, infinite-state systems, pushdown automata, diagnosis, partial observation} }
Feedback for Dagstuhl Publishing