Lazic, Ranko, Newcomb, Tom and Roscoe, A. W. (2004) Polymorphic systems with arrays : decidability and undecidability. University of Warwick. Department of Computer Science. (Department of Computer Science research report). (Unpublished)

Preview

PDF WRAP_cs-rr-399.pdf - Other - Requires a PDF viewer. Download (348Kb) | Preview

Request Changes to record.

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 reachability problems on subclasses of PSAs.

Item Type:	Report
Subjects:	Q Science > QA Mathematics > QA76 Electronic computers. Computer science. Computer software
Divisions:	Faculty of Science > Computer Science
Library of Congress Subject Headings (LCSH):	Machine theory
Series Name:	Department of Computer Science research report
Publisher:	University of Warwick. Department of Computer Science
Official Date:	2004
Dates:	Date Event 2004 Completion
Number:	Number 399
Number of Pages:	21
DOI:	CS-RR-399
Institution:	University of Warwick
Theses Department:	Department of Computer Science
Status:	Not Peer Reviewed
Publication Status:	Unpublished
Funder:	Engineering and Physical Sciences Research Council (EPSRC), Intel Corporation, QinetiQ (Firm), United States. Office of Naval Research
Grant number:	GR/M32900 (EPSRC), GR/S52759/01 (EPSRC)
Related URLs:	Organisation

Request changes or add full text files to a record

Repository staff actions (login required)

View Item

Downloads