Nitta, Naoya

Seki, Hiroyuki

In this paper, we present a class of infinite transition systems which is an extension of pushdown systems (PDS), and show that LTL (linear temporal logic) model checking for the class is decidable. Sincthe class is defined as a subclass of term rewriting systems, pushdown stack of PDS is naturally extended to tree structure. By this extension, we can model recursive programs with exception handling

An extension of pushdown system and its model checking method

Abstract

Similar works

Full text

Available Versions

Institutional Repositories DataBase (IRDB)