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 ...


Erden in AI roundtab...

On Friday 4th September, philosopher and AISB member Dr Yasemin J Erden, participated in an AI roundtable at Second Home, hosted by Index Ventures and SwiftKey.   Joining her on the panel were colleagues from academia and indu...


AISB Convention 2016

The AISB Convention is an annual conference covering the range of AI and Cognitive Science, organised by the Society for the Study of Artificial Intelligence and Simulation of Behaviour. The 2016 Convention will be held at the Uni...


Bishop and AI news

Stephen Hawking thinks computers may surpass human intelligence and take over the world. This view is based on the ideology that all aspects of human mentality will eventually be realised by a program running on a suitable compu...


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...


Al-Rifaie on BBC

AISB Committee member and Research Fellow at Goldsmiths, University of London, Dr Mohammad Majid al-Rifaie was interviewed by the BBC (in Farsi) along with his colleague Mohammad Ali Javaheri Javid on the 6 November 2014. He was a...


AISB YouTube Channel

The AISB has launched a YouTube channel: http://www.youtube.com/user/AISBTube (http://www.youtube.com/user/AISBTube). The channel currently holds a number of videos from the AISB 2010 Convention. Videos include the AISB round t...



AISB opportunities Bulletin Item

Postdoctoral position in verification of counter systems, Paris, FRANCE

Postdoctoral position at LIAFA, Paris, France

+ Title:  Verification of Counter Systems

+ Abstract:

In order to represent the behavior of complex software systems, numerous models have been proposed 
among them the class of counter systems which are finite automata whose transitions are labelled by 
guards and updates on integer variables. It is well known that most of the verification problem 
are undecidable for very simple counter systems manipulating only two integer variables, however 
many restrictions have been proposed on these systems in order to regain decidability. Many 
abstractions techniques have also been developed in order to solve approximatively verification 
problems on this family of systems. The thematic of the post-doctoral stay could follow one (or 
both of) the following axis:

1. How to compose decidable classes of Petri nets. The restrictions proposed to gain decidability 
in counter systems restrict either the syntax of the model (like in Vector Addition System with 
States or in flat counter systems) or its semantic (like in reversal-bounded counter machines). We 
wish to investigate in which measure different restrictions on counter systems can be composed in 
order to obtain larger class of systems for which decidability of verification problems still holds.
Our objective are both to perform a complete analysis of the decidability status of some classical 
verification problem (reachability, safety,
liveness,etc) taking into account different compositions.

2. Development and implementation of efficient techniques to analyze counter systems. There already
exist tools to analyze counter systems likeTREX, FAST, FLATA, ASPIC, etc. But most of these tools 
only study reachability properties by computing the reachability set and when their approach 
computes an approximation of the reachability set, they either do under-approximations or 
over-approximations. The idea would be to build another tool that could compute under and over 
approximation of the reachability set but also could verify other properties than reachability. 
Furthermore this tool could implement different algorithms according to the property that one wish 
to verify, the aim being to be efficient.

+ Length of the postdoctoral stay: 12 months

+ Beginning date: Before the 1st of June 2012


   -Arnaud Sangnier
     Assistant Professor
     LIAFA - Universit Paris Diderot - Paris VII

   -Stphane Demri
     Senior Researcher
     LSV - CNRS - ENS Cachan

    LIAFA (Laboratoire d'Informatique Algorithmique: Fondements et Applications)
    In the team Modelisation and Verification leaded by Professor Ahmed Bouajjani

+Salary: 2100 euros per month

+Source of funding: DIGITEO (http://www.digiteo.fr/)

+Contact: sangnier@liafa.jussieu.fr, demri@lsv.ens-cachan.fr