| Reversible computation vs. reversibility in Petri nets K Barylska, M Koutny, Ł Mikulski, M Piątkowski Science of Computer Programming 151, 48-60, 2018 | 28 | 2018 |
| Step traces R Janicki, J Kleijn, M Koutny, Ł Mikulski Acta Informatica 53 (1), 35-65, 2016 | 20 | 2016 |
| Conditions for Petri net solvable binary words K Barylska, E Best, E Erofeev, Ł Mikulski, M Piątkowski Transactions on Petri Nets and Other Models of Concurrency XI, 137-159, 2016 | 20* | 2016 |
| Reversing computations modelled by coloured Petri nets K Barylska, A Gogolinska, L Mikulski, A Philippou, M Piatkowski, K Psara CEUR-WS. org, 2018 | 19 | 2018 |
| On persistent reachability in Petri nets K Barylska, Ł Mikulski, E Ochmański Information and Computation 223, 67-77, 2013 | 17* | 2013 |
| Reversing transitions in bounded Petri nets K Barylska, E Erofeev, M Koutny, Ł Mikulski, M Piątkowski Fundamenta Informaticae 157 (4), 341-357, 2018 | 16 | 2018 |
| Projection representation of Mazurkiewicz traces Ł Mikulski Fundamenta Informaticae 85 (1-4), 399-408, 2008 | 16 | 2008 |
| Characterising concurrent histories R Janicki, J Kleijn, M Koutny, Ł Mikulski Fundamenta Informaticae 139 (1), 21-42, 2015 | 15* | 2015 |
| Approximate verification of strategic abilities under imperfect information W Jamroga, M Knapik, D Kurpiewski, Ł Mikulski Artificial Intelligence 277, 103172, 2019 | 12 | 2019 |
| Folded Hasse diagrams of combined traces Ł Mikulski, M Koutny Information Processing Letters 114 (4), 208-216, 2014 | 12* | 2014 |
| Discovering patterns of visits on the Internet web sites in the perspective of associative models Ł Mikulski, P Weichbroth Polish Journal of Environmental Studies 18 (3B), 267-271, 0 | 12* | |
| Generating all minimal petri net unsolvable binary words E Erofeev, K Barylska, Ł Mikulski, M Piątkowski Discrete Applied Mathematics 274, 35-53, 2020 | 11* | 2020 |
| Classifying invariant structures of step traces R Janicki, J Kleijn, M Koutny, Ł Mikulski Journal of Computer and System Sciences 104, 297-322, 2019 | 10* | 2019 |
| Foundations of reversible computation B Aman, G Ciobanu, R Glück, R Kaarsgaard, J Kari, M Kutrib, I Lanese, ... International Conference on Reversible Computation, 1-40, 2020 | 9 | 2020 |
| Reaction systems, transition systems, and equivalences J Kleijn, M Koutny, Ł Mikulski, G Rozenberg Adventures Between Lower Bounds and Higher Altitudes, 63-84, 2018 | 9 | 2018 |
| Persistent and nonviolent steps and the design of GALS systems J Fernandes, M Koutny, Ł Mikulski, M Pietkiewicz-Koutny, D Sokolov, ... Fundamenta Informaticae 137 (1), 143-170, 2015 | 9 | 2015 |
| Algorithmics of Posets Generated by Words Over Partially Commutative Alphabets (Extended Version) L Mikulski, M Piatkowski, S Smyczynski Scientific Annals of Computer Science 23 (2), 229, 2013 | 9* | 2013 |
| An extension of the taxonomy of persistent and nonviolent steps M Koutny, Ł Mikulski, M Pietkiewicz-Koutny Information Sciences 394, 299-314, 2017 | 8* | 2017 |
| Reversing steps in Petri nets D de Frutos Escrig, M Koutny, Ł Mikulski International Conference on Applications and Theory of Petri Nets and …, 2019 | 7 | 2019 |
| Reaction systems and enabling equivalence J Kleijn, M Koutny, Ł Mikulski Fundamenta Informaticae 171 (1-4), 261-277, 2020 | 6 | 2020 |
Maciej KoutnyNewcastle Universityncl.ac.uk의 이메일 확인됨
