• Citer

A classification of the expressive power of well-structured transition systems

par Abdulla, Parosh Aziz;Delzanno, Giorgio ;Van Begin, Laurent
Référence Information and computation, 209, 3, page (248-279)
Publication Publié, 2011-03

Article révisé par les pairs

• Accès en ligne
• Détails
• Contenu
• Statistiques

Résumé :

We compare the expressive power of a class of well-structured transition systems that includes relational automata (extensions of), Petri nets, lossy channel systems, constrained multiset rewriting systems, and data nets. For each one of these models we study the class of languages generated by labeled transition systems describing their semantics. We consider here two types of accepting conditions: coverability and reachability of a fixed a priori configuration. In both cases we obtain a strict hierarchy in which constrained multiset rewriting systems is the most expressive model. © 2010 Published by Elsevier Inc.