Abstract
In this paper we present a method to check the finiteness of CCS expressions. The method is interpretative, i.e. it is based on an extended operational semantics of CCS. According to this new operational semantics it is always possible to build a finite state transition system which, if some condition holds, is a finite representation of a process. It works on terms of the CCS signature and is able to decide the finiteness of a CCS expression in a large number of cases which are not captured by the known syntactic criteria.
Cite
CITATION STYLE
De Francesco, N., & Inverardi, P. (1992). A semantic driven method to check the fineteness of CCS processes. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 575 LNCS, pp. 266–276). Springer Verlag. https://doi.org/10.1007/3-540-55179-4_26
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
