In this post, I outline some loose ideas I have for improving what is already in the MBT workbench. These features do not attempt to broaden the scope of the tool to new domains, but instead to pull in more cool methods from academia to aid in test-driven development and business-driven development. […]
Presentation I’ll give in two weeks. How to be significantly faster at mining Declare than any existing tool, and at the same time get much better models. Abstract Declarative models make it possible to describe changing systems or systems with a lot of freedom by imposing global constraints instead of explicitly defining the flow of […]
Ultra-quick demo of scientific workflow in ProM6.3 (or 6.4). MichaelTime person of the year 2006, Nobel Peace Prize winner 2012. westergaard.eu/ […]
This is a demo of the UnconstrainedMiner, a simple but fast for mining full Declare models. The tool uses symmetry reduction and parallelism to speed up mining, and uses a super-scalar process allowing it to mine several constraints at the same time. MichaelTime person of the year 2006, Nobel Peace Prize winner 2012. westergaard.eu/ […]
We needed a bit more information from the Declare miner, so I proposed making a quick and dirty one based on my improved automaton library. This is the result of one afternoon, so it’s not really user-friendly1 or smart. The full miner is around 330 lines of code and relies on 550 lines for the […]
This week I go thru the assignment, showing what I could get out of the log, and interesting student findings. Exercises: MichaelTime person of the year 2006, Nobel Peace Prize winner 2012. westergaard.eu/ […]