Abstract
PAM is a general proof tool for process algebras. It allows users to define their own calculi and then perform algebraic style proofs in these calculi by directly manipulating process terms. The logic that PAM implements is equational logic plus recursion, with some features tailored to the particular requirements of process algebras. Equational reasoning is implemented by rewriting, while recursion is dealt with by induction. Proofs are constructed interactively, giving users the freedom to control the proof processes.
Cite
CITATION STYLE
Lin, H. (1992). PAM: A process algebra manipulator. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 575 LNCS, pp. 136–146). Springer Verlag. https://doi.org/10.1007/3-540-55179-4_14
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
