diff options
| author | Stefan Radomski <github@mintwerk.de> | 2017-07-05 12:16:39 (GMT) |
|---|---|---|
| committer | Stefan Radomski <github@mintwerk.de> | 2017-07-05 12:16:39 (GMT) |
| commit | 334db5e55b1012feb5fdbd7f985774a0e92fea3b (patch) | |
| tree | e6b1d35c48d4485a137d014ab2c7bd9a26a68dbf | |
| parent | d7bc661db02b2323aeb5cdf435a2138b04484dd1 (diff) | |
| download | uscxml-334db5e55b1012feb5fdbd7f985774a0e92fea3b.zip uscxml-334db5e55b1012feb5fdbd7f985774a0e92fea3b.tar.gz uscxml-334db5e55b1012feb5fdbd7f985774a0e92fea3b.tar.bz2 | |
Cleaned up
| -rw-r--r-- | README.md | 2 |
1 files changed, 1 insertions, 1 deletions
@@ -107,7 +107,7 @@ When exiting a state via a transition, the least-common compound ancestor (LCCA) uSCXML with either microstep implementation is consistently the fastest with the exception of the Transitions benchmark, where the compiled `scxmlcc` is degenerating slower for more complex state-charts. This may be due to compiler optimizations (or an incomplete implementation) and it would be interesting to compare `scxmlcc` against the transpiled ANSI-C code from `uscxml-transform`. However, the limiting factor here becomes the time required to transpile the state-chart or to compile the generated source file into an executable binary respectively. With regard to huge state-charts, the large microstep implementation of `uSCXML` performs best and retains acceptable performance throughout the range of benchmarks, only surpassed by the fast implementation for smaller complexities. -# Changes {#changes} +## Changes * **[bfefa5fd44b9ed1491612f26b099db8ad624247b](https://github.com/tklab-tud/uscxml/pull/155/commits/bfefa5fd44b9ed1491612f26b099db8ad624247b):** |