Cyclomatic complexity for generalized nets

MaRDI QIDQ3524445zbMATH OpenFDO

Authors

Publication date 9 September 2008

zbMATH Keywords

software metricscomplexity measure

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• scientific article; zbMATH DE number 3924114
• scientific article; zbMATH DE number 4043256
• scientific article; zbMATH DE number 3913694
• Measurement methods on the complexity of network
• Publication:4896252

Cited in

(4)

• Computing cyclomatic complexity with cubic flowgraphs
• Elementary net synthesis remains NP-complete even for extremely simple inputs
• scientific article; zbMATH DE number 5619279 (Why is no real title available?)
• Some complexity results on transition systems and elementary net systems

This page was built for publication: Cyclomatic complexity for generalized nets

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