SCCD_execute.alc 21 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643
  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. log("Got enabled events: " + set_to_string(event_names))
  158. while (read_nr_out(to_filter) > 0):
  159. transition = set_pop(to_filter)
  160. // Check event
  161. attr = read_attribute(model, transition, "event")
  162. if (bool_not(bool_or(element_eq(attr, read_root()), set_in(event_names, attr)))):
  163. // At least one enabled event is found
  164. continue!
  165. // Check after
  166. // Only an after if there was no event!
  167. if (bool_and(element_eq(attr, read_root()), read_attribute(model, transition, "after"))):
  168. if (dict_in(data["classes"][class]["timers"], transition)):
  169. // Registered timer already, let's check if it has expired
  170. if (float_gt(data["classes"][class]["timers"][transition], time())):
  171. // Not enabled yet
  172. continue!
  173. else:
  174. // Not registered even, so not enabled either
  175. continue!
  176. // Check condition, but depends on whether there was an event or not
  177. cond = read_attribute(model, transition, "cond")
  178. if (element_neq(cond, read_root())):
  179. // Got a condition, so resolve
  180. cond = get_func_AL_model(import_node(cond))
  181. if (element_neq(attr, read_root())):
  182. // We have an event to take into account!
  183. Element params
  184. Element param
  185. params = set_copy(event_parameters[attr])
  186. while (read_nr_out(params) > 0):
  187. param = set_pop(params)
  188. if (element_neq(cond, read_root())):
  189. // Got a condition to check first
  190. if (bool_not(cond(data["classes"][class]["attributes"], param))):
  191. // Condition failed, so skip
  192. continue!
  193. // Fine to add this one with the specified parameters
  194. set_add(result, create_tuple(transition, param))
  195. else:
  196. // No event to think about, just add the transition
  197. if (element_neq(cond, read_root())):
  198. // Check the condition first
  199. if (bool_not(cond(data["classes"][class]["attributes"], read_root()))):
  200. // Condition false, so skip
  201. continue!
  202. // Fine to add this one without event parameters (no event)
  203. set_add(result, create_tuple(transition, read_root()))
  204. return result!
  205. Void function execute_actions(model : Element, source_states : Element, target_states : Element, attributes : Element):
  206. Element actions
  207. actions = get_actions_to_execute(model, source_states, target_states)
  208. while (read_nr_out(actions) > 0):
  209. Element action
  210. action = list_pop(actions, 0)
  211. action(attributes)
  212. return!
  213. Element function execute_transition(model : Element, data : Element, class : String, transition_tuple : Element):
  214. // Execute the script (if any)
  215. Element script
  216. String transition
  217. Element event_parameter
  218. transition = list_read(transition_tuple, 0)
  219. event_parameter = list_read(transition_tuple, 1)
  220. script = read_attribute(model, transition, "script")
  221. if (element_neq(script, read_root())):
  222. script = get_func_AL_model(import_node(script))
  223. script(data["classes"][class]["attributes"], event_parameter)
  224. // Raise events (if any)
  225. Element events
  226. String event
  227. events = allAssociationDestinations(model, transition, "SCCD/transition_raises")
  228. while (read_nr_out(events) > 0):
  229. event = set_pop(events)
  230. Element parameter_action
  231. parameter_action = read_attribute(model, event, "parameter")
  232. if (element_neq(parameter_action, read_root())):
  233. // Got a parameter to evaluate
  234. parameter_action = get_func_AL_model(import_node(parameter_action))
  235. parameter_action = parameter_action(data["classes"][class]["attributes"], event_parameter)
  236. String scope
  237. scope = read_attribute(model, event, "scope")
  238. if (scope == "cd"):
  239. // Is an event for us internally, so don't append
  240. // Instead, we process it directly
  241. String operation
  242. operation = read_attribute(model, event, "event")
  243. if (operation == "create_instance"):
  244. log("Creating new instance")
  245. // Start up a new class of the desired type
  246. // Parameters of this call:
  247. // class -- type of the class to instantiate
  248. // identifier -- name of this instance, for future reference
  249. // parameters -- parameters for constructor
  250. String class
  251. String identifier
  252. Element parameters
  253. class = set_pop(filter(model, allInstances(model, "SCCD/Class"), "name", list_read(parameter_action, 0)))
  254. identifier = list_read(parameter_action, 1)
  255. parameters = list_read(parameter_action, 2)
  256. start_class(model, data, class, identifier, parameters)
  257. elif (operation == "delete_instance"):
  258. // Delete the requested class
  259. String identifier
  260. identifier = list_read(parameter_action, 0)
  261. delete_class(model, data, identifier)
  262. else:
  263. set_add(data["events"], create_tuple(read_attribute(model, event, "event"), parameter_action))
  264. // Find new set of states
  265. Element target_states
  266. Element source_states
  267. source_states = expand_current_state(model, readAssociationSource(model, transition), data["classes"][class]["states"])
  268. target_states = expand_initial_state(model, readAssociationDestination(model, transition))
  269. execute_actions(model, source_states, target_states, data["classes"][class]["attributes"])
  270. return target_states!
  271. Boolean function step_class(model : Element, data : Element, class : String):
  272. // Find enabled transitions in a class and execute it, updating the state
  273. // Iterate over all current states, searching for enabled transitions
  274. // Search for enabled transitions in higher levels as well!
  275. Element states
  276. Element new_states
  277. String state
  278. Element transitions
  279. String transition
  280. Boolean transitioned
  281. Element hierarchy
  282. String current_state
  283. Boolean found
  284. states = set_copy(data["classes"][class]["states"])
  285. new_states = create_node()
  286. transitioned = False
  287. while (read_nr_out(states) > 0):
  288. state = set_pop(states)
  289. found = False
  290. // Loop over the hierarchy of this state and try to apply transitions
  291. hierarchy = find_hierarchy(model, state)
  292. while (read_nr_out(hierarchy) > 0):
  293. current_state = list_pop(hierarchy, 0)
  294. transitions = get_enabled_transitions(model, current_state, data, class)
  295. if (read_nr_out(transitions) > 0):
  296. // Found an enabled transition, so store that one
  297. transition = random_choice(transitions)
  298. // Execute transition
  299. set_merge(new_states, execute_transition(model, data, class, transition))
  300. // When leaving an orthogonal component, we must also pop all related states that might be processed in the future!
  301. Element leaving
  302. leaving = expand_current_state(model, current_state, data["classes"][class]["states"])
  303. set_difference(states, leaving)
  304. transitioned = True
  305. found = True
  306. break!
  307. if (bool_not(found)):
  308. // Nothing found, so stay in the current state
  309. set_add(new_states, state)
  310. // Update states
  311. dict_overwrite(data["classes"][class], "states", new_states)
  312. reschedule_timeouts(model, data, class)
  313. return transitioned!
  314. Void function reschedule_timeouts(model : Element, data : Element, class : String):
  315. Element timed_transitions
  316. Element old_timed_transitions
  317. String transition
  318. Element states
  319. String state
  320. timed_transitions = create_node()
  321. states = set_copy(data["classes"][class]["states"])
  322. // Collect all timed transitions that are currently active
  323. while (read_nr_out(states) > 0):
  324. state = set_pop(states)
  325. // NOTE this set_merge does not eliminate duplicates, though this should happen later on when adding the timer (see other NOTE)
  326. set_merge(timed_transitions, filter_exists(model, allOutgoingAssociationInstances(model, state, "SCCD/transition"), "after"))
  327. // Remove timers that no longer exist
  328. old_timed_transitions = dict_keys(data["classes"][class]["timers"])
  329. while (read_nr_out(old_timed_transitions) > 0):
  330. transition = set_pop(old_timed_transitions)
  331. if (bool_not(set_in(timed_transitions, transition))):
  332. // Transition is no longer scheduled for any state, so remove
  333. dict_delete(data["classes"][class]["timers"], transition)
  334. // Schedule timers that are not already scheduled
  335. while (read_nr_out(timed_transitions) > 0):
  336. transition = set_pop(timed_transitions)
  337. // NOTE Normally, a timer will not be added twice here, as the previous occurence will already find it
  338. if (bool_not(dict_in(data["classes"][class]["timers"], transition))):
  339. // Not yet scheduled this transition: do so now
  340. Element after
  341. Float after_duration
  342. after = read_attribute(model, transition, "after")
  343. after = get_func_AL_model(import_node(after))
  344. after_duration = after(data["classes"][class]["attributes"])
  345. dict_add(data["classes"][class]["timers"], transition, float_addition(data["start_time"], after_duration))
  346. return !
  347. String function get_parent(model : Element, state : String):
  348. Element tmp_set
  349. tmp_set = allAssociationOrigins(model, state, "SCCD/composite_children")
  350. set_merge(tmp_set, allAssociationOrigins(model, state, "SCCD/parallel_children"))
  351. if (read_nr_out(tmp_set) > 0):
  352. return set_pop(tmp_set)!
  353. else:
  354. return ""!
  355. Element function find_hierarchy(model : Element, state : String):
  356. if (state == ""):
  357. return create_node()!
  358. else:
  359. Element result
  360. String parent
  361. parent = get_parent(model, state)
  362. // We have a parent, so take the parent list first
  363. result = find_hierarchy(model, parent)
  364. list_append(result, state)
  365. return result!
  366. Element function get_actions_to_execute(model : Element, source_states : Element, target_states : Element):
  367. Element result
  368. result = create_node()
  369. source_states = set_copy(source_states)
  370. target_states = set_copy(target_states)
  371. // Add all exit and entry actions to the list of actions to execute
  372. // 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
  373. // First, find the hierarchy!
  374. Element hierarchy_sources
  375. Element hierarchy_targets
  376. Element all_hierarchies
  377. hierarchy_sources = create_node()
  378. while (read_nr_out(source_states) > 0):
  379. set_add(hierarchy_sources, find_hierarchy(model, set_pop(source_states)))
  380. hierarchy_targets = create_node()
  381. while (read_nr_out(target_states) > 0):
  382. set_add(hierarchy_targets, find_hierarchy(model, set_pop(target_states)))
  383. all_hierarchies = set_copy(hierarchy_sources)
  384. set_merge(all_hierarchies, hierarchy_targets)
  385. // Difference these all lists, finding the first common entry
  386. Element iter_hierarchies
  387. Integer i
  388. String current
  389. Element hierarchy
  390. Boolean finished
  391. i = 0
  392. finished = False
  393. while (bool_not(finished)):
  394. // Check the i-th element in both and see if they are equal
  395. current = ""
  396. iter_hierarchies = set_copy(all_hierarchies)
  397. while (read_nr_out(iter_hierarchies) > 0):
  398. hierarchy = set_pop(iter_hierarchies)
  399. // Exhausted one of the lists
  400. if (i >= list_len(hierarchy)):
  401. finished = True
  402. break!
  403. // First entry, so read out value as reference
  404. if (current == ""):
  405. current = list_read(hierarchy, i)
  406. // Check with reference element
  407. if (bool_not(value_eq(list_read(hierarchy, i), current))):
  408. finished = True
  409. break!
  410. // i-th element equal for all hierarchies, so go to next element
  411. if (bool_not(finished)):
  412. i = i + 1
  413. // Found the first differing element at position i
  414. // All elements remaining in hierarchy_source are to be traversed in REVERSE order for the exit actions
  415. // All elements remaining in hierarchy_target are to be traversed in NORMAL order for the entry actions
  416. // This is not that simple either, as we need to consider that some actions might already have been added to the list...
  417. // Add hierarchy_sources actions
  418. String state
  419. Element visited
  420. Element action
  421. Element spliced_hierarchy
  422. Element hierarchy_source
  423. Element hierarchy_target
  424. visited = create_node()
  425. while (read_nr_out(hierarchy_sources) > 0):
  426. // Get one of these hierarchies
  427. hierarchy_source = set_pop(hierarchy_sources)
  428. spliced_hierarchy = list_splice(hierarchy_source, i, list_len(hierarchy_source))
  429. while (list_len(spliced_hierarchy) > 0):
  430. state = list_pop(spliced_hierarchy, list_len(spliced_hierarchy) - 1)
  431. if (set_in(visited, state)):
  432. // Already added this state, so don't bother
  433. continue!
  434. else:
  435. // New state, so prepend it to the list
  436. // Prepend, instead of append, as we want to do these operations in reverse order!
  437. // First check if there is any exit action at all
  438. action = read_attribute(model, state, "onExitScript")
  439. if (element_neq(action, read_root())):
  440. // An exit action is found!
  441. list_insert(result, get_func_AL_model(import_node(action)), 0)
  442. // Add this state as visited, even though there might not have been an associated action
  443. set_add(visited, state)
  444. // Add hierarchy_targets actions
  445. // Clear visited, just to be safe, though it should not matter
  446. visited = create_node()
  447. while (read_nr_out(hierarchy_targets) > 0):
  448. // Get one of these hierarchies
  449. hierarchy_target = set_pop(hierarchy_targets)
  450. spliced_hierarchy = list_splice(hierarchy_target, i, list_len(hierarchy_target))
  451. while (list_len(spliced_hierarchy) > 0):
  452. state = list_pop(spliced_hierarchy, list_len(spliced_hierarchy) - 1)
  453. if (set_in(visited, state)):
  454. // Already added this state, so don't bother
  455. continue!
  456. else:
  457. // New state, so append it to the list
  458. // Append, instead of prepend, as we want to do these operations in normal order!
  459. // First check if there is any entry action at all
  460. action = read_attribute(model, state, "onEntryScript")
  461. if (element_neq(action, read_root())):
  462. // An entry action is found!
  463. list_append(result, get_func_AL_model(import_node(action)))
  464. // Add this state as visited, even though there might not have been an associated action
  465. set_add(visited, state)
  466. return result!
  467. Float function step(model : Element, data : Element):
  468. // Step through all classes
  469. Element classes
  470. Element class
  471. Float t_min
  472. Float t_current
  473. Boolean transitioned
  474. Element keys
  475. String key
  476. t_min = time() + 99999.0
  477. classes = dict_keys(data["classes"])
  478. // TODO this should use simulated time or something
  479. dict_overwrite(data, "start_time", time())
  480. transitioned = False
  481. while (read_nr_out(classes) > 0):
  482. class = set_pop(classes)
  483. if (step_class(model, data, class)):
  484. transitioned = True
  485. if (bool_not(transitioned)):
  486. // Find minimum timer for this class, and store that
  487. keys = dict_keys(data["classes"][class]["timers"])
  488. while (read_nr_out(keys) > 0):
  489. key = set_pop(keys)
  490. t_current = data["classes"][class]["timers"][key]
  491. if (t_current < t_min):
  492. t_min = t_current
  493. if (transitioned):
  494. // Do another step, as we can transition
  495. return 0.0!
  496. else:
  497. return float_subtraction(t_min, data["start_time"])!
  498. Boolean function main(model : Element):
  499. // Executes the provided SCCD model
  500. Element data
  501. data = create_node()
  502. dict_add(data, "classes", create_node())
  503. // Prepare for input
  504. output("Ready for input!")
  505. // Find initial
  506. String default_class
  507. default_class = set_pop(filter(model, allInstances(model, "SCCD/Class"), "default", True))
  508. // Start up the default class
  509. start_class(model, data, default_class, "main", create_node())
  510. Float timeout
  511. Element interrupt
  512. timeout = 0.0
  513. while (True):
  514. print_states(model, data)
  515. interrupt = input_timeout(timeout)
  516. if (value_eq(interrupt, "#EXIT#")):
  517. // Stop execution
  518. return True!
  519. dict_overwrite(data, "events", create_node())
  520. if (element_neq(interrupt, read_root())):
  521. // Got interrupt
  522. log("Got event: " + cast_v2s(interrupt))
  523. set_add(data["events"], create_tuple(interrupt, read_root()))
  524. output("Processed event, ready for more!")
  525. timeout = step(model, data)
  526. log("Pausing for " + cast_v2s(timeout))
  527. // We should never get here!
  528. return False!