Symbolic reachability graph and partial symmetries

DOI10.1007/3-540-60029-9_43zbMath1496.68226OpenAlexW1579149493MaRDI QIDQ5096366

Jean-Michel Ilié, Serge Haddad, Belhassen Zouari, M. Taghelit

Publication date: 16 August 2022

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

Full work available at URL: https://doi.org/10.1007/3-540-60029-9_43

zbMATH Keywords

partial symmetrieswell-formed Petri netssymbolic reachability graphs

Mathematics Subject Classification ID

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

Related Items (2)

Solving high-level Petri games ⋮ Canonical representations for direct generation of strategies in high-level Petri games

Cites Work

• Reachability trees for high-level Petri nets
• A symbolic reachability graph for coloured Petri nets
• Unnamed Item

This page was built for publication: Symbolic reachability graph and partial symmetries