Abstract
Graphical representation (representing logical specifications by means of one or several labeled transition systems) is a typical connection between process algebra and temporal logic, the two main paradigms that specify and reason about reactive concurrent systems. In this paper, we encode (represent “graphically”) a fragment of Action-based CTL, proposed by Lüttgen and Vogler, in the process calculus CLLR. In this way, safety properties can be described easily, and usual process operators (parallel, choice, etc.), logical operators (conjunction and disjunction) and temporal operators (always, until, etc.) can be mixed freely in CLLR.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Paper version not known
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
