Proving finiteness of CCS processes by non-standard semantics

DOI10.1007/BF01178922MaRDI QIDQ1323345zbMATH OpenFDO

Authors P. 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) Specification and verification (program logics, model checking, etc.) (68Q60) Semantics in the theory of computing (68Q55)

Cites work

• scientific article; zbMATH DE number 42752 (Why is no real title available?)
• scientific article; zbMATH DE number 177845 (Why is no real title available?)
• 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

Cited in

(6)

• Finite approximations for model checking non-finite-state processes
• GSOS and finite labelled transition systems
• scientific article; zbMATH DE number 177252 (Why is no real title available?)
• The Decidability of the Reachability Problem for CCS!
• Predicatively unprovable termination of the Ackermannian Goodstein process
• Template iterations with non-definable ccc forcing notions

Describes a project that uses

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)