Abstract. We unify a view on three extensions of Process Rewrite Systems (PRS) and compare their expressive power with that of PRS. We show that the class of Petri nets is less exp...
We establish a decidability boundary of the model checking problem for infinite-state systems defined by Process Rewrite Systems (PRS) or weakly extended Process Rewrite Systems (w...
Formal verification using the model checking paradigm has to deal with two aspects: The system models are structured, often as products of components, and the specification logic...