M. Nielsen, G. D. Plotkin, and G. Winskel, Petri nets, event structures and domains, part I, Theoretical Computer Science, vol.13, issue.1, pp.85-108, 1981.
DOI : 10.1016/0304-3975(81)90112-2
URL : http://doi.org/10.1016/0304-3975(81)90112-2

A. Mokhov and A. Yakovlev, Conditional Partial Order Graphs: Model, Synthesis, and Application, IEEE Transactions on Computers, vol.59, issue.11, pp.1480-1493, 2010.
DOI : 10.1109/TC.2010.58

J. Esparza, S. Römer, and W. Vogler, An improvement of McMillan's unfolding algorithm, pp.87-106, 1996.
DOI : 10.1007/3-540-61042-1_40
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.1.9584

H. Ponce-de-león and A. Mokhov, Building Bridges Between Sets of Partial Orders, 2014.
DOI : 10.1007/978-3-319-15579-1_11

I. Wegener, The Complexity of Boolean Functions, 1987.

B. Logic, S. , and V. Group, ABC: A System for Sequential Synthesis and Verification, Release 70930

D. 'alessandro, C. Mokhov, A. Bystrov, A. V. Yakovlev, and A. , Delay/phase regeneration circuits, 13th IEEE International Symposium on Asynchronous Circuits and Systems, pp.12-14, 2006.

A. Mokhov, A. Iliasov, D. Sokolov, M. Rykunov, A. Yakovlev et al., Synthesis of Processor Instruction Sets from High-Level ISA Specifications, IEEE Transactions on Computers, vol.63, issue.6, pp.1552-1566, 2014.
DOI : 10.1109/TC.2013.37

C. Sung-hyuk, A genetic algorithm for constructing compact binary decision trees, International Journal of Information Security and Privacy, pp.32-60, 2010.

L. Zhang and S. Malik, The quest for efficient boolean satisfiability solvers, Computer Aided Verification, pp.17-36, 2002.
DOI : 10.1007/3-540-45657-0_2
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.79.9860

I. Poliakov, D. Sokolov, and A. Mokhov, Workcraft: a static data flow structure editing, visualisation and analysis tool. In: Petri Nets and Other Models of Concurrency, pp.505-514, 2007.
DOI : 10.1007/978-3-540-73094-1_30
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.469.6523