Articles dans des revues avec comité de lecture (98)

  1. 15. Devillers, R. (2019). Articulation of Transition Systems and Its Application to Petri Net Synthesis. Lecture notes in computer science, 11522 LNCS, 113-126. doi:10.1007/978-3-030-21571-2_8
  2. 16. Devillers, R., Erofeev, E., & Hujsa, T. (2019). Synthesis of Weighted Marked Graphs from Constrained Labelled Transition Systems: A Geometric Approach. Lecture notes in computer science, 11790 LNCS, 172-191. doi:10.1007/978-3-662-60651-3_7
  3. 17. Devillers, R., & Hujsa, T. (2019). Analysis and Synthesis of Weighted Marked Graph Petri Nets: Exact and Approximate Methods. Fundamenta informaticae, 169(1-2), 1-30. doi:10.3233/FI-2019-1837
  4. 18. Devillers, R., Erofeev, E., & Hujsa, T. (2019). Synthesis of weighted marked graphs from circular labelled transition systems. CEUR Workshop Proceedings, 2371, 6-22.
  5. 19. Arcile, J., Devillers, R., & Klaudel, H. (2019). VerifCar: a framework for modeling and model checking communicating autonomous vehicles. Autonomous agents and multi-agent systems, 33(3), 353-381. doi:10.1007/s10458-019-09409-x
  6. 20. Best, E., Devillers, R., & Schlachter, U. (2018). Bounded choice-free Petri net synthesis: algorithmic issues. Acta informatica, 55(7), 575-611. doi:10.1007/s00236-017-0310-9
  7. 21. Hujsa, T., & Devillers, R. (2018). On Deadlockability, Liveness and Reversibility in Subclasses of Weighted Petri Nets. Fundamenta informaticae, 161(4), 383-421. doi:10.3233/FI-2018-1708
  8. 22. Devillers, R. (2018). Factorisation of transition systems. Acta informatica, 55(4), 339-362. doi:10.1007/s00236-017-0300-y
  9. 23. Best, E., & Devillers, R. (2018). Pre-synthesis of Petri nets based on prime cycles and distance paths. Science of computer programming, 157, 41-55. doi:10.1016/j.scico.2017.07.005
  10. 24. Devillers, R., Erofeev, E., & Hujsa, T. (2018). Synthesis of weighted marked graphs from constrained labelled transition systems. CEUR Workshop Proceedings, 2115, 75-90.
  11. 25. Devillers, R., & Hujsa, T. (2018). Analysis and synthesis of weighted marked graph petri nets. Lecture notes in computer science, 10877 LNCS, 19-39. doi:10.1007/978-3-319-91268-4_2
  12. 26. Devillers, R., & Schlachter, U. (2018). Factorisation of Petri net solvable transition systems. Lecture notes in computer science, 10877 LNCS, 82-98. doi:10.1007/978-3-319-91268-4_5

  13. << Précédent 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 Suivant >>