Building bridges between sets of partial orders

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 8977, Issue , 2015, Pages 145-160

  Ponce De León, Hernán ^a   Mokhov, Andrey ^b  

^a AALTO UNIVERSITY   (Finland)

^b NEWCASTLE UNIVERSITY   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; AUTOMATA THEORY;

EVENT STRUCTURES; EXPRESSIVE POWER; MATHEMATICAL FORMALISM; MATHEMATICAL STRUCTURE; PARTIAL ORDER; TRUE CONCURRENCY;

COMPUTATIONAL LINGUISTICS;

EID: 84928822318     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-319-15579-1_11     Document Type: Conference Paper

References (11)

1. Berkeley Logic Synthesis and Verification Group: ABC: A System for Sequential Synthesis and Verification, Release 70930. http://www.eecs.berkeley.edu/alanmi/abc/
2. D’Alessandro, C., Mokhov, A., Bystrov, A.V., Yakovlev, A.: Delay/phase regeneration circuits. In: 13th IEEE International Symposium on Asynchronous Circuits and Systems (ASYNC 2007), 12–14 March 2006, Berkeley. pp. 105–116. IEEE Computer Society (2007). http://doi.ieeecomputersociety.org/10.1109/ASYNC.2007.14
3. Esparza, J., Römer, S., Vogler, W.: An improvement of McMillan’s unfolding. In: Margaria, T., Steffen, B. (eds.) TACAS 1996. LNCS, vol. 1055, pp. 87–106. Springer, Heidelberg (1996)
4. Mokhov, A., Iliasov, A., Sokolov, D., Rykunov, M., Yakovlev, A., Romanovsky, A.: Synthesis of processor instruction sets from high-level ISA specifications. IEEE Trans. Computers 63(6), 1552–1566 (2014). http://doi.ieeecomputersociety.org/10.1109/TC.2013.37
5. Mokhov, A., Yakovlev, A.: Conditional partial order graphs: Model, synthesis, and application. IEEE Trans. Computers 59(11), 1480–1493 (2010)
6. Nielsen, M., Plotkin, G.D., Winskel, G.: Petri nets, event structures and domains, part I. Theoretical Computer Science 13, 85–108 (1981)
7. Poliakov, I., Sokolov, D., Mokhov, A.: Workcraft: a static data flow structure editing, visualisation and analysis tool. In: Kleijn, J., Yakovlev, A. (eds.) ICATPN 2007. LNCS, vol. 4546, pp. 505–514. Springer, Heidelberg (2007)
8. Ponce de León, H., Mokhov, A.: Building bridges between sets of partial orders. (2014), technical report. http://hal.inria.fr/hal-01060449 (Visited on September 4, 2014)
9. Sung-hyuk, C.: A genetic algorithm for constructing compact binary decision trees. In: International Journal of Information Security and Privacy. pp. 32–60 (2010)
10. Wegener, I.: The Complexity of Boolean Functions. Johann Wolfgang Goethe- Universitat (1987)
11. Zhang, L., Malik, S.: The Quest for Efficient Boolean Satisfiability Solvers. In: Brinksma, E., Larsen, K.G. (eds.) CAV 2002. LNCS, vol. 2404, pp. 17–36. Springer, Heidelberg (2002)