default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID29th CONCUR 2018: Beijing, China
- Sven Schewe, Lijun Zhang:
29th International Conference on Concurrency Theory, CONCUR 2018, September 4-7, 2018, Beijing, China. LIPIcs 118, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2018, ISBN 978-3-95977-087-3 - Front Matter, Table of Contents, Preface, Conference Organization. 0:i-0:xxi
- Moshe Y. Vardi:
The Siren Song of Temporal Synthesis (Invited Talk). 1:1-1:1 - Yuxin Deng
:
Bisimulations for Probabilistic and Quantum Processes (Invited Paper). 2:1-2:14 - Rob van Glabbeek:
Is Speed-Independent Mutual Exclusion Implementable? (Invited Talk). 3:1-3:1 - Andy Polyakov, Ming-Hsien Tsai, Bow-Yaw Wang, Bo-Yin Yang:
Verifying Arithmetic Assembly Programs in Cryptographic Primitives (Invited Talk). 4:1-4:16 - Ichiro Hasuo:
Coalgebraic Theory of Büchi and Parity Automata: Fixed-Point Specifications, Categorically (Invited Tutorial). 5:1-5:2 - Parosh Aziz Abdulla, Mohamed Faouzi Atig, Radu Ciobanu, Richard Mayr, Patrick Totzke:
Universal Safety for Timed Petri Nets is PSPACE-complete. 6:1-6:15 - Benedikt Bollig, Marie Fortin, Paul Gastin:
It Is Easy to Be Wise After the Event: Communicating Finite-State Machines Capture First-Order Logic with "Happened Before". 7:1-7:17 - Jan Kretínský, Guillermo A. Pérez, Jean-François Raskin:
Learning-Based Mean-Payoff Optimization in an Unknown MDP under Omega-Regular Constraints. 8:1-8:18 - Qiyi Tang, Franck van Breugel:
Deciding Probabilistic Bisimilarity Distance One for Probabilistic Automata. 9:1-9:17 - Jakub Michaliszyn, Jan Otop:
Non-deterministic Weighted Automata on Random Words. 10:1-10:16 - Krishnendu Chatterjee, Amir Kafshdar Goharshady, Rasmus Ibsen-Jensen, Yaron Velner:
Ergodic Mean-Payoff Games for the Analysis of Attacks in Crypto-Currencies. 11:1-11:17 - Roland Meyer, Sebastian Muskalla, Georg Zetzsche:
Bounded Context Switching for Valence Systems. 12:1-12:18 - Paulin Fournier, Hugo Gimbert:
Alternating Nonzero Automata. 13:1-13:16 - Michael Blondin, Christoph Haase, Filip Mazowiecki:
Affine Extensions of Integer Vector Addition Systems with States. 14:1-14:17 - Mohamed Faouzi Atig, Ahmed Bouajjani, K. Narayan Kumar, Prakash Saivasan:
Verifying Quantitative Temporal Properties of Procedural Programs. 15:1-15:17 - Ronny Tredup, Christian Rosenke:
Narrowing down the Hardness Barrier of Synthesizing Elementary Net Systems. 16:1-16:15 - Filippo Bonchi, Barbara König, Daniela Petrisan:
Up-To Techniques for Behavioural Metrics via Fibrations. 17:1-17:17 - Amina Doumane, Damien Pous:
Completeness for Identity-free Kleene Lattices. 18:1-18:17 - Jure Kukovec, Igor Konnov, Josef Widder:
Reachability in Parameterized Systems: All Flavors of Threshold Automata. 19:1-19:17 - Radu Grigore, Stefan Kiefer:
Selective Monitoring. 20:1-20:16 - Bernhard Kragl, Shaz Qadeer, Thomas A. Henzinger:
Synchronizing the Asynchronous. 21:1-21:17 - Sergey Goncharov, Julian Jakob, Renato Neves:
A Semantics for Hybrid Iteration. 22:1-22:17 - Tyler Sorensen, Hugues Evrard, Alastair F. Donaldson:
GPU Schedulers: How Fair Is Fair Enough?. 23:1-23:17 - Piotr Hofman, Slawomir Lasota:
Linear Equations with Ordered Data. 24:1-24:17 - Tomasz Brengos:
A Coalgebraic Take on Regular and omega-Regular Behaviour for Systems with Internal Moves. 25:1-25:18 - Nima Roohi, Pavithra Prabhakar, Mahesh Viswanathan:
Relating Syntactic and Semantic Perturbations of Hybrid Automata. 26:1-26:16 - Benjamin Cabrera, Tobias Heindel, Reiko Heckel, Barbara König:
Updating Probabilistic Knowledge on Condition/Event Nets using Bayesian Networks. 27:1-27:17 - Paul Gastin, Sayan Mukherjee, B. Srivathsan:
Reachability in Timed Automata with Diagonal Constraints. 28:1-28:17 - Véronique Bruyère, Quentin Hautem, Jean-François Raskin:
Parameterized complexity of games with monotonically ordered omega-regular objectives. 29:1-29:16 - Stephanie Balzer, Frank Pfenning, Bernardo Toninho:
A Universal Session Type for Untyped Asynchronous Communication. 30:1-30:18 - Javier Esparza, Pierre Ganty, Rupak Majumdar, Chana Weil-Kennedy:
Verification of Immediate Observation Population Protocols. 31:1-31:16 - Jan Kretínský, Alexej Rotar:
The Satisfiability Problem for Unbounded Fragments of Probabilistic CTL. 32:1-32:16 - Michael Blondin, Javier Esparza, Antonín Kucera:
Automatic Analysis of Expected Termination Time for Population Protocols. 33:1-33:16 - Luca Aceto, Ian Cassar, Adrian Francalanza, Anna Ingólfsdóttir:
On Runtime Enforcement via Suppressions. 34:1-34:17 - Wojciech Czerwinski, Slawomir Lasota, Roland Meyer, Sebastian Muskalla, K. Narayan Kumar, Prakash Saivasan:
Regular Separability of Well-Structured Transition Systems. 35:1-35:18 - Andrey Gorlin, C. R. Ramakrishnan:
Separable GPL: Decidable Model Checking with More Non-Determinism. 36:1-36:16 - Barbara König, Christina Mika-Michalski:
(Metric) Bisimulation Games and Real-Valued Modal Logics for Coalgebras. 37:1-37:17 - Rodica Condurache, Youssouf Oualhadj, Nicolas Troquard:
The Complexity of Rational Synthesis for Concurrent Games. 38:1-38:15 - Shankara Narayanan Krishna, Khushraj Madnani, Paritosh K. Pandya:
Logics Meet 1-Clock Alternating Timed Automata. 39:1-39:17 - Massimo Bartoletti, Laura Bocchi, Maurizio Murgia:
Progress-Preserving Refinements of CTA. 40:1-40:19 - Kartik Nagar, Suresh Jagannathan:
Automated Detection of Serializability Violations Under Weak Consistency. 41:1-41:18 - Shaull Almagor, Brynmor Chapman, Mehran Hosseini, Joël Ouaknine, James Worrell:
Effective Divergence Analysis for Linear Recurrence Sequences. 42:1-42:15
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-11-08 20:17 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
