Hello,
The demand for high availability and reliability of computer and
software systems
has led to a formal verification of such systems. There are two principal
approaches
to formal verification: model checking and theorem proving. I will talk
about Petri Nets
and how to model parallel programs and how to exploit verification tools as
Tina and
Romeo to verify the properties such as liveleness of the system. I will
restrict the
discussion to so-called "1-conservative" Petri Nets, in which the capacity
of each
place is assumed to be 1, and each edge will remove exactly one mark from a
net if
it leads from a place to a transition and add exactly one when it leads
from a transition
