scientific article; zbMATH DE number 2217747

MaRDI QIDQ5699482zbMATH OpenFDO

Authors Ferucio Laurenţiu Ţiplea, Olivia Oanea

Publication date 26 October 2005

zbMATH Keywords

complexitymodel checkingPetri nets\(\mu\)-calculus

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

• On the complexity of the linear-time μ-calculus for Petri Nets
• scientific article; zbMATH DE number 1456956
• Decidability of model checking for infinite-state concurrent systems
• scientific article; zbMATH DE number 1263840
• scientific article; zbMATH DE number 1439078

Cited in

(6)

• Decidability of model checking for infinite-state concurrent systems
• On the complexity of the linear-time μ-calculus for Petri Nets
• scientific article; zbMATH DE number 2186291 (Why is no real title available?)
• Model checking of linear-time properties in multi-valued systems
• Practical Efficient Modular Linear-Time Model-Checking
• scientific article; zbMATH DE number 784436 (Why is no real title available?)

This page was built for publication:

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