Reduced models for efficient CCS verification

DOI10.1007/S10703-005-1634-6MaRDI QIDQ816205zbMATH OpenOpenAlexFDO

Authors Roberto Barbuti, Nicoletta De Francesco, Antonella Santone, Gigliola Vaglini

Publication date 20 February 2006

Published in Formal Methods in System Design (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10703-005-1634-6

zbMATH Keywords

model checkingCCStransition systemstate explosion problem

Mathematics Subject Classification ID

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

• scientific article; zbMATH DE number 1522998
• Minimization of carbon abatement cost: modeling, analysis and simulation
• Reduced models and uncertainty quantification
• Model reduction for combustion chemistry
• A Study of Model-Order Reduction Techniques for Verification
• Abstract reduction in directed model checking CCS processes
• On the verification of model reduction methods based on the proper generalized decomposition
• Certified reduced basis model validation: a frequentistic uncertainty framework
• Numerical computation of optimal reduction of CO₂—emissions for a simplified climate-economy model
• A highly efficient method for structural model reduction

Cites work

• scientific article; zbMATH DE number 42752 (Why is no real title available?)
• scientific article; zbMATH DE number 176726 (Why is no real title available?)
• scientific article; zbMATH DE number 177511 (Why is no real title available?)
• scientific article; zbMATH DE number 4119603 (Why is no real title available?)
• Abstract interpretation and application to logic programs
• Automatic verification of finite-state concurrent systems using temporal logic specifications
• Formula-dependent equivalence for compositional CTL model checking
• Local model checking in the modal mu-calculus
• Minimal state graph generation
• On model checking for the \(\mu\)-calculus and its fragments
• On reduction of asynchronous systems
• Partial-order methods for the verification of concurrent systems. An approach to the state-explosion problem
• Property preserving abstractions for the verification of concurrent systems
• Results on the propositional \(\mu\)-calculus
• Selective mu-calculus and formula-based equivalence of transition systems
• Tableau-based model checking in the propositional mu-calculus

Cited in

(2)

• scientific article; zbMATH DE number 744059 (Why is no real title available?)
• Abstract reduction in directed model checking CCS processes

Describes a project that uses

Uses Software

• CADP
• LOTOS

This page was built for publication: Reduced models for efficient CCS verification

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