|
Forcible EventsSynthesis functions that respect the forcibility attribute of events. Definition of Controllability for Forced EventsConsider two languages L and K over a common alphabet Sigma, a set of uncontrollable events Sigma_uc ⊆ Sigma. a set of forcible events Sigma_f ⊆ Sigma, and a set of preemptable events Sigma_p ⊆ Sigma_uc with Sigma_f∩Sigma_p = 0.
Then K is said to be controllable w.r.t. (L,Sigma_uc,Sigma_f,Sigma_p) iff for all s ∈ Closure(K)
Note: For Sigma_p = {tick} ⊆ Sigma_uc, the above notion of controllability should match the common setting of timed discrete event systems (TDES). Note: [Experimental!] The definition as well as the implemenation needs testing and a proper design. SupTconNBComputes the supremal tdes-controllable sublanguage. Signature:SupTconNB(+In+ System GPlant, +In+ Generator GSpec, +Out+ Generator GSupervisor) SupTconNB(+In+ Generator GPlant, +In+ EventSet AContr, +In+ EventSet AForcib, +In+ EventSet APreemp, +In+ Generator GSpec, +Out+ Generator GSupervisor) Detailed description:This function seeks to compute a controllable subset of Lm(GCand)∩Lm(GPlant). The current implementation performs the test by inspecting the transitions in the product composition GPlant x GCand. Parameter Conditions:This implementation requires the alphabets of plant and specification to match. Furthermore, both generators must be deterministic. Effectively, the specification is intersected with the plant language. [Experimental!] The definition as well as the implemenation needs testing and a proper design. libFAUDES 2.24a --- 2014.04.04 --- with "synthesis-observer-diagnosis-hiosys-iosystem-multitasking-coordinationcontrol-timed-simulator-iodevice-luabindings" |