The formalism of modal transition systems (MTS) is a well established framework for systems specification as well as abstract interpretation. Nevertheless, due to incapability to capture some useful features, various extensions have been studied, such as e.g. mixed transition systems or disjunctive MTS. Thus a need to compare them has emerged. Therefore, we introduce transition system with obligations as a general model encompassing all the aforementioned models, and equip it with a process algebra description. Using these instruments, we then compare the previously studied subclasses and characterize their relationships.
@InProceedings{benes_et_al:OASIcs.MEMICS.2010.9, author = {Benes, Nikola and Kretinsky, Jan}, title = {{Process Algebra for Modal Transition Systemses}}, booktitle = {Sixth Doctoral Workshop on Mathematical and Engineering Methods in Computer Science (MEMICS'10) -- Selected Papers}, pages = {9--18}, series = {Open Access Series in Informatics (OASIcs)}, ISBN = {978-3-939897-22-4}, ISSN = {2190-6807}, year = {2011}, volume = {16}, editor = {Matyska, Ludek and Kozubek, Michal and Vojnar, Tomas and Zemcik, Pavel and Antos, David}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.MEMICS.2010.9}, URN = {urn:nbn:de:0030-drops-30701}, doi = {10.4230/OASIcs.MEMICS.2010.9}, annote = {Keywords: modal transition systems, process algebra, specification} }
Feedback for Dagstuhl Publishing