Reconfigu rable Transition Systems (RTS) are dynamic relatio nal structures (graphs) that evolve along its exec ution, in the sense that their accessibility relat ion, their set of nodes or their labelling change when their edges are crossed. These structures hav e proven to be suitable to compactly represent com plex reactive and reconfigurable behaviours. Namel y, the ability of reacting or readapting under the influence of certain events is a very distinctive feature of many diverse situations and objects. A n autonomous vehicle that changes its route due to a new strike occurring, the behaviour of a softwa re component after a memory disposal, or a DNA mut ation as the result of a viral infection, are diff erent examples that witness the importance of mode lling about changes in a determined situation. Pra ctical user cases have aroused the interest of the logic community in the study of variants of RTS, by developing formal methods to properly reason ab out such situations.
\nFull p
apers and short presentations are invited on origi
nal and unpublished research on various aspects of
Formal Methods for Reconfigurable Systems. System
Descriptions are both allowed as full papers or s
hort presentations. You are requested to submit yo
ur research paper using Easy Chair.
\n Accepted Fu
ll Papers will be included in the workshop program
me and will appear in the workshop pre-proceedings
as well as in the LNCS volume. Short presentation
s will be included in the pre-proceedings. Pre-pro
ceedings will be available online before the Works
hop. Extended versions of selected contributions w
ill be published in a special issue of the Journal
of Applied Logics.