Process Algebra in PVS
The aim of this work is to investigate mechanical support for process
algebra,
both for concrete applications and theoretical properties.
Two approaches are presented using the verification system PVS.
One approach declares process terms as an uninterpreted
type and specifies equality on terms by axioms.
This is convenient for concrete applications where
the rewrite mechanisms of PVS can be exploited.
For the verification of theoretical results, often
induction principles are needed.
They are provided by the second approach where
process terms are defined as an abstract datatype with
a separate equivalence relation.
(postscript /
pdf version of the complete paper)
(A dump of the PVS files that are the basis of
the paper.)
Back to the list of publications.