A Verification Technique Based on Syntactic Action Refinement in a TCSP-like Process Algebra and the Hennessy-Milner-Logic
We investigate the conceptual link between action refinement for a process algebra which contains the TCSP-parallel composition operator and recursion on the one hand and action refinement for the Hennessy-Milner-Logic on the other. We show that the assertion p ⊨ ϕ ⇔ P[a↪Q] ⊨ ϕ[a↪Q] where ⋅[a↪Q] denotes the refinement operator both on process terms and formulas holds in the considered framework under weak and reasonable restrictions.
KeywordsModel Checker Composition Operator Atomic Action Process Expression Process Algebra
- [GGR94]U. Goltz, R. Gorrieri, and A. Rensink. On syntactic and semantic action refinement. Lecture Notes in Computer Science, 789:385–404, 1994.Google Scholar
- [MCS99a]M. Majster-Cederbaum and F. Salger. On syntactic action refinement and logic. Technical Report 7/99, Fakultät für Mathematik und Informatik, Universität Mannheim, D7.27, Germany, 1999.Google Scholar
- [MCS99b]M. Majster-Cederbaum and F. Salger. Syntactic action refinement in the modal mu-calculus and its applications to the verification of reactive systems.Technical Report (in preparation), Fakultät für Mathematik und Informatik, Universität Mannheim, D7.27, Germany, 1999.Google Scholar