Automatic Symmetry Detection in Well-Formed Nets

DOI10.1007/3-540-44919-1_9MaRDI QIDQ3550614zbMATH OpenOpenAlexFDO

Authors Yann Thierry-Mieg, C. Dutheillet, Isabelle Mounier

Publication date 31 March 2010

Published in Applications and Theory of Petri Nets 2003 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-44919-1_9

zbMATH Keywords

partial symmetrysymbolic model-checkingsymmetry detectionwell-formed Petri nets

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

• Symmetry detection and classification in drawings of graphs
• Automatic symmetry detection for Promela
• scientific article; zbMATH DE number 4045185
• Fast detection and display of symmetry in outerplanar graphs
• Detecting almost symmetries of graphs
• Optimal algorithms for symmetry detection in two and three dimensions
• Detection of symmetry or lack of 11 and applications
• Symmetry detection in 3D chain coded discrete curves and trees

Cited in

(9)

• Solving high-level Petri games
• Improvements in unfolding of colored Petri nets
• Optimized Colored Nets Unfolding
• scientific article; zbMATH DE number 1337889 (Why is no real title available?)
• Symbolic reachability graph and partial symmetries
• Identification of and symmetry computation for crystal nets
• Towards Efficient Verification of Systems with Dynamic Process Creation
• Methods for Efficient Unfolding of Colored Petri Nets
• Manual and Automatic Exploitation of Symmetries in SPN Models

Describes a project that uses

Uses Software

• GreatSPN
• CPN-AMI

This page was built for publication: Automatic Symmetry Detection in Well-Formed Nets

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