The following pages link to (Q4791837):
Displaying 6 items.
- Exploiting step semantics for efficient bounded model checking of asynchronous systems (Q436411) (← links)
- Using transition set sequences to partition behaviors of Petri nets (Q766188) (← links)
- Planning as satisfiability: parallel plans and algorithms for plan search (Q2457605) (← links)
- Bounded Synthesis for Petri Games (Q3449635) (← links)
- A menagerie of non-finitely based process semantics over BPA* – from ready simulation to completed traces (Q4236208) (← links)
- A Polyhedral Abstraction for Petri Nets and its Application to SMT-Based Model Checking (Q5044397) (← links)