Formal Verification of the Correctness and Soundness of a Pomset-to-LTS Transformation Algorithm
In this paper, we present a comprehensive proof of the correctness and soundness of our previously published algorithm for transforming partially ordered multisets (Pomsets) into labeled transition systems (LTS). Our approach rigorously ensures that the transformation algorithm preserves the behavio...
Збережено в:
| Автори: | , , , |
|---|---|
| Формат: | Artigo |
| Мова: | Inglês |
| Опубліковано: |
Croatian Communications and Information Society (CCIS)
2025-12-01
|
| Серія: | Journal of Communications Software and Systems |
| Предмети: | |
| Онлайн доступ: | https://jcoms.fesb.unist.hr/10.24138/jcomss-2025-0028/ |
| Теги: |
Немає тегів, Будьте першим, хто поставить тег для цього запису!
|