ACSD’18 Programme

Session 1: State-space Construction and Reachability

  • Benjamin Smith and Gianfranco Ciardo: SOUPS: A Variable Ordering Metric for the Saturation Algorithm
  • Parosh Aziz Abdulla, C: Aiswarya, Mohamed Faouzi Atig, Marco Montali and Othmane Rezine. Complexity of Reachability for Data-aware Dynamic Systems

Session 2: Time

  • Étienne André, Didier Lime and Mathias Ramparison: Timed automata with parametric resets
  • Hanifa Boucheneb, Didier Lime, Olivier H. Roux and Charlotte Seidner: Optimal-cost reachability analysis based on time Petri nets
  • Bram van der Sanden, Marc Geilen, Michel Reniers and Twan Basten: Partial-Order Reduction for Performance Analysis of Max-Plus Timed Systems

Session 3: Process Models

  • Vincent Bloemen, Jaco van de Pol and Wil van der Aalst: Symbolically Aligning Observed and Modelled Behaviour
  • Dennis Schmitz, Daniel Moldt, Michael Haustermann, David Mosteller and Christian Röder: Team Coordination Based on Causal Nets with Synchronous Channels

Session 4: Fault, Suspicion and Concurrency!

  • Bowen Li, Maciej Koutny, Brian Randell, Anirban Bhattacharyya and Talal Alharbi: SONCraft: A Tool for Construction, Simulation and Analysis of Structured Occurrence Nets
  • Loic Helouet, Hervé Marchand and John Mullins: Concurrent secrets with quantified suspicion
  • Ayleen Schinko and Walter Vogler: Fault-Free Refinements for Interface Automata

Session 5: System Design

  • Alexander Schulz-Rosengarten, Steven Smyth, Reinhard von Hanxleden and Michael Mendler: On Reconciling Concurrency, Sequentiality and Determinacy for Reactive Systems – A Sequentially Constructive Circuit Semantics for Esterel
  • Fatma Jebali and Dumitru Potop-Butucaru: Ensuring consistency between cycle-accurate and instruction set simulators
  • Markus Anders, Anoop Bhagyanath and Klaus Schneider: On Memory Optimal Code Generation for Exposed Datapath Architectures with Buffered Processing Units