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.
|Titel||Tools and Algorithms for the Construction and Analysis of Systems (Proceedings 5th International Conference, TACAS'99; he;d as part of ETAPS'99, Amsterdam, The Netherlands, March 22-28, 1999)|
|Plaats van productie||Berlin|
|ISBN van geprinte versie||3-540-65703-7|
|Status||Gepubliceerd - 1999|
|Naam||Lecture Notes in Computer Science|
|ISSN van geprinte versie||0302-9743|