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

Ranko Lazić | Zendy; Tom Newcomb | Zendy; Bill Roscoe | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

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

Author(s) -

Ranko Lazić,

Tom Newcomb,

Bill Roscoe

Publication year - 2005

Publication title -

electronic notes in theoretical computer science

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.242

H-Index - 60

ISSN - 1571-0661

DOI - 10.1016/j.entcs.2005.02.064

Subject(s) - decidability , nondeterministic algorithm , type (biology) , signature (topology) , rewriting , class (philosophy) , multiset , mathematics , state (computer science) , computer science , discrete mathematics , theoretical computer science , algorithm , programming language , artificial intelligence , ecology , geometry , biology

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

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research