Proving finiteness of CCS processes by non-standard semantics

DOI10.1007/BF01178922zbMATH Open0790.68066MaRDI QIDQ1323345FDOQ1323345

Authors: P. Inverardi, Nicoletta De Francesco 

Publication date: 10 May 1994

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

Recommendations

• scientific article; zbMATH DE number 177252
• scientific article; zbMATH DE number 177531

zbMATH Keywords

operational semanticsCCSverification of programs

Mathematics Subject Classification ID

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

Cites Work

• Process algebra for synchronous communication
• Title not available (Why is that?)
• CCS expressions, finite state processes, and three problems of equivalence
• Title not available (Why is that?)
• Finite representations of CCS and TCSP programs by automata and Petri nets

Cited In (6)

• Finite approximations for model checking non-finite-state processes
• GSOS and finite labelled transition systems
• Title not available (Why is that?)
• The Decidability of the Reachability Problem for CCS!
• Predicatively unprovable termination of the Ackermannian Goodstein process
• Template iterations with non-definable ccc forcing notions

Uses Software

• LOTOS

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1323345)