High level Petri nets analysis with Helena

DOI10.1007/11494744_26MaRDI QIDQ5713518zbMATH OpenOpenAlexFDO

Authors Sami Evangelista

Publication date 14 December 2005

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/b136988

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 50851
• High-level Petri net model checking with AlPiNA
• A class of composable high level Petri nets
• scientific article; zbMATH DE number 938521
• scientific article; zbMATH DE number 4045166
• scientific article; zbMATH DE number 177238
• Modeling and analysis using hybrid Petri nets
• scientific article; zbMATH DE number 4074502

Cited in

(7)

• Exploiting colored Petri nets to decide on permutation admissibility
• Helena
• LoLa: A low level analyser
• Maria: Modular reachability analyser for algebraic system nets
• High-level Petri net model checking with AlPiNA
• Towards Efficient Verification of Systems with Dynamic Process Creation
• Experimenting with stubborn sets on Petri nets

Describes a project that uses

Uses Software

• SPOT
• CPN/Tools
• GreatSPN
• GreatSPN 1.7
• SPIN
• Maria

This page was built for publication: High level Petri nets analysis with Helena

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