Proving finiteness of CCS processes by non-standard semantics
type: Item
instance of: scholarly article
title: Proving finiteness of CCS processes by non-standard semantics
zbMATH Open document ID: 0790.68066
DOI: 10.1007/BF01178922
author: P. Inverardi
author: Nicoletta De Francesco
published in: Acta Informatica
publication date: 1994-05-10T00:00:00Z
Mathematics Subject Classification ID: 68Q55
Mathematics Subject Classification ID: 68Q60
Mathematics Subject Classification ID: 68Q10
zbMATH DE Number: 567308
zbMATH Keywords: verification of programs
zbMATH Keywords: CCS
zbMATH Keywords: operational semantics
describes a project that uses: LOTOS
MaRDI profile type: Publication
cites work: Process algebra for synchronous communication
cites work: Q4038723
cites work: CCS expressions, finite state processes, and three problems of equivalence
cites work: Q3992568
cites work: Finite representations of CCS and TCSP programs by automata and Petri nets
description: scientific article; zbMATH DE number 567308