CONCUR B

40 papers

YearTitle / Authors
2014(Un)decidable Problems about Reachability of Quantum Systems.
Yangjia Li, Mingsheng Ying
2014A Categorical Semantics of Signal Flow Graphs.
Filippo Bonchi, Pawel Sobocinski, Fabio Zanasi
2014A General Framework for Well-Structured Graph Transformation Systems.
Barbara König, Jan Stückrath
2014A Linear-Time Algorithm for the Orbit Problem over Cyclic Groups.
Anthony Widjaja Lin, Sanming Zhou
2014A Nearly Optimal Upper Bound for the Self-Stabilization Time in Herman's Algorithm.
Yuan Feng, Lijun Zhang
2014A Semantic Deconstruction of Session Types.
Massimo Bartoletti, Alceste Scalas, Roberto Zunino
2014Adding Negative Prices to Priced Timed Games.
Thomas Brihaye, Gilles Geeraerts, Shankara Narayanan Krishna, Lakshmi Manasa, Benjamin Monmege, Ashutosh Trivedi
2014Averaging in LTL.
Patricia Bouyer, Nicolas Markey, Raj Mohan Matteplackel
2014Bisimulations Up-to: Beyond First-Order Transition Systems.
Jean-Marie Madiot, Damien Pous, Davide Sangiorgi
2014Bounds on Mobility.
Reiner Hüchting, Rupak Majumdar, Roland Meyer
2014CONCUR 2014 - Concurrency Theory - 25th International Conference, CONCUR 2014, Rome, Italy, September 2-5, 2014. Proceedings
Paolo Baldan, Daniele Gorla
2014Choreographies, Logically.
Marco Carbone, Fabrizio Montesi, Carsten Schürmann
2014Compositional Controller Synthesis for Stochastic Games.
Nicolas Basset, Marta Z. Kwiatkowska, Clemens Wiltsche
2014Controllers for the Verification of Communicating Multi-pushdown Systems.
C. Aiswarya, Paul Gastin, K. Narayan Kumar
2014Deadlock Analysis of Unbounded Process Networks.
Elena Giachino, Naoki Kobayashi, Cosimo Laneve
2014Decidable Topologies for Communicating Automata with FIFO and Bag Channels.
Lorenzo Clemente, Frédéric Herbreteau, Grégoire Sutre
2014Deterministic Negotiations: Concurrency for Free.
Javier Esparza
2014Generalized Bisimulation Metrics.
Konstantinos Chatzikokolakis, Daniel Gebler, Catuscia Palamidessi, Lili Xu
2014Generic Forward and Backward Simulations III: Quantitative Simulations by Matrices.
Natsuki Urabe, Ichiro Hasuo
2014Laws of Programming: The Algebraic Unification of Theories of Concurrency.
Tony Hoare
2014Lost in Abstraction: Monotonicity in Multi-threaded Programs.
Alexander Kaiser, Daniel Kroening, Thomas Wahl
2014On the Completeness of Bounded Model Checking for Threshold-Based Distributed Algorithms: Reachability.
Igor Konnov, Helmut Veith, Josef Widder
2014Ordered Navigation on Multi-attributed Data Words.
Normann Decker, Peter Habermehl, Martin Leucker, Daniel Thoma
2014Pairwise Reachability Analysis for Higher Order Concurrent Programs by Higher-Order Model Checking.
Kazuhide Yasukata, Naoki Kobayashi, Kazutaka Matsuda
2014Parameterized Model Checking of Rendezvous Systems.
Benjamin Aminof, Tomer Kotek, Sasha Rubin, Francesco Spegni, Helmut Veith
2014Perturbation Analysis in Verification of Discrete-Time Markov Chains.
Taolue Chen, Yuan Feng, David S. Rosenblum, Guoxin Su
2014Probabilistic Bisimulation: Naturally on Distributions.
Holger Hermanns, Jan Krcál, Jan Kretínský
2014Probabilistic Robust Timed Games.
Youssouf Oualhadj, Pierre-Alain Reynier, Ocan Sankur
2014Qualitative Concurrent Parity Games: Bounded Rationality.
Krishnendu Chatterjee
2014Reducing Clocks in Timed Automata while Preserving Bisimulation.
Shibashis Guha, Chinmay Narayan, S. Arun-Kumar
2014Robust Synchronization in Markov Decision Processes.
Laurent Doyen, Thierry Massart, Mahsa Shirmohammadi
2014Synchronizing Strategies under Partial Observability.
Kim Guldstrand Larsen, Simon Laursen, Jirí Srba
2014Synthesis from Component Libraries with Costs.
Guy Avni, Orna Kupferman
2014The Benefits of Sometimes Not Being Discrete.
Jane Hillston
2014Tight Game Abstractions of Probabilistic Automata.
Falak Sher Vira, Joost-Pieter Katoen
2014Timed Multiparty Session Types.
Laura Bocchi, Weizhen Yang, Nobuko Yoshida
2014Trees from Functions as Processes.
Davide Sangiorgi, Xian Xu
2014Typing Messages for Free in Security Protocols: The Case of Equivalence Properties.
Rémy Chrétien, Véronique Cortier, Stéphanie Delaune
2014Using Higher-Order Contracts to Model Session Types (Extended Abstract).
Giovanni Bernardi, Matthew Hennessy
2014Verification for Timed Automata Extended with Unbounded Discrete Data Structures.
Karin Quaas