Accepted Papers

  • Jasen Markovski. Towards Optimal Supervisory Control of Discrete-Time Stochastic Discrete-Event Processes with Data
  • Matthew Kuo, Partha Roop, Sidharta Andalam and Nitish Patel. Precision Timed Embedded Systems Using TickPAD Memory
  • Loig Jezequel, Eric Fabre and Victor Khomenko. Factored Planning: From Automata to Petri Nets
  • Mahesh Nanjundappa, Matthew Kracht, Julien Ouy and Sandeep Shukla. A novel technique for correct-by-construction concurrent code synthesis from polychronous specifications
  • Axel Legay, Saddek Bensalem, Benoît Boyer and Marius Bozga. Incremental Generation of Linear Invariants for Component-Based Systems
  • Stanislavs Golubcovs, Walter Vogler and Norman Kluge. STG-Based Resynthesis for Balsa Circuits
  • Stefan Haar, Cesar Rodriguez and Stefan Schwoon. Reveal Your Faults : It's Only Fair !
  • Lukasz Mikulski, Marcin Piątkowski and Sebastian Smyczyński. Lexicographical Generations of Combined Traces
  • Eugene Yip, Partha Roop, Morteza Biglari-Abhari and Alain Girault. Programming and Timing Analysis of Parallel Programs on Multicores
  • Franck Cassez and Jean-Luc Béchennec. Timing Analysis of Binary Programs with UPPAAL
  • Raymond Devillers, Jean-Yves Didier and Hanna Klaudel. Implementing timed automata specifications: the “sandwich” approach
  • Johannes Borgström, Ramūnas Gutkovas, Ioana Rodhe and Björn Victor. A Parametric Tool for Applied Process Calculi
  • Allan van Hulst, Michel Reniers and Wan Fokkink. Maximal Synthesis for Hennessy-Milner Logic
  • Florent Avellaneda and Remi Morin. Checking Partial-Order Properties of Vector Addition Systems with States
  • Thi Thieu Hoa Le, Roberto Passerone, Uli Fahrenberg and Axel Legay. Tag Machines for Modeling Heterogeneous Systems
  • Benjamin Morandi, Mischael Schill, Sebastian Nanz and Bertrand Meyer. Prototyping a Concurrency Model
  • Roland Kindermann, Tommi Junttila and Ilkka Niemelä. Bounded Model Checking of an MITL Fragment for Timed Automata
  • Antti Siirtola and Keijo Heljanko. Parametrised Compositional Verification with Multiple Process and Data Types
  • Thomas Hujsa, Jean-Marc Delosme and Alix Munier. Polynomial Sufficient Conditions of Well-Behavedness for Weighted Join-Free and Choice-Free Systems
  • Alexander Heußner, Gilles Geeraerts and Jean-Francois Raskin. Queue-Dispatch Asynchronous Systems
  • Manuel Gesell and Klaus Schneider. Modular Verification of Synchronous Programs
  • Jörg Desel. On cyclic behaviour of unbounded Petri nets
  • Lei Song, Lijun Zhang, Holger Hermanns and Jens Chr. Godskesen. Incremental Bisimulation Abstraction Refinement
  • Jiri Barnat, Lubos Brim and Vojtech Havel. LTL Model Checking of Parallel Programs with Under-Approximated TSO Memory Model

Posted by ACSD April 9th, 2013