Pages that link to "Item:Q1346682"

The following pages link to Model checking using net unfoldings (Q1346682):

Displaying 21 items.

• Petri games: synthesis of distributed systems with causal memory (Q515654) (← links)
• Complexity results for 1-safe nets (Q672459) (← links)
• Verification of bounded Petri nets using integer programming (Q878111) (← links)
• A framework for the verification of infinite-state graph transformation systems (Q937301) (← links)
• A causal semantic for time Petri nets (Q1575828) (← links)
• Domain and event structure semantics for Petri nets with read and inhibitor arcs (Q1882900) (← links)
• The synthesis problem for repeatedly communicating Petri games (Q2165240) (← links)
• Solving high-level Petri games (Q2182671) (← links)
• ``Truly concurrent'' and nondeterministic semantics of discrete-time Petri nets (Q2216716) (← links)
• Symbolic unfolding of parametric stopwatch Petri nets (Q2248088) (← links)
• Trellis processes: a compact representation for runs of concurrent systems (Q2465670) (← links)
• Modeling, analyzing and slicing periodic distributed computations (Q2637314) (← links)
• (Q2842866) (← links)
• Branching Processes of Timed Petri Nets (Q3179184) (← links)
• Unfolding Graph Transformation Systems: Theory and Applications to Verification (Q3507354) (← links)
• Transformations in Reconfigurable Place/Transition Systems (Q3507359) (← links)
• Constructing a Knowledge Base for Gene Regulatory Dynamics by Formal Concept Analysis Methods (Q3599207) (← links)
• Directed Unfolding of Petri Nets (Q3599218) (← links)
• A method for the verification of a distributed and synchronized algorithm (Q4671275) (← links)
• (Q5136320) (← links)
• The On-Line Diagnosis of Time Petri Nets (Q5496935) (← links)