A Verification Technique Based on Syntactic Action Refinement in a TCSP-like Process Algebra and the Hennessy-Milner-Logic

Authors:
Mila E. Majster-Cederbaum;Frank Salger
Affiliations:
-;-
Venue:
ASIAN '99 Proceedings of the 5th Asian Computing Science Conference on Advances in Computing Science
Year:
1999

Citing 4
Cited 0

A Theory of Communicating Sequential Processes

Journal of the ACM (JACM)
A Calculus of Communicating Systems

A Calculus of Communicating Systems
On Syntactic and Semantic Action Refinement

TACS '94 Proceedings of the International Conference on Theoretical Aspects of Computer Software
Adding Action Refinement to a Finite Process Algebra

ICALP '91 Proceedings of the 18th International Colloquium on Automata, Languages and Programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.