Monday (June 26)

13:00-14:00
Lunch

14:00-14:15
Opening
Marco Bernardo, Pedro D'Argenio, Ana Sokolova (message from the organizers)

14:15-15:45
Process Calculi and Verification
Chair: Marco Bernardo

• What Was Wrong with Process Calculi and How To Recover
  Hubert Garavel
• Determining Bisimulation in Linear Time with a Logarithmic Number of Processors
  Jan Friso Groote
• A Hybrid Approach to Automatic Verification of Concurrent Systems: Type Systems and Model Checking
  Cosimo Laneve

15:45-16:15
Coffee break

16:15-17:45
Cyber-Physical Systems and Automata
Chair: Pedro D'Argenio

• Quantitative Robustness Analysis of Sensor Attacks on Cyber-Physical Systems
  Simone Tini
• A Formal Framework for Cyber-Physical Systems: Uncertainties, Adaptability, and Verification
  Valentina Castiglioni
• Adaptive and Compositional Active Automata Learning
  Mohammad R. Mousavi

 

Tuesday (June 27)

09:15-10:45
Session Types
Chair: Emilio Tuosto

• Open Problems on Session Types
  Nobuko Yoshida
• Event Structure Semantics for Session Calculi
  Ilaria Castellani
• On Attacking the Termination Problem for Client-Server Sessions
  Luca Padovani

10:45-11:15
Coffee break

11:15-12:45
Types and States
Chair: Nobuko Yoshida

• Shared State Session-Based Programs That Can Prove Themselves
  Luís Caires
• Fair Asynchronous Session Subtyping
  Gianluigi Zavattaro
• Observing States
  Uwe Nestmann

13:00-14:00
Lunch

14:15-15:45
Bisimulation Semantics and Verification
Chair: Rob van Glabbeek

• (Parallel) Pushdown Automata and (Commutative) Context-Free Grammars in Bisimulation Semantics
  Jos Baeten
• From Bisimulations to Dissimilarities for Linear Dynamical Systems
  Giovanni Bacci
• Verifying Shared-Memory Mutual Exclusion Algorithms with Non-Atomic Reads and Writes
  Bas Luttik

15:45-16:15
Coffee break

16:15-17:45
Properties Assurance
Chair: Jos Baeten

• Ensuring Liveness Properties of Distributed Systems with Justness
  Rob van Glabbeek
• Just Distributability
  Ursula Goltz
• Verification of Weak Memory Models
  Elli Anastasiadi

 

Wednesday (June 28)

09:15-10:45
Applications and Types
Chair: Simone Tini

• Blockchain Extractable Value
  Massimo Bartoletti
• Formal Approaches to Computer Networks
  Georgiana Caltais / Mohammad R. Mousavi
• Undecidability of Asynchronous Session Subtyping: The Hunt for Significant Decidable Variants
  Mario Bravetti

10:45-11:15
Coffee break

11:15-12:45
Categories, Coalgebras and Concurrency Models
Chair: Marino Miculan

• Deconstructing the Calculus of Relations with Tape Diagrams
  Filippo Bonchi
• Simple Coalgebraic Traces
  Ana Sokolova
• Problems in Implementing Concurrency Models and in Modeling Concurrent Abstractions: Two Case Studies
  Emilio Tuosto

13:00-14:00
Lunch

14:15-15:45
Probabilistic Systems 1
Chair: Ana Sokolova

• How To Explain Probabilistic Bisimilarity Distances?
  Franck van Breugel
• A Coinductive Topology for Reasoning about Markov Processes
  Giorgio Bacci
• Equational Theories and Metrics for Nondeterminism and Probability
  Valeria Vignudelli

15:45-16:15
Coffee break

16:15-17:45
Probabilistic Systems 2
Chair: Kim G. Larsen

• On the Challenges of Quantitative Reasoning
  Radu Mardare
• Concurrent Separation Logic with Probabilities
  Thomas Noll
• Quantitative Weakest Pre vs. Strongest Post
  Benjamin Kaminski

 

Thursday (June 29)

09:15-10:45
Timed Systems and Probability 1
Chair: Arnd Hartmanns

• Open Problems for Timed Systems
  Kim G. Larsen
• Probabilistic Timed Automata: Current Challenges and Future Directions
  Jeremy Sproston
• Approximate Bisimulations for Stochastic Processes: An Open Problem
  Sabina Rossi

10:45-11:15
Coffee break

11:15-12:45
Timed Systems and Probability 2
Chair: Jeremy Sproston

• Measuring Fault-Tolerance via Stochastic Games
  Pablo Castro
• On Schedulers and Information in Distributed and Non-Markovian Probabilistic Systems
  Arnd Hartmanns
• Reversibility in Timed Process Calculi
  Claudio A. Mezzina

13:00-14:00
Lunch

14:15-15:45
Reversibility and Quantum Computing
Chair: Claudio A. Mezzina

• An Axiomatic Theory for Reversible Computation
  Irek Ulidowski
• Reverse Bisimilarity vs. Forward Bisimilarity
  Marco Bernardo
• Formal Methods for Concurrency in Quantum-Based Systems
  Kirstin Peters

15:45-16:15
Coffee break

16:15-17:45
Emerging and Adaptive Behavior
Chair: Giovanni Bacci

• Modeling Flocks and Their Emergent Behaviors
  Rocco De Nicola
• From Global to Local and Back: Different Perspectives to Reason about Emerging Behavior
  Michele Loreti
• Modeling Collective Adaptive Systems with Attribute-Based Events: Recent Trends and Open Problems
  Marino Miculan

 

Friday (June 30)

09:15-10:45
Collective Behavior, Equivalences and Security
Chair: Rocco De Nicola

• Analysis and Design of Collective Behavior by Aggregate Computing
  Mirko Viroli
• Rooted Divergence-Preserving Branching Bisimilarity Is a Congruence for Guarded CCS
  David N. Jansen
• Securing Data and Critical Decisions in IoT Systems: A Control Flow Analysis Approach
  Chiara Bodei

10:45-11:15
Coffee break

11:15-12:45
Reversibility and True Concurrency
Chair: Irek Ulidowski

• A General Approach to Derive Uncontrolled Reversible Semantics
  Ivan Lanese
• Branching Bisimulation Semantics Enables Noninterference Analysis of Reversible Systems
  Andrea Esposito
• Refreshing an Old Problem: Relating Nets and Event Structures in the Reversible Setting
  G. Michele Pinna

12:45-13:00
Closing
Marco Bernardo, Pedro D'Argenio, Ana Sokolova

13:00-14:00
Lunch