We define a hierarchy of classes of rewrite systems for infinite-state concurrent systems that are strictly more expressive than Petri nets, PA-processes, and pushdown processes, but not Turing-powerful.Expand

We analyze the model-checking problems for safety and liveness properties in parameterized broadcast protocols, a model introduced by Emerson and Namjoshi in the sequel.Expand

We present an almost complete picture of the decidability of model checking problems for lossy systems and several branching-time and linear-time temporal logics.Expand