Pages that link to "Item:Q515678"
From MaRDI portal
The following pages link to Characterisation of the state spaces of marked graph Petri nets (Q515678):
Displaying 20 items.
- Minimal state graph generation (Q1193742) (← links)
- Duality of stable Petri nets and marked graphs (Q1320747) (← links)
- Sufficient conditions for the marked graph realisability of labelled transition systems (Q1623288) (← links)
- Plain, bounded, reversible, persistent, and \(k\)-marked Petri nets have marked graph reachability graphs (Q1708655) (← links)
- State estimation of \(\lambda\)-free labeled Petri nets with contact-free nondeterministic transitions (Q1773100) (← links)
- Lower and upper bounds of shortest paths in reachability graphs (Q1777827) (← links)
- Bounded choice-free Petri net synthesis: algorithmic issues (Q1789066) (← links)
- Efficient synthesis of weighted marked graphs with circular reachability graph, and beyond (Q2032839) (← links)
- Synthesis and reengineering of persistent systems (Q2257983) (← links)
- Presynthesis of bounded choice-free or fork-attribution nets (Q2304527) (← links)
- State space axioms for T-systems (Q2340253) (← links)
- Property analysis of logic Petri nets by marking reachability graphs (Q2515425) (← links)
- State space analysis of Petri nets with relation-algebraic methods (Q2518607) (← links)
- The Power of Prime Cycles (Q2822651) (← links)
- Uniqueness of minimal 1-safe Petri net generating all the binary \(n\)-vectors as its marking vectors exactly once (Q2842083) (← links)
- Target-oriented Petri Net Synthesis (Q4988954) (← links)
- A New Property of Choice-Free Petri Net Systems (Q5100751) (← links)
- Efficient Reachability Graph Representation of Petri Nets With Unbounded Counters (Q5179054) (← links)
- Conditions for Petri Net Solvable Binary Words (Q5268428) (← links)
- Boundedness and conservativeness of augmented marked graphs (Q5294132) (← links)
