10.4230/LIPICS.ICLP.2011.106
Alrajeh, Dalal
Dalal
Alrajeh
Kramer, Jeff
Jeff
Kramer
Russo, Alessandra
Alessandra
Russo
Uchitel, Sebastian
Sebastian
Uchitel
An Inductive Approach for Modal Transition System Refinement
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
2011
Modal Transition Systems
Refinement
Inductive Logic Programming
Event Calculus
Gallagher, John P.
John P.
Gallagher
Gelfond, Michael
Michael
Gelfond
2011
2011-06-27
2011-06-27
2011-06-27
en
urn:nbn:de:0030-drops-31758
10.4230/LIPIcs.ICLP.2011
978-3-939897-31-6
1868-8969
10.4230/LIPIcs.ICLP.2011
LIPIcs, Volume 11, ICLP 2011
Technical Communications of the 27th International Conference on Logic Programming (ICLP'11)
2013
11
11
106
116
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Gallagher, John P.
John P.
Gallagher
Gelfond, Michael
Michael
Gelfond
1868-8969
Leibniz International Proceedings in Informatics (LIPIcs)
2011
11
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
11 pages
576960 bytes
application/pdf
Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported license
info:eu-repo/semantics/openAccess
Modal Transition Systems (MTSs) provide an appropriate framework for modelling software behaviour when only a partial specification is available. A key characteristic of an MTS is that it explicitly models events that a system is required to provide and is proscribed from exhibiting, and those for which no specification is available, called maybe events. Incremental elaboration of maybe events into either required or proscribed events can be seen as a process of MTS refinement, resulting from extending a given partial specification with more information about the system behaviour. This paper focuses on providing automated support for computing strong refinements
of an MTS with respect to event traces that describe required and proscribed behaviours using a non-monotonic inductive logic programming technique. A real case study is used to illustrate
the practical application of the approach.
LIPIcs, Vol. 11, Technical Communications of the 27th International Conference on Logic Programming (ICLP'11), pages 106-116