Symbolic reachability graph and partial symmetries

DOI10.1007/3-540-60029-9_43zbMATH Open1496.68226OpenAlexW1579149493MaRDI QIDQ5096366FDOQ5096366

J.-M. 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

Recommendations

• Les Symétries dans les Réseaux de Petri Stochastiques (RdPS) Construction du Graphe Symbolique
• A symbolic reachability graph for coloured Petri nets
• scientific article
• Automatic Symmetry Detection in Well-Formed Nets
• Efficient reachability graph representation of Petri nets with unbounded counters

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)

Cites Work

• Reachability trees for high-level Petri nets
• Title not available (Why is that?)
• A symbolic reachability graph for coloured Petri nets

Cited In (9)

• Les Symétries dans les Réseaux de Petri Stochastiques (RdPS) Construction du Graphe Symbolique
• Computational complexity of the place/transition-net symmetry reduction method
• Canonical representations for direct generation of strategies in high-level Petri games
• Solving high-level Petri games
• Manual and Automatic Exploitation of Symmetries in SPN Models
• Title not available (Why is that?)
• Balancedness and coboundaries in symbolic systems
• Approximate Symbolic Reachability of Networks of Transition Systems
• Introducing symmetry to graph rewriting systems with process abstraction

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

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