Pages that link to "Item:Q1392273"

The following pages link to A symbolic reachability graph for coloured Petri nets (Q1392273):

Displaying 18 items.

• Efficient simulation of hierarchical stochastic activity network models (Q686340) (← links)
• A symbolic reachability graph for coloured Petri nets (Q1392273) (← links)
• A structural approach to graph transformation based on symmetric Petri nets (Q2035652) (← links)
• Canonical representations for direct generation of strategies in high-level Petri games (Q2117156) (← links)
• The ins and outs of Petri net composition (Q2165242) (← links)
• Solving high-level Petri games (Q2182671) (← links)
• Discrete Parameters in Petri Nets (Q2941148) (← links)
• Crocodile: A Symbolic/Symbolic Tool for the Analysis of Symmetric Nets with Bag (Q3011898) (← links)
• PN Standardisation: A Survey (Q3613078) (← links)
• A Simple Positive Flows Computation Algorithm for a Large Subclass of Colored Nets (Q3614850) (← links)
• Towards a Standard for Modular Petri Nets: A Formalisation (Q3636839) (← links)
• The PSR methodology: Integrating hardware and software models (Q4633160) (← links)
• A notion of equivalence for stochastic Petri nets (Q5096363) (← links)
• Symbolic reachability graph and partial symmetries (Q5096366) (← links)
• Synthesis of controllers for symmetric systems (Q5391450) (← links)
• Modelling and simulation of an intelligent flexible manufacturing system via high-level object Petri nets (HLOPN) (Q5466726) (← links)
• Towards Efficient Verification of Systems with Dynamic Process Creation (Q5505602) (← links)
• Modular rewritable Petri nets: an efficient model for dynamic distributed systems (Q6120343) (← links)