A semantic driven method to check the fineteness of CCS processes

DOI10.1007/3-540-55179-4_26MaRDI QIDQ6493544zbMATH OpenFDO

Authors Nicoletta De Francesco, P. Inverardi

Publication date 29 April 2024

Full work available at URL https://doi.org/10.1007/3-540-55179-4_26

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60)

Cites work

• A calculus of communicating systems
• CCS expressions, finite state processes, and three problems of equivalence
• Finite representations of CCS and TCSP programs by automata and Petri nets
• scientific article; zbMATH DE number 42752 (Why is no real title available?)
• scientific article; zbMATH DE number 177252 (Why is no real title available?)
• scientific article; zbMATH DE number 177845 (Why is no real title available?)

This page was built for publication: A semantic driven method to check the fineteness of CCS processes

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