| | |
Summary: Comparing the Expressive Power of
Well-Structured Transition Systems
Parosh Aziz Abdulla1
, Giorgio Delzanno2
, and Laurent Van Begin3,
1
Uppsala University, Sweden
parosh@it.uu.se
2
Universit`a di Genova, Italy
giorgio@disi.unige.it
3
Universit´e Libre de Bruxelles, Belgium
lvbegin@ulb.ac.be
Abstract. We compare the expressive power of a class of well-structured
transition systems that includes relational automata, Petri nets, lossy
channel systems, and constrained multiset rewriting systems. For each
one of these models we study the class of languages generated by labelled
transition systems describing their semantics. We consider here two types
of accepting conditions: coverability and reachability of a given configu-
|
