|
semantics
|
00becf8a0d
Re-implemented priority semantics: Based on priority semantics, a directed graph of orderings between transitions is explicitly built, checked for cycles, and from it, a total ordering of transitions is constructed. Transitions between whom no ordering exists are only allowed if they cannot be simultaneously enabled wrt their source states. It is now possible to switch off explicit ordering of orthogonal regions and explicit ordering of transitions with the same source state (but it's ON by default :)
|
5 vuotta sitten |
Joeri Exelmans
00becf8a0d
Re-implemented priority semantics: Based on priority semantics, a directed graph of orderings between transitions is explicitly built, checked for cycles, and from it, a total ordering of transitions is constructed. Transitions between whom no ordering exists are only allowed if they cannot be simultaneously enabled wrt their source states. It is now possible to switch off explicit ordering of orthogonal regions and explicit ordering of transitions with the same source state (but it's ON by default :)