Title/Authors | Title | Research Artifacts
[?] A research
artifact is any by-product of a research project that is not
directly included in the published research paper. In Computer
Science research this is often source code and data sets, but
it could also be media, documentation, inputs to proof
assistants, shell-scripts to run experiments, etc.
|
Details |
---|
Filippo Bonchi, Alexandra Silva, Ana Sokolova |
Details |
|
Discussion Comments:
0
Verification:
Authors have
not verified
information
|
Rule Formats for Nominal Process Calculi Luca Aceto, Ignacio Fábregas, Álvaro García-Pérez, Anna Ingólfsdóttir, Yolanda Ortega-Mallén |
Rule Formats for Nominal Process Calculi Details |
|
Discussion Comments:
0
Verification:
Authors have
not verified
information
|
k-Bounded Petri Net Synthesis from Modal Transition Systems Uli Schlachter, Harro Wimmel |
k-Bounded Petri Net Synthesis from Modal Transition Systems Details |
|
Discussion Comments:
0
Verification:
Authors have
not verified
information
|
Refinement for Signal Flow Graphs Filippo Bonchi, Joshua Holland, Dusko Pavlovic, Pawel Sobocinski |
Refinement for Signal Flow Graphs Details |
Author Comments:
Discussion Comments:
0
Sharing:
Research produced artifacts
Verification:
Authors have
verified
information
|
|
Uniform Sampling for Networks of Automata Nicolas Basset, Jean Mairesse, Michèle Soria |
Uniform Sampling for Networks of Automata Details |
|
Discussion Comments:
0
Verification:
Authors have
not verified
information
|
Parosh Aziz Abdulla, C. Aiswarya, Mohamed Faouzi Atig |
Details |
|
Discussion Comments:
0
Verification:
Authors have
not verified
information
|
Algorithms to Compute Probabilistic Bisimilarity Distances for Labelled Markov Chains Qiyi Tang, Franck van Breugel |
Algorithms to Compute Probabilistic Bisimilarity Distances for Labelled Markov Chains Details |
|
Author Comments:
Discussion Comments:
0
Sharing:
Not able to share produced artifacts
Verification:
Authors have
verified
information
|
Towards an Efficient Tree Automata Based Technique for Timed Systems S. Akshay, Paul Gastin, Shankara Narayanan Krishna, Ilias Sarkar |
Towards an Efficient Tree Automata Based Technique for Timed Systems Details |
Discussion Comments:
0
Verification:
Authors have
not verified
information
|
|
Goal-Driven Unfolding of Petri Nets Thomas Chatain, Loïc Paulevé |
Goal-Driven Unfolding of Petri Nets Details |
Discussion Comments:
0
Verification:
Authors have
not verified
information
|
|
Efficient Coalgebraic Partition Refinement Ulrich Dorsch, Stefan Milius, Lutz Schröder, Thorsten Wißmann |
Efficient Coalgebraic Partition Refinement Details |
|
Author Comments:
All proofs can be found in the journal version.
Discussion Comments:
0
Sharing:
Research produced no artifacts
Verification:
Authors have
verified
information
|
Tractability of Separation Logic with Inductive Definitions: Beyond Lists Taolue Chen, Fu Song, Zhilin Wu |
Tractability of Separation Logic with Inductive Definitions: Beyond Lists Details |
|
Discussion Comments:
0
Verification:
Authors have
not verified
information
|
A Characterisation of Open Bisimilarity using an Intuitionistic Modal Logic Ki Yung Ahn, Ross Horne, Alwen Tiu |
A Characterisation of Open Bisimilarity using an Intuitionistic Modal Logic Details |
Discussion Comments:
0
Verification:
Authors have
not verified
information
|
|
Coverability Synthesis in Parametric Petri Nets Nicolas David, Claude Jard, Didier Lime, Olivier H. Roux |
Coverability Synthesis in Parametric Petri Nets Details |
|
Discussion Comments:
0
Verification:
Authors have
not verified
information
|
Brzozowski Goes Concurrent - A Kleene Theorem for Pomset Languages Tobias Kappé, Paul Brunet, Bas Luttik, Alexandra Silva, Fabio Zanasi |
Brzozowski Goes Concurrent - A Kleene Theorem for Pomset Languages Details |
|
Author Comments:
Discussion Comments:
0
Sharing:
Research produced no artifacts
Verification:
Authors have
verified
information
|
Divide and Congruence III: Stability & Divergence Wan J. Fokkink, Rob J. van Glabbeek, Bas Luttik |
Divide and Congruence III: Stability & Divergence Details |
|
Discussion Comments:
0
Verification:
Authors have
not verified
information
|
On Petri Nets with Hierarchical Special Arcs S. Akshay, Supratik Chakraborty, Ankush Das, Vishal Jagannath, Sai Sandeep |
On Petri Nets with Hierarchical Special Arcs Details |
|
Discussion Comments:
0
Verification:
Authors have
not verified
information
|
Bidirectional Nested Weighted Automata Krishnendu Chatterjee, Thomas A. Henzinger, Jan Otop |
Bidirectional Nested Weighted Automata Details |
|
Discussion Comments:
0
Verification:
Authors have
not verified
information
|
Consistently-Detecting Monitors Adrian Francalanza |
Consistently-Detecting Monitors Details |
|
Discussion Comments:
0
Verification:
Author has
not verified
information
|
Nash Equilibrium and Bisimulation Invariance Julian Gutierrez, Paul Harrenstein, Giuseppe Perelli, Michael J. Wooldridge |
Nash Equilibrium and Bisimulation Invariance Details |
|
Discussion Comments:
0
Verification:
Authors have
not verified
information
|
Model-Checking Counting Temporal Logics on Flat Structures Normann Decker, Peter Habermehl, Martin Leucker, Arnaud Sangnier, Daniel Thoma |
Model-Checking Counting Temporal Logics on Flat Structures Details |
|
Discussion Comments:
0
Verification:
Authors have
not verified
information
|
The Robot Routing Problem for Collecting Aggregate Stochastic Rewards Rayna Dimitrova, Ivan Gavran, Rupak Majumdar, Vinayak S. Prabhu, Sadegh Esmaeil Zadeh Soudjani |
The Robot Routing Problem for Collecting Aggregate Stochastic Rewards Details |
|
Author Comments:
Discussion Comments:
0
Sharing:
Research produced no artifacts
Verification:
Authors have
verified
information
|
Checking Linearizability of Concurrent Priority Queues Ahmed Bouajjani, Constantin Enea, Chao Wang |
Checking Linearizability of Concurrent Priority Queues Details |
|
Discussion Comments:
0
Verification:
Authors have
not verified
information
|
Unbounded Product-Form Petri Nets Patricia Bouyer, Serge Haddad, Vincent Jugé |
Unbounded Product-Form Petri Nets Details |
|
Discussion Comments:
0
Verification:
Authors have
not verified
information
|
Infinite-Duration Bidding Games Guy Avni, Thomas A. Henzinger, Ventsislav Chonev |
Infinite-Duration Bidding Games Details |
|
Discussion Comments:
0
Verification:
Authors have
not verified
information
|
Mingzhang Huang, Qiang Yin |
Details |
|
Discussion Comments:
0
Verification:
Authors have
not verified
information
|
Probabilistic Automata of Bounded Ambiguity Nathanaël Fijalkow, Cristian Riveros, James Worrell |
Probabilistic Automata of Bounded Ambiguity Details |
|
Author Comments:
Discussion Comments:
0
Sharing:
Research produced no artifacts
Verification:
Authors have
verified
information
|
Orna Kupferman, Gal Vardi |
Details |
|
Discussion Comments:
0
Verification:
Authors have
not verified
information
|
Model Checking Omega-regular Properties for Quantum Markov Chains Yuan Feng, Ernst Moritz Hahn, Andrea Turrini, Shenggang Ying |
Model Checking Omega-regular Properties for Quantum Markov Chains Details |
|
Discussion Comments:
0
Verification:
Authors have
not verified
information
|
Admissibility in Games with Imperfect Information (Invited Talk) Romain Brenguier, Arno Pauly, Jean-François Raskin, Ocan Sankur |
Admissibility in Games with Imperfect Information (Invited Talk) Details |
|
Discussion Comments:
0
Verification:
Authors have
not verified
information
|
Forward Progress on GPU Concurrency (Invited Talk) Alastair F. Donaldson, Jeroen Ketema, Tyler Sorensen, John Wickerson |
Forward Progress on GPU Concurrency (Invited Talk) Details |
|
Author Comments:
Discussion Comments:
0
Sharing:
Publication does not represent original research
Verification:
Authors have
verified
information
|
On Decidability of Concurrent Kleene Algebra Paul Brunet, Damien Pous, Georg Struth |
On Decidability of Concurrent Kleene Algebra Details |
Discussion Comments:
0
Verification:
Authors have
not verified
information
|
|
Probabilistic Programming (Invited Talk) Hongseok Yang |
Probabilistic Programming (Invited Talk) Details |
|
Discussion Comments:
0
Verification:
Author has
not verified
information
|
Andrzej S. Murawski, Nikos Tzevelekos |
Details |
|
Discussion Comments:
0
Verification:
Authors have
not verified
information
|
On the Power of Name-Passing Communication Yuxi Fu |
On the Power of Name-Passing Communication Details |
|
Discussion Comments:
0
Verification:
Author has
not verified
information
|
A New Notion of Compositionality for Concurrent Program Proofs (Invited Talk) Azadeh Farzan, Zachary Kincaid |
A New Notion of Compositionality for Concurrent Program Proofs (Invited Talk) Details |
|
Discussion Comments:
0
Verification:
Authors have
not verified
information
|
Nathalie Bertrand, Miheer Dewaskar, Blaise Genest, Hugo Gimbert |
Details |
|
Discussion Comments:
0
Verification:
Authors have
not verified
information
|
The Complexity of Flat Freeze LTL Benedikt Bollig, Karin Quaas, Arnaud Sangnier |
The Complexity of Flat Freeze LTL Details |
|
Discussion Comments:
0
Verification:
Authors have
not verified
information
|
Divergence and Unique Solution of Equations Adrien Durier, Daniel Hirschkoff, Davide Sangiorgi |
Divergence and Unique Solution of Equations Details |
Discussion Comments:
0
Verification:
Authors have
not verified
information
|
|
Algebraic Laws for Weak Consistency Andrea Cerone, Alexey Gotsman, Hongseok Yang |
Algebraic Laws for Weak Consistency Details |
|
Discussion Comments:
0
Verification:
Authors have
not verified
information
|
Concurrent Reversible Sessions Ilaria Castellani, Mariangiola Dezani-Ciancaglini, Paola Giannini |
Concurrent Reversible Sessions Details |
|
Discussion Comments:
0
Verification:
Authors have
not verified
information
|