Department of Computer Science
University of Warwick
4pm Tuesday 7th December 2004
Room 2511, JCMB, King's Buildings
Polymorphic systems with arrays (PSAs) are a general class of nondeterministic reactive systems. A PSA is polymorphic in the sense that it depends on a signature, which consists of a number of type variables, and a number of symbols whose types can be built from the type variables. Some of the state variables of a PSA can be arrays, which are functions from one type to another. We present a complete classification of parameterised reachability problems on subclasses of PSAs into decidable or undecidable.
Joint work with Tom Newcomb and Bill Roscoe of the University of Oxford.