<%@ page language="java" contentType="text/html" %>
<%-- Include common initialisation code --%>
<%@ include file="/arch/common.jsp" %>
<%-- The current tab --%>
<% String currentTab = "Research"; %>
<%-- Content of navigation pane --%>
<%@ include file="nav.jsp" %>
<% showCurrentLink=true; %>
<%-- Current navigation location --%>
<% String currentNav = "Reports and Theses"; %>
<%-- Include the code for the document header --%>
<%@ include file="/arch/header.jsp" %>
Research Report CS-RR-399
<%-- Include the code for the lines and navigation --%>
<%@ include file="/arch/middle.jsp" %>
Ranko Lazic, Tom Newcomb and Bill Roscoe,
Polymorphic Systems with Arrays: Decidability and Undecidability,
(April 23, 2004).
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.
Download
cs-rr-399.ps.gz
<%-- Include the code for the document footer --%>
<%@ include file="/arch/footer.jsp" %>