AISB Wired Health

    AISB and WIRED events have partnered to bring together inspirational high-profile speakers. Join hundreds of healthcare, pharmaceutical and technology influencers and leaders at the 4th Annual WIRED Health event, taking pl...


Hugh Gene Loebner

  The AISB were sad to learn last week of the passing of philanthropist and inventor Hugh Gene Loebner PhD, who died peacefully in his home in New York at the age of 74.  Hugh was founder and sponsor of The Loebner Prize, an an...


AI Europe 2016

  Partnership between AISB and AI Europe 2016: Next December 5th and 6th in London, AI Europe will bring together the European AI eco-system by gathering new tools and future technologies appearing in professional fields for th...


AISB convention 2017

  In the run up to AISB2017 convention (, I've asked Joanna Bryson, from the organising team, to answer few questions about the convention and what comes with it. Mohammad Majid...


Harold Cohen

Harold Cohen, tireless computer art pioneer dies at 87   Harold Cohen at the Tate (1983) Aaron image in background   Harold Cohen died at 87 in his studio on 27th April 2016 in Encintias California, USA.The first time I hear...


Dancing with Pixies?...

At TEDx Tottenham, London Mark Bishop (the former chair of the Society) demonstrates that if the ongoing EU flagship science project - the 1.6 billion dollar "Human Brain Project” - ultimately succeeds in understanding all as...


Computerised Minds. ...

A video sponsored by the society discusses Searle's Chinese Room Argument (CRA) and the heated debates surrounding it. In this video, which is accessible to the general public and those with interest in AI, Olly's Philosophy Tube ...


Connection Science

All individual members of The Society for the Study of Artificial Intelligence and Simulation of Behaviour have a personal subscription to the Taylor Francis journal Connection Science as part of their membership. How to Acce...



AISB opportunities Bulletin Item

Postdoctoral positions in reachability problems, Bordeaux & Cachan, FRANCE

The ANR project REACHARD proposes several PostDoc positions on reachability problems for counter 
systems, including vector addition systems and related models. Each position can take place either
- at LaBRI, University of Bordeaux, France (, or
- at LSV, ENS Cachan, France (

See also


Candidates for PostDoc positions should  send to a detailed 
curriculum vitae, a reference letter by the PhD supervisor and a link to the PhD thesis.


Many standard verification problems can be rephrased as reachability problems, and there exist 
powerful methods for infinite-state systems; see e.g. the theory of well-structured transition 
systems.  However, obtaining decision procedures is not the ultimate goal, which we rather see 
in crafting provably optimal algorithms---required for practical use.  In the ANR project REACHARD,
we focus on algorithmic issues for the verification of counter systems, more specifically to 
reachability problems for vector addition systems with states (VASS) and related models.

More specifically, the main objective of the ANR project REACHARD is to propose a satisfactory 
solution to the reachability problem for vector addition systems, that will provide significant 
improvements both conceptually and computationally.  Recent breakthroughs on the problem and on 
related problems for variant models should also allow us to propose solutions for several 
extensions, including for instance VASS with one zero-test or branching VASS.  Furthermore, the 
goal is to take advantage of the new proof techniques involving semilinear separators designed by 
J. Leroux in order to design algorithms that are amenable for implementation.  We propose to 
develop original techniques in order to solve the following difficult issues:

- to understand the mathematical structure of reachability sets and relations in vector addition systems,

- to develop new techniques for the computational analysis of reachability problems that are 
verification problems connected in some way to the reachability problem for VASS or their extensions,

- to design algorithms, most probably on the lines of Karp & Miller algorithms, plus relating 
flattening methods and semilinearity,

- to widen the scope of our analysis to models richer than VASS, including models with restricted 
zero-tests or with branching computations.


Any further inquiry should be sent to