Polymorphic Systems with Arrays, 2-Counter Machines and Multiset Rewriting☆

https://doi.org/10.1016/j.entcs.2005.02.064Get rights and content
Under a Creative Commons license
open access

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

model checking
infinite-state
parameterised
array

Cited by (0)

☆

We acknowledge support from the EPSRC grant GR/M32900. The first author was also supported by grants from the Intel Corporation and the EPSRC (GR/S52759/01), the second author by QinetiQ Malvern, and the third author by the US ONR.

1

Also affiliated to the Mathematical Institute, Serbian Academy of Sciences and Arts, Belgrade.

Copyright © 2005 Elsevier B.V.