Proving finiteness of CCS processes by non-standard semantics

DOI10.1007/BF01178922zbMath0790.68066MaRDI QIDQ1323345

Paola Inverardi, Nicoletta De Francesco

Publication date: 10 May 1994

Published in: Acta Informatica (Search for Journal in Brave)

zbMATH Keywords

operational semanticsCCSverification of programs

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Semantics in the theory of computing (68Q55) Specification and verification (program logics, model checking, etc.) (68Q60)

Related Items (1)

GSOS and finite labelled transition systems

Uses Software

• LOTOS

Cites Work

• CCS expressions, finite state processes, and three problems of equivalence
• Finite representations of CCS and TCSP programs by automata and Petri nets
• Process algebra for synchronous communication
• Unnamed Item
• Unnamed Item

This page was built for publication: Proving finiteness of CCS processes by non-standard semantics