SCCD_execute.alc 21 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645
  1. include "primitives.alh"
  2. include "modelling.alh"
  3. include "object_operations.alh"
  4. include "utils.alh"
  5. include "random.alh"
  6. include "library.alh"
  7. Void function print_states(model : Element, data : Element):
  8. Element classes
  9. Element states
  10. Element class
  11. String state
  12. log("Current states:")
  13. classes = set_copy(data["classes"])
  14. while (read_nr_out(classes) > 0):
  15. class = set_pop(classes)
  16. log(string_join(string_join(string_join(" ", class["ID"]), " : "), read_attribute(model, class["type"], "name")))
  17. log(" Attributes: " + dict_to_string(class["attributes"]))
  18. states = set_copy(class["states"])
  19. log(" States:")
  20. while (read_nr_out(states) > 0):
  21. state = set_pop(states)
  22. log(string_join(" ", read_attribute(model, state, "name")))
  23. return!
  24. Element function filter(model : Element, set : Element, attribute_name : String, attribute_value : Element):
  25. Element keys
  26. String key
  27. Element result
  28. result = create_node()
  29. while (read_nr_out(set) > 0):
  30. key = set_pop(set)
  31. if (value_eq(read_attribute(model, key, attribute_name), attribute_value)):
  32. set_add(result, key)
  33. return result!
  34. Element function filter_exists(model : Element, set : Element, attribute_name : String):
  35. Element keys
  36. String key
  37. Element result
  38. result = create_node()
  39. while (read_nr_out(set) > 0):
  40. key = set_pop(set)
  41. if (element_neq(read_attribute(model, key, attribute_name), read_root())):
  42. set_add(result, key)
  43. return result!
  44. Element function expand_current_state(model : Element, state : String, current_states : Element):
  45. // Find the hierarchy of all current states, and select those that contain the currently selected state
  46. Element result
  47. result = create_node()
  48. current_states = set_copy(current_states)
  49. Element hierarchy
  50. String deep_state
  51. while (read_nr_out(current_states) > 0):
  52. deep_state = set_pop(current_states)
  53. hierarchy = find_hierarchy(model, deep_state)
  54. // Got the hierarchy of one of the states
  55. if (set_in(hierarchy, state)):
  56. // This hierarchy contains the root state we are checking for, so add to set
  57. set_add(result, deep_state)
  58. return result!
  59. Element function expand_initial_state(model : Element, state : String):
  60. String t
  61. t = read_type(model, state)
  62. if (t == "SCCD/CompositeState"):
  63. // Recurse further in the composite
  64. return expand_composite_state(model, state)!
  65. elif (t == "SCCD/ParallelState"):
  66. // Split up all components
  67. return expand_parallel_state(model, state)!
  68. else:
  69. // Probably just an atomic, so return this one only
  70. Element result
  71. result = create_node()
  72. set_add(result, state)
  73. return result!
  74. Element function expand_composite_state(model : Element, composite_state : String):
  75. // Resolve all initial states from a single composite state
  76. String initial
  77. // Fetch the initial state
  78. initial = set_pop(filter(model, allAssociationDestinations(model, composite_state, "SCCD/composite_children"), "isInitial", True))
  79. // Expand the initial state, depending on what it is
  80. return expand_initial_state(model, initial)!
  81. Element function expand_parallel_state(model : Element, parallel_state : String):
  82. // Resolve all initial states from a single parallel state
  83. Element children
  84. Element result
  85. Element expanded_children
  86. children = allAssociationDestinations(model, parallel_state, "SCCD/parallel_children")
  87. result = create_node()
  88. while (read_nr_out(children) > 0):
  89. set_merge(result, expand_initial_state(model, set_pop(children)))
  90. return result!
  91. Void function delete_class(model : Element, data : Element, identifier : String):
  92. // Stop a specific class instance, with attached statechart, from executing
  93. dict_delete(data["classes"], identifier)
  94. Void function start_class(model : Element, data : Element, class : String, identifier : String, parameters : Element):
  95. // Start up the class and assign its initial state to it
  96. // Create the data structure for a running class
  97. Element class_handle
  98. class_handle = create_node()
  99. dict_add(class_handle, "type", class)
  100. dict_add(class_handle, "ID", identifier)
  101. dict_add(class_handle, "timers", create_node())
  102. // Add the current state of the class
  103. String initial_state
  104. // Should only be one behaviour linked to it!
  105. initial_state = set_pop(allAssociationDestinations(model, class, "SCCD/behaviour"))
  106. dict_add(class_handle, "states", expand_initial_state(model, initial_state))
  107. // Add all attributes
  108. Element attributes
  109. attributes = create_node()
  110. Element attrs
  111. attrs = allAssociationDestinations(model, class, "SCCD/class_attributes")
  112. while (read_nr_out(attrs) > 0):
  113. dict_add(attributes, read_attribute(model, set_pop(attrs), "name"), read_root())
  114. dict_add(class_handle, "attributes", attributes)
  115. // Invoke constructor
  116. Element constructor
  117. constructor = read_attribute(model, class, "constructor_body")
  118. if (element_neq(constructor, read_root())):
  119. // Constructor, so execute
  120. constructor = get_func_AL_model(import_node(constructor))
  121. constructor(attributes, parameters)
  122. // Execute all entry actions
  123. Element init
  124. init = create_node()
  125. set_add(init, "")
  126. // Initial state before initialization is the set with an empty hierarchy
  127. // Empty set would not find any difference between the source and target
  128. execute_actions(model, init, set_copy(class_handle["states"]), attributes)
  129. dict_add(data["classes"], class_handle["ID"], class_handle)
  130. return!
  131. Element function get_enabled_transitions(model : Element, state : String, data : Element, class : String):
  132. // Returns all enabled transitions
  133. Element result
  134. Element to_filter
  135. String attr
  136. String transition
  137. Element cond
  138. String evt_name
  139. Element evt
  140. Element events
  141. Element event_names
  142. Element event_parameters
  143. result = create_node()
  144. to_filter = allOutgoingAssociationInstances(model, state, "SCCD/transition")
  145. event_names = create_node()
  146. event_parameters = create_node()
  147. events = set_copy(data["events"])
  148. while (read_nr_out(events) > 0):
  149. evt = set_pop(events)
  150. evt_name = list_read(evt, 0)
  151. if (bool_not(set_in(event_names, evt_name))):
  152. // Not yet registered the event
  153. set_add(event_names, evt_name)
  154. dict_add(event_parameters, evt_name, create_node())
  155. // Add event parameters
  156. set_add(event_parameters[evt_name], list_read(evt, 1))
  157. while (read_nr_out(to_filter) > 0):
  158. transition = set_pop(to_filter)
  159. // Check event
  160. attr = read_attribute(model, transition, "event")
  161. if (bool_not(bool_or(element_eq(attr, read_root()), set_in(event_names, attr)))):
  162. // At least one enabled event is found
  163. continue!
  164. // Check after
  165. // Only an after if there was no event!
  166. if (bool_and(element_eq(attr, read_root()), read_attribute(model, transition, "after"))):
  167. if (dict_in(data["classes"][class]["timers"], transition)):
  168. // Registered timer already, let's check if it has expired
  169. if (float_gt(data["classes"][class]["timers"][transition], time())):
  170. // Not enabled yet
  171. continue!
  172. else:
  173. // Not registered even, so not enabled either
  174. continue!
  175. // Check condition, but depends on whether there was an event or not
  176. cond = read_attribute(model, transition, "cond")
  177. if (element_neq(cond, read_root())):
  178. // Got a condition, so resolve
  179. cond = get_func_AL_model(import_node(cond))
  180. if (element_neq(attr, read_root())):
  181. // We have an event to take into account!
  182. Element params
  183. Element param
  184. params = set_copy(event_parameters[attr])
  185. while (read_nr_out(params) > 0):
  186. param = set_pop(params)
  187. if (element_neq(cond, read_root())):
  188. // Got a condition to check first
  189. if (bool_not(cond(data["classes"][class]["attributes"], param))):
  190. // Condition failed, so skip
  191. continue!
  192. // Fine to add this one with the specified parameters
  193. set_add(result, create_tuple(transition, param))
  194. else:
  195. // No event to think about, just add the transition
  196. if (element_neq(cond, read_root())):
  197. // Check the condition first
  198. if (bool_not(cond(data["classes"][class]["attributes"], read_root()))):
  199. // Condition false, so skip
  200. continue!
  201. // Fine to add this one without event parameters (no event)
  202. set_add(result, create_tuple(transition, read_root()))
  203. return result!
  204. Void function execute_actions(model : Element, source_states : Element, target_states : Element, attributes : Element):
  205. Element actions
  206. actions = get_actions_to_execute(model, source_states, target_states)
  207. while (read_nr_out(actions) > 0):
  208. Element action
  209. action = list_pop(actions, 0)
  210. action(attributes)
  211. return!
  212. Element function execute_transition(model : Element, data : Element, class : String, transition_tuple : Element):
  213. // Execute the script (if any)
  214. Element script
  215. String transition
  216. Element event_parameter
  217. transition = list_read(transition_tuple, 0)
  218. event_parameter = list_read(transition_tuple, 1)
  219. script = read_attribute(model, transition, "script")
  220. if (element_neq(script, read_root())):
  221. script = get_func_AL_model(import_node(script))
  222. script(data["classes"][class]["attributes"], event_parameter)
  223. // Raise events (if any)
  224. Element events
  225. String event
  226. events = allAssociationDestinations(model, transition, "SCCD/transition_raises")
  227. while (read_nr_out(events) > 0):
  228. event = set_pop(events)
  229. Element parameter_action
  230. parameter_action = read_attribute(model, event, "parameter")
  231. if (element_neq(parameter_action, read_root())):
  232. // Got a parameter to evaluate
  233. parameter_action = get_func_AL_model(import_node(parameter_action))
  234. parameter_action = parameter_action(data["classes"][class]["attributes"], event_parameter)
  235. String scope
  236. scope = read_attribute(model, event, "scope")
  237. if (scope == "cd"):
  238. // Is an event for us internally, so don't append
  239. // Instead, we process it directly
  240. String operation
  241. operation = read_attribute(model, event, "event")
  242. if (operation == "create_instance"):
  243. // Start up a new class of the desired type
  244. // Parameters of this call:
  245. // class -- type of the class to instantiate
  246. // identifier -- name of this instance, for future reference
  247. // parameters -- parameters for constructor
  248. String class
  249. String identifier
  250. Element parameters
  251. class = set_pop(filter(model, allInstances(model, "SCCD/Class"), "name", list_read(parameter_action, 0)))
  252. identifier = list_read(parameter_action, 1)
  253. parameters = list_read(parameter_action, 2)
  254. start_class(model, data, class, identifier, parameters)
  255. elif (operation == "delete_instance"):
  256. // Delete the requested class
  257. String identifier
  258. identifier = list_read(parameter_action, 0)
  259. delete_class(model, data, identifier)
  260. else:
  261. set_add(data["events"], create_tuple(read_attribute(model, event, "event"), parameter_action))
  262. // Find new set of states
  263. Element target_states
  264. Element source_states
  265. source_states = expand_current_state(model, readAssociationSource(model, transition), data["classes"][class]["states"])
  266. target_states = expand_initial_state(model, readAssociationDestination(model, transition))
  267. execute_actions(model, source_states, target_states, data["classes"][class]["attributes"])
  268. return target_states!
  269. Boolean function step_class(model : Element, data : Element, class : String):
  270. // Find enabled transitions in a class and execute it, updating the state
  271. // Iterate over all current states, searching for enabled transitions
  272. // Search for enabled transitions in higher levels as well!
  273. Element states
  274. Element new_states
  275. String state
  276. Element transitions
  277. String transition
  278. Boolean transitioned
  279. Element hierarchy
  280. String current_state
  281. Boolean found
  282. states = set_copy(data["classes"][class]["states"])
  283. new_states = create_node()
  284. transitioned = False
  285. while (read_nr_out(states) > 0):
  286. state = set_pop(states)
  287. found = False
  288. // Loop over the hierarchy of this state and try to apply transitions
  289. hierarchy = find_hierarchy(model, state)
  290. while (read_nr_out(hierarchy) > 0):
  291. current_state = list_pop(hierarchy, 0)
  292. transitions = get_enabled_transitions(model, current_state, data, class)
  293. if (read_nr_out(transitions) > 0):
  294. // Found an enabled transition, so store that one
  295. transition = random_choice(transitions)
  296. // Execute transition
  297. set_merge(new_states, execute_transition(model, data, class, transition))
  298. // When leaving an orthogonal component, we must also pop all related states that might be processed in the future!
  299. Element leaving
  300. leaving = expand_current_state(model, current_state, data["classes"][class]["states"])
  301. set_difference(states, leaving)
  302. transitioned = True
  303. found = True
  304. break!
  305. if (bool_not(found)):
  306. // Nothing found, so stay in the current state
  307. set_add(new_states, state)
  308. // Update states
  309. dict_overwrite(data["classes"][class], "states", new_states)
  310. reschedule_timeouts(model, data, class)
  311. return transitioned!
  312. Void function reschedule_timeouts(model : Element, data : Element, class : String):
  313. Element timed_transitions
  314. Element old_timed_transitions
  315. String transition
  316. Element states
  317. String state
  318. timed_transitions = create_node()
  319. states = set_copy(data["classes"][class]["states"])
  320. // Collect all timed transitions that are currently active
  321. while (read_nr_out(states) > 0):
  322. state = set_pop(states)
  323. // NOTE this set_merge does not eliminate duplicates, though this should happen later on when adding the timer (see other NOTE)
  324. set_merge(timed_transitions, filter_exists(model, allOutgoingAssociationInstances(model, state, "SCCD/transition"), "after"))
  325. // Remove timers that no longer exist
  326. old_timed_transitions = dict_keys(data["classes"][class]["timers"])
  327. while (read_nr_out(old_timed_transitions) > 0):
  328. transition = set_pop(old_timed_transitions)
  329. if (bool_not(set_in(timed_transitions, transition))):
  330. // Transition is no longer scheduled for any state, so remove
  331. dict_delete(data["classes"][class]["timers"], transition)
  332. // Schedule timers that are not already scheduled
  333. while (read_nr_out(timed_transitions) > 0):
  334. transition = set_pop(timed_transitions)
  335. // NOTE Normally, a timer will not be added twice here, as the previous occurence will already find it
  336. if (bool_not(dict_in(data["classes"][class]["timers"], transition))):
  337. // Not yet scheduled this transition: do so now
  338. Element after
  339. Float after_duration
  340. after = read_attribute(model, transition, "after")
  341. after = get_func_AL_model(import_node(after))
  342. after_duration = after(data["classes"][class]["attributes"])
  343. dict_add(data["classes"][class]["timers"], transition, float_addition(data["start_time"], after_duration))
  344. return !
  345. String function get_parent(model : Element, state : String):
  346. Element tmp_set
  347. tmp_set = allAssociationOrigins(model, state, "SCCD/composite_children")
  348. set_merge(tmp_set, allAssociationOrigins(model, state, "SCCD/parallel_children"))
  349. if (read_nr_out(tmp_set) > 0):
  350. return set_pop(tmp_set)!
  351. else:
  352. return ""!
  353. Element function find_hierarchy(model : Element, state : String):
  354. if (state == ""):
  355. return create_node()!
  356. else:
  357. Element result
  358. String parent
  359. parent = get_parent(model, state)
  360. // We have a parent, so take the parent list first
  361. result = find_hierarchy(model, parent)
  362. list_append(result, state)
  363. return result!
  364. Element function get_actions_to_execute(model : Element, source_states : Element, target_states : Element):
  365. Element result
  366. result = create_node()
  367. source_states = set_copy(source_states)
  368. target_states = set_copy(target_states)
  369. // Add all exit and entry actions to the list of actions to execute
  370. // Do this by finding the common parent, and then doing all exit actions up to that node, and all entry actions up to the target_state
  371. // First, find the hierarchy!
  372. Element hierarchy_sources
  373. Element hierarchy_targets
  374. Element all_hierarchies
  375. hierarchy_sources = create_node()
  376. while (read_nr_out(source_states) > 0):
  377. set_add(hierarchy_sources, find_hierarchy(model, set_pop(source_states)))
  378. hierarchy_targets = create_node()
  379. while (read_nr_out(target_states) > 0):
  380. set_add(hierarchy_targets, find_hierarchy(model, set_pop(target_states)))
  381. all_hierarchies = set_copy(hierarchy_sources)
  382. set_merge(all_hierarchies, hierarchy_targets)
  383. // Difference these all lists, finding the first common entry
  384. Element iter_hierarchies
  385. Integer i
  386. String current
  387. Element hierarchy
  388. Boolean finished
  389. i = 0
  390. finished = False
  391. while (bool_not(finished)):
  392. // Check the i-th element in both and see if they are equal
  393. current = ""
  394. iter_hierarchies = set_copy(all_hierarchies)
  395. while (read_nr_out(iter_hierarchies) > 0):
  396. hierarchy = set_pop(iter_hierarchies)
  397. // Exhausted one of the lists
  398. if (i >= list_len(hierarchy)):
  399. finished = True
  400. break!
  401. // First entry, so read out value as reference
  402. if (current == ""):
  403. current = list_read(hierarchy, i)
  404. // Check with reference element
  405. if (bool_not(value_eq(list_read(hierarchy, i), current))):
  406. finished = True
  407. break!
  408. // i-th element equal for all hierarchies, so go to next element
  409. if (bool_not(finished)):
  410. i = i + 1
  411. // Found the first differing element at position i
  412. // All elements remaining in hierarchy_source are to be traversed in REVERSE order for the exit actions
  413. // All elements remaining in hierarchy_target are to be traversed in NORMAL order for the entry actions
  414. // This is not that simple either, as we need to consider that some actions might already have been added to the list...
  415. // Add hierarchy_sources actions
  416. String state
  417. Element visited
  418. Element action
  419. Element spliced_hierarchy
  420. Element hierarchy_source
  421. Element hierarchy_target
  422. visited = create_node()
  423. while (read_nr_out(hierarchy_sources) > 0):
  424. // Get one of these hierarchies
  425. hierarchy_source = set_pop(hierarchy_sources)
  426. spliced_hierarchy = list_splice(hierarchy_source, i, list_len(hierarchy_source))
  427. while (list_len(spliced_hierarchy) > 0):
  428. state = list_pop(spliced_hierarchy, list_len(spliced_hierarchy) - 1)
  429. if (set_in(visited, state)):
  430. // Already added this state, so don't bother
  431. continue!
  432. else:
  433. // New state, so prepend it to the list
  434. // Prepend, instead of append, as we want to do these operations in reverse order!
  435. // First check if there is any exit action at all
  436. action = read_attribute(model, state, "onExitScript")
  437. if (element_neq(action, read_root())):
  438. // An exit action is found!
  439. list_insert(result, get_func_AL_model(import_node(action)), 0)
  440. // Add this state as visited, even though there might not have been an associated action
  441. set_add(visited, state)
  442. // Add hierarchy_targets actions
  443. // Clear visited, just to be safe, though it should not matter
  444. visited = create_node()
  445. while (read_nr_out(hierarchy_targets) > 0):
  446. // Get one of these hierarchies
  447. hierarchy_target = set_pop(hierarchy_targets)
  448. spliced_hierarchy = list_splice(hierarchy_target, i, list_len(hierarchy_target))
  449. while (list_len(spliced_hierarchy) > 0):
  450. state = list_pop(spliced_hierarchy, list_len(spliced_hierarchy) - 1)
  451. if (set_in(visited, state)):
  452. // Already added this state, so don't bother
  453. continue!
  454. else:
  455. // New state, so append it to the list
  456. // Append, instead of prepend, as we want to do these operations in normal order!
  457. // First check if there is any entry action at all
  458. action = read_attribute(model, state, "onEntryScript")
  459. if (element_neq(action, read_root())):
  460. // An entry action is found!
  461. list_append(result, get_func_AL_model(import_node(action)))
  462. // Add this state as visited, even though there might not have been an associated action
  463. set_add(visited, state)
  464. return result!
  465. Float function step(model : Element, data : Element):
  466. // Step through all classes
  467. Element classes
  468. Element class
  469. Float t_min
  470. Float t_current
  471. Boolean transitioned
  472. Element keys
  473. String key
  474. t_min = time() + 99999.0
  475. classes = dict_keys(data["classes"])
  476. // TODO this should use simulated time or something
  477. dict_overwrite(data, "start_time", time())
  478. transitioned = False
  479. while (read_nr_out(classes) > 0):
  480. class = set_pop(classes)
  481. if (step_class(model, data, class)):
  482. transitioned = True
  483. if (bool_not(transitioned)):
  484. // Find minimum timer for this class, and store that
  485. keys = dict_keys(data["classes"][class]["timers"])
  486. while (read_nr_out(keys) > 0):
  487. key = set_pop(keys)
  488. t_current = data["classes"][class]["timers"][key]
  489. if (t_current < t_min):
  490. t_min = t_current
  491. if (transitioned):
  492. // Do another step, as we can transition
  493. return 0.0!
  494. else:
  495. return float_subtraction(t_min, data["start_time"])!
  496. Boolean function main(model : Element):
  497. // Executes the provided SCCD model
  498. Element data
  499. data = create_node()
  500. dict_add(data, "classes", create_node())
  501. // Prepare for input
  502. output("Ready for input!")
  503. // Find initial
  504. String default_class
  505. default_class = set_pop(filter(model, allInstances(model, "SCCD/Class"), "default", True))
  506. // Start up the default class
  507. start_class(model, data, default_class, "main", read_root())
  508. Float timeout
  509. Element interrupt
  510. timeout = 0.0
  511. while (True):
  512. print_states(model, data)
  513. interrupt = input_timeout(timeout)
  514. if (value_eq(interrupt, "#EXIT#")):
  515. // Stop execution
  516. return True!
  517. dict_overwrite(data, "events", create_node())
  518. if (element_neq(interrupt, read_root())):
  519. // Got interrupt
  520. log("Got event: " + cast_v2s(interrupt))
  521. set_add(data["events"], create_tuple(interrupt, read_root()))
  522. output("Processed event, ready for more!")
  523. timeout = step(model, data)
  524. if (read_nr_out(data["classes"]) == 0):
  525. // No more active classes left: terminate!
  526. log("Finished SCCD execution")
  527. break!
  528. log("Pausing for " + cast_v2s(timeout))
  529. // We should never get here!
  530. return False!