A symbolic reachability graph for coloured Petri nets

DOI10.1016/S0304-3975(96)00010-2zbMath0903.68130OpenAlexW2027139596MaRDI QIDQ1392273

D. Massart

Publication date: 23 July 1998

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0304-3975(96)00010-2

zbMATH Keywords

symbolic reachability graph

Mathematics Subject Classification ID

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

Related Items

The ins and outs of Petri net composition, Discrete Parameters in Petri Nets, Solving high-level Petri games, A notion of equivalence for stochastic Petri nets, Symbolic reachability graph and partial symmetries, A symbolic reachability graph for coloured Petri nets, Modular rewritable Petri nets: an efficient model for dynamic distributed systems, Synthesis of controllers for symmetric systems, The PSR methodology: Integrating hardware and software models, Crocodile: A Symbolic/Symbolic Tool for the Analysis of Symmetric Nets with Bag, Efficient simulation of hierarchical stochastic activity network models, PN Standardisation: A Survey, A structural approach to graph transformation based on symmetric Petri nets, A Simple Positive Flows Computation Algorithm for a Large Subclass of Colored Nets, Modelling and simulation of an intelligent flexible manufacturing system via high-level object Petri nets (HLOPN), Towards a Standard for Modular Petri Nets: A Formalisation, Towards Efficient Verification of Systems with Dynamic Process Creation, 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
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item