Acta Informatica, Volume 54

Volume 54, Number 1, February 2017

Special Issue: Selected papers from the 26th International Conference on Concurrency Theory (CONCUR 2015)

• 
  Luca Aceto, David de Frutos-Escrig:
  Special issue: Selected papers from the 26th International Conference on Concurrency Theory (CONCUR 2015). 1-2
• 
  Paul Hunter, Guillermo A. Pérez, Jean-François Raskin:
  Reactive synthesis without regret. 3-39
• 
  Romain Brenguier, Jean-François Raskin, Ocan Sankur:
  Assume-admissible synthesis. 41-83
• 
  Thomas Brihaye, Gilles Geeraerts, Axel Haddad, Benjamin Monmege:
  Pseudopolynomial iterative algorithm to solve total-payoff games and min-cost reachability games. 85-125

Volume 54, Number 2, March 2017

Special issue: Selected papers from the 26th International Conference on Concurrency Theory (CONCUR 2015) - Part 2

• 
  Filippo Bonchi, Daniela Petrisan, Damien Pous, Jurriaan Rot:
  A general account of coinduction up-to. 127-190
• 
  Javier Esparza, Pierre Ganty, Jérôme Leroux, Rupak Majumdar:
  Verification of population protocols. 191-215
• 
  Sadegh Esmaeil Zadeh Soudjani, Alessandro Abate, Rupak Majumdar:
  Dynamic Bayesian networks for formal verification of structured stochastic processes. 217-242

Volume 54, Number 3, May 2017

Special Issue: Selected Papers from the 26th International Conference on Concurrency Theory (CONCUR 2015) - Part 3

• 
  Marco Carbone, Fabrizio Montesi, Carsten Schürmann, Nobuko Yoshida:
  Multiparty session types as coherence proofs. 243-269
• 
  Dimitrios Kouzapas, Jorge A. Pérez, Nobuko Yoshida:
  Characteristic bisimulation for higher-order session processes. 271-341

Volume 54, Number 4, June 2017

• 
  Mohammad Mahdi Jaghoori, Frank S. de Boer, Delphine Longuet, Tom Chothia, Marjan Sirjani:
  Compositional schedulability analysis of real-time actor-based systems. 343-378
• 
  Lila Kari, Manasi S. Kulkarni:
  Disjunctivity and other properties of sets of pseudo-bordered words. 379-398
• 
  Pierpaolo Degano, Gian-Luigi Ferrari, Gianluca Mezzetti:
  Regular and context-free nominal traces. 399-433
• 
  Bogdan Aman, Gabriel Ciobanu:
  Efficiently solving the Bin Packing problem through bio-inspired mobility. 435-445

Volume 54, Number 5, August 2017

• 
  Andrea Marin, Sabina Rossi:
  On the relations between Markov chain lumpability and reversibility. 447-485
• 
  Kingshuk Chatterjee, Kumar Sankar Ray:
  Reversible Watson-Crick automata. 487-499
• 
  Achour Mostéfaoui, Michel Raynal:
  Signature-free asynchronous Byzantine systems: from multivalued to binary consensus with t< n/3, O(n²) messages, and constant time. 501-520
• 
  Ke Gu, Weijia Jia, Guojun Wang, Sheng Wen:
  Efficient and secure attribute-based signature for monotone predicates. 521-541

Volume 54, Number 6, September 2017

Special Issue: Synthesis - Part 1

• 
  Krishnendu Chatterjee, Rüdiger Ehlers:
  Special issue: Synthesis and SYNT 2014. 543-544
• 
  Aaron Bohy, Véronique Bruyère, Jean-François Raskin, Nathalie Bertrand:
  Symblicit algorithms for mean-payoff and shortest path in monotonic Markov decision processes. 545-587
• 
  Milan Ceska, Frits Dannenberg, Nicola Paoletti, Marta Kwiatkowska, Lubos Brim:
  Precise parameter synthesis for stochastic biochemical systems. 589-623

Volume 54, Number 7, November 2017

Special Issue: Synthesis - Part 2

• 
  Chung-Hao Huang, Sven Schewe, Farn Wang:
  Model-checking iterated games. 625-654
• 
  Takashi Tomita, Atsushi Ueno, Masaya Shimakawa, Shigeki Hagihara, Naoki Yonezaki:
  Safraless LTL synthesis considering maximal realizability. 655-692
• 
  Susmit Jha, Sanjit A. Seshia:
  A theory of formal synthesis via inductive learning. 693-726

Volume 54, Number 8, December 2017

Special issue: The 21st International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS 2015)

• 
  Christel Baier, Cesare Tinelli:
  Special issue of the 21st International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS 2015). 727-728
• 
  Dmitry Chistikov, Rayna Dimitrova, Rupak Majumdar:
  Approximate counting in SMT and value estimation for probabilistic programs. 729-764
• 
  Mirco Giacobbe, Calin C. Guet, Ashutosh Gupta, Thomas A. Henzinger, Tiago Paixão, Tatjana Petrov:
  Model checking the evolution of gene regulatory networks. 765-787
• 
  Parosh Aziz Abdulla, Stavros Aronis, Mohamed Faouzi Atig, Bengt Jonsson, Carl Leonardsson, Konstantinos Sagonas:
  Stateless model checking for TSO and PSO. 789-818