Your browser does not support JavaScript!

Efficient composition of scenario-based hardware specifications

Efficient composition of scenario-based hardware specifications

For access to this article, please select a purchase option:

Buy article PDF
(plus tax if applicable)
Buy Knowledge Pack
10 articles for $120.00
(plus taxes if applicable)

IET members benefit from discounts to all IET publications and free access to E&T Magazine. If you are an IET member, log in to your account and the discounts will automatically be applied.

Learn more about IET membership 

Recommend Title Publication to library

You must fill out fields marked with: *

Librarian details
Your details
Why are you recommending this title?
Select reason:
IET Computers & Digital Techniques — Recommend this title to your library

Thank you

Your recommendation has been sent to your librarian.

Complex hardware systems can be designed by breaking down their behaviour into high-level descriptions of constituent scenarios and then composing these scenarios into an efficient hardware implementation using a form of high-level synthesis. There are a few existing methodologies for such scenario-based specification and synthesis, and in this study, the authors focus on highly concurrent systems, whose scenarios are typically described using explicit concurrency models such as partial orders. They propose a new algorithm for the composition of partial order scenarios. Unlike previously published methods, the proposed algorithm supports composition constraints, which allow the designer to restrict certain aspects of the composition in order to reuse legacy intellectual property (IP). Furthermore, the authors implementation is more scalable and can cope with specifications comprising hundreds of scenarios at the cost of only of area overhead compared to optimal solutions obtained by the exhaustive search. The proposed algorithm is implemented in an open-source electronic design automation (EDA) tool, validated on a set of benchmarks, and compared to the state-of-the-art behavioural composition approaches and to other existing methodologies that make use of behavioural synthesis.


    1. 1)
      • 3. Martin, G., Smith, G.: ‘High-level synthesis: past, present, and future’, IEEE Design Test Comput., 2009, 26, (4), pp. 1825.
    2. 2)
      • 6. Mokhov, A., Yakovlev, A.: ‘Conditional partial order graphs: model, synthesis, and application’, IEEE Trans. Comput., 2010, 59, (11), pp. 14801493.
    3. 3)
      • 16. Mokhov, A.: ‘Conditional partial order graphs’. PhD thesis, Newcastle University, 2009.
    4. 4)
      • 36. Mokhov, A., Carmona, J., Beaumont, J.: ‘Mining conditional partial order graphs from event logs’ (Springer, Berlin, Heidelberg, 2016), pp. 114136.
    5. 5)
      • 11. de Gennaro, A., Stankaitis, P., Mokhov, A.: ‘A heuristic algorithm for deriving compact models of processor instruction sets’. 2015 15th Int. Conf. on Application of Concurrency to System Design, June 2015, pp. 100109.
    6. 6)
      • 29. Sentovich, E.M., Singh, K.J., Lavagno, L., et al: ‘Sis: A system for sequential circuit synthesis’. Technical Report UCB/ERL M92/41, EECS Department, University of California, Berkeley, 1992.
    7. 7)
      • 15. Lukyanov, G., Mokhov, A.: ‘Concurrency oracles for free’. Proc. of the Algorithms and Theories for the Analysis of Event Data 2018 Workshop, 2018(in print).
    8. 8)
      • 5. Fox, A., Myreen, M.O.: ‘A trustworthy monadic formalization of the ARMv7 instruction set architecture’ (Springer, Berlin, Heidelberg, 2010), pp. 243258.
    9. 9)
      • 8. Mokhov, A., Alekseyev, A., Yakovlev, A.: ‘Encoding of processor instruction sets with explicit concurrency control’, IET Comput. Digit. Tech., 2011, 5, (6), pp. 427439.
    10. 10)
      • 35. Rykunov, M.: ‘Design of asynchronous microprocessor for power proportionality’. PhD thesis, Newcastle University, 2013.
    11. 11)
      • 13. Reid, A., Chen, R., Deligiannis, A., et al: ‘End-to-end verification of processors with ISA-formal’. Int. Conf. on Computer Aided Verification, 2016, pp. 4258.
    12. 12)
      • 23. Gebser, M., Kaufmann, B., Schaub, T.: ‘Conflict-driven answer set solving: from theory to practice’, Artif. Intell., 2012, 187, pp. 5289.
    13. 13)
      • 21. Kurup, P., Abbasi, T.: ‘Logic synthesis using synopsys’ (Springer Publishing Company, New York, New York, USA, 2011, 2nd edn.).
    14. 14)
      • 32. Sparso, J., Furber, S.: ‘Principles of asynchronous circuit design: a systems perspective’ (Springer Publishing Company, New York, New York, USA, 2010, 1st edn.).
    15. 15)
      • 27. McGeer, P.C., Sanghavi, J.V., Brayton, R.K., et al: ‘Espresso-signature: a new exact minimizer for logic functions’, IEEE Trans. Very Large Scale Integr. (VLSI) Syst., 1993, 1, (4), pp. 432440.
    16. 16)
      • 34. Sokolov, D., de Gennaro, A., Mokhov, A.: ‘Reconfigurable asynchronous pipelines: from formal models to silicon’. Design, Automation Test in Europe Conf. Exhibition (DATE), March 2018.
    17. 17)
      • 2. Gajski, D., Wu, A.C.-H., Chaiyakul, V., et al: ‘Essential issues for IP reuse’. Design Automation Conf., 2000. Proc. ASP-DAC 2000. Asia and South Pacific, 2000, pp. 3742.
    18. 18)
      • 4. Reid, A.: ‘Trustworthy specifications of ARM v8-a and v8-m system level architecture’. 2016 Formal Methods in Computer-Aided Design (FMCAD), October 2016, pp. 161168.
    19. 19)
      • 30. Scenco documentation.
    20. 20)
      • 31. Mokhov, A., Rykunov, M., Sokolov, D., et al: ‘Design of processors with reconfigurable microarchitecture’, J. Low Power Electron. Appl., 2014, 4, (1), pp. 2643.
    21. 21)
      • 28. Berkeley Logic Synthesis and Verification Group. ABC, a system for sequential synthesis and verification.
    22. 22)
      • 18. De Micheli, G.: ‘Synthesis and optimization of digital circuits’ (McGraw-Hill Higher Education, Columbus, Ohio, USA, 1994, 1st edn.).
    23. 23)
      • 24. Eén, N., Sörensson, N.: ‘An extensible SAT-solver’ (Springer, Berlin, Heidelberg, 2004), pp. 502518.
    24. 24)
      • 7. Mokhov, A., Iliasov, A., Sokolov, D., et al: ‘Synthesis of processor instruction sets from high-level ISA specifications’, IEEE Trans. Comput., 2014, 63, (6), pp. 15521566.
    25. 25)
      • 1. Hameed, R., Qadeer, W., Wachs, M., et al: ‘Understanding sources of inefficiency in general-purpose chips’. ACM SIGARCH Computer Architecture News, 2010, vol. 38, pp. 3747.
    26. 26)
      • 25. Hamming, R.W.: ‘Error detecting and error correcting codes’, Bell Syst. Tech. J., 1950, 29, (2), pp. 147160.
    27. 27)
      • 14. Gray, K.E., Sewell, P., Pulte, C., et al: ‘The sail instruction-set semantics specification language’, 2017.
    28. 28)
      • 19. Cortadella, J., Kishinevsky, M., Kondratyev, A., et al: ‘Petrify: A tool for manipulating concurrent specifications and synthesis of asynchronous controllers’, 1996.
    29. 29)
      • 9. Scenco code. GitHub repository:
    30. 30)
      • 10. Workcraft. GitHub repository: Available at
    31. 31)
      • 17. Cortadella, J., Kishinevsky, M., Kondratyev, A., et al: ‘Logic synthesis for asynchronous controllers and interfaces’ (Springer Publishing Company, Berlin, Germany, Incorporated, 2013).
    32. 32)
      • 22. Cormen, T.H., Leiserson, C.E., Rivest, R.L., et al: ‘Introduction to algorithms’ (The MIT Press, Cambridge, Massachusetts, USA, 2009, 3rd edn.).
    33. 33)
      • 26. Kirkpatrick, S., Gelatt, C.D., Vecchi, M.P.: ‘Optimization by simulated annealing’, Science, 1983, 220, (4598), pp. 671680.
    34. 34)
      • 20. Khomenko, V., Koutny, M., Yakovlev, A.: ‘Detecting state coding conflicts in STG unfoldings using SAT’. Third Int. Conf. on Application of Concurrency to System Design, 2003. Proc., June 2003, pp. 5160.
    35. 35)
      • 12. Birkhoff, G.: ‘Lattice theory’. Number v. 25, pt. 2 in American Mathematical Society colloquium publications. (American Mathematical Society, Rhode Island, New England, USA, 1940).
    36. 36)
      • 33. Sokolov, D., Dubikhin, V., Khomenko, V., et al: ‘Benefits of asynchronous control for analog electronics: multiphase buck case study’. Design, Automation Test in Europe Conf. Exhibition (DATE), March 2017, pp. 17511756.

Related content

This is a required field
Please enter a valid email address