Well Structured Transition Systems with History

  title={Well Structured Transition Systems with History},
  author={Parosh Aziz Abdulla and Giorgio Delzanno and Marco Montali},
We propose a formal model of concurrent systems in which the history of a computation is explicitly represented as a collection of events that provide a view of a sequence of configurations. In our model events generated by transitions become part of the system configurations leading to operational semantics with historical data. This model allows us to formalize what is usually done in symbolic verification algorithms. Indeed, search algorithms often use meta-information, e.g., names of fired… 



History-Register Automata

This work proposes History-Register Automata (HRA), a new automata-theoretic formalism for modelling and analysing programs with dynamic allocation that is powerful enough to imitate counter machines, and yields closure under all regular operations apart from complementation.

Well-Structured Pushdown Systems

This paper shows that the coverability is decidable for recursive vector addition system with states, multi-set pushdown systems, and a WSPDS with finite control states and well-quasi-ordered stack alphabet.

On the coverability and reachability languages of monotonic extensions of Petri nets

Constraint-based automatic verification of abstract models of multithreaded programs

  • G. Delzanno
  • Computer Science
    Theory and Practice of Logic Programming
  • 2007
The encoding of TDL programs into a low level language based on multiset rewriting and constraints allows the automated verification of abstract models of multithreaded programs providing fresh name generation, name mobility, and unbounded control to be isolated.

Deciding branching time properties for asynchronous programs

Push-Down Automata with Gap-Order Constraints

This work considers push-down automata with data (Pdad) that operate on variables ranging over the set of natural numbers and presents an algorithm for solving the reachability problem for Cfgds.

General decidability theorems for infinite-state systems

This paper presents decidability results for a class of systems, which consist of a finite control part operating on an infinite data domain, and shows that the following properties are decidable for well-structured systems: reachability; eventuality; and simulation.

Fresh-register automata

Fresh-Register Automata (FRA), a new class of automata which operate on an infinite alphabet of names and use a finite number of registers to store fresh names, and to compare incoming names with previously stored ones is introduced.

Well-Structured Pushdown System: Case of Dense Timed Pushdown Automata

This paper investigates a general framework of a pushdown system with well-quasi-ordered states and stack alphabet to show decidability of reachability, which is an extension of our earlier work

Decidability Results for Restricted Models of Petri Nets with Name Creation and Replication

It is proved that if the authors forbid synchronizations between the different components in a g-RN system, then reachability is still decidable, and the proof is done by reducing it to reachability in a class of multiset rewriting systems, similar to Recursive Petri Nets.