Rewriting approximations for properties verification over CCS specifications

DOI10.1007/978-3-642-29320-7_20MaRDI QIDQ2894572zbMATH OpenOpenAlexFDO

Authors Roméo Courbis

Publication date 29 June 2012

Published in Fundamentals of Software Engineering (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-29320-7_20

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42) Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• A rewriting strategy to verify observational congruence
• Finite approximations for model checking non-finite-state processes
• Deciding observational congruence of finite-state CCS expressions by rewriting
• Towards more precise rewriting approximations
• Towards more precise rewriting approximations

Cited in

(3)

• A rewriting strategy to verify observational congruence
• Finite approximations for model checking non-finite-state processes
• scientific article; zbMATH DE number 4085007 (Why is no real title available?)

Describes a project that uses

Uses Software

• Timbuk

This page was built for publication: Rewriting approximations for properties verification over CCS specifications

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