Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
10328872 | Electronic Notes in Theoretical Computer Science | 2005 | 26 Pages |
Abstract
Polymorphic systems with arrays (PSAs) is 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 several new decidability and undecidability results for parameterised control-state reacha- bility problems on subclasses of PSAs.
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Ranko LaziÄ, Tom Newcomb, Bill Roscoe,