A practical approach to verification of mobile systems using net unfolding

DOI10.3233/FI-2009-138MaRDI QIDQ5902259zbMATH OpenOpenAlexFDO

Authors Roland Meyer, Victor Khomenko, Tim Strazny

Publication date 30 November 2009

Published in Fundamenta Informaticae (Search for Journal in Brave)

Full work available at URL https://doi.org/10.3233/fi-2009-138

zbMATH Keywords

\(\pi\)-calculusfinite control processesmobile systemsmodel checkingPetri net unfoldingssafe processes

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

• A Practical Approach to Verification of Mobile Systems Using Net Unfoldings
• Verification of concurrent programs using Petri net unfoldings
• scientific article; zbMATH DE number 1670797
• A polynomial translation of -calculus (FCP) to safe Petri nets
• Verification of bounded Petri nets using integer programming

Cited in

(2)

• An empirical comparison of formalisms for modelling and analysis of dynamic reconfiguration of dependable systems
• A Practical Approach to Verification of Mobile Systems Using Net Unfoldings

Describes a project that uses

Uses Software

• Petruchio

This page was built for publication: A practical approach to verification of mobile systems using net unfolding

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