Some Results on the Verification of Recursive Parallel Systems

Speaker:  Massimo Benerecetti - Universita' di Napoli
  Tuesday, February 10, 2004 at 5:30 PM
Process Rewriting Systems (PRS) is a well known formal settingsuitable for describing relevant classes of infinite state systemswith recursion and/or parallelism. For instance, both PushdownAutomata and Petri Nets can be accommodated in the framework, as wellas various restricted combinations of them. For general PRSdecidability results are mainly limited to reachabilityproperties. The talk will focus on the problem of proving propertiesof infinite behaviors for a meaningful fragment of PRS, where bothrecursion and parallelism are allowed. Some decidability results fora class of properties about infinite derivations (namely, infiniteterm rewritings) in a PRS is provided. It will also be shown howthose results can be exploited for the verification of a small classof linear time properties of infinite state systems described by PRSs.

Place
Ca' Vignal 3 - Piramide, Floor 0, Hall Verde

Contact person
Maria Paola Bonacina

Publication date
January 24, 2004

Studying