The following pages link to Victor Khomenko (Q403019):
Displaying 31 items.
- Recent advances in unfolding technique (Q403021) (← links)
- Merged processes: a new condensed representation of Petri net behaviour (Q854679) (← links)
- Verification of bounded Petri nets using integer programming (Q878111) (← links)
- STG decomposition strategies in combination with unfolding (Q1031867) (← links)
- Canonical prefixes of Petri net unfoldings (Q1889762) (← links)
- Avoiding exponential explosion in Petri net models of control flows (Q2165241) (← links)
- On the well-foundedness of adequate orders used for construction of complete unfolding prefixes (Q2380011) (← links)
- A Polynomial Translation of pi-calculus FCPs to Safe Petri Nets (Q2848363) (← links)
- Flat Arbiters (Q2895777) (← links)
- A Polynomial Translation of π-Calculus (FCP) to Safe Petri Nets (Q2912696) (← links)
- An Algorithm for Direct Construction of Complete Merged Processes (Q3011883) (← links)
- (Q3602753) (← links)
- Behaviour-Preserving Transition Insertions in Unfolding Prefixes (Q3612934) (← links)
- Combining Decomposition and Unfolding for STG Synthesis (Q3612935) (← links)
- (Q4417949) (← links)
- (Q4472254) (← links)
- (Q4536617) (← links)
- (Q4791845) (← links)
- (Q4804927) (← links)
- (Q4824481) (← links)
- A New Type of Behaviour-Preserving Transition Insertions in Unfolding Prefixes (Q4931305) (← links)
- A Case for Using Signal Transition Graphs for Analysing and Refining Genetic Networks (Q5179422) (← links)
- Contextual Merged Processes (Q5300864) (← links)
- Computer Aided Verification (Q5312949) (← links)
- (Q5480167) (← links)
- (Q5506395) (← links)
- Lectures on Concurrency and Petri Nets (Q5712300) (← links)
- CONCUR 2005 – Concurrency Theory (Q5897493) (← links)
- A Practical Approach to Verification of Mobile Systems Using Net Unfoldings (Q5900141) (← links)
- A Practical Approach to Verification of Mobile Systems Using Net Unfoldings (Q5902259) (← links)
- Slimming down Petri boxes: compact Petri net models of control flows (Q6587113) (← links)
