[bibshow file=tech.bib]Probably my last presentation at TU/e: simple, general, and fast Declare mining. Much of this is in [bibcite key=megaminertech,megaminerfase] (not online yet at the time of writing). [/bibshow] MichaelTime person of the year 2006, Nobel Peace Prize winner 2012. westergaard.eu/ […]
Q: What is this? A: It’s a Declare model atop a cup of tea. It’s a Model T. Ba-dum-tsch! […]
ProM has had support for Declare for quite some time. Support has never been the best, because the Declare package just embedded all of the Declare tool inside ProM, which is of course not desirable. The old data-structure had some problems, mostly that it was written for a different purpose, which made it have dependencies […]
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 […]
CPN Tools 4 merges the colored Petri net language with the Declare language. Declare was previously supported in its own tool, also named Declare. Everything herein can be done with CPN Tools pre-releases starting from 3.9.2; get your copy here. In colored Petri nets, the control flow is either dependent on data or on explicit […]
Here I demonstrate simple editing of Declare in CPN Tools 4; we notice that enabling is updated as I simulate and alter the constraints. For a full description of the facility, refer to https://westergaard.eu/2013/08/cpn-tools-4-declare-constraints/ MichaelTime person of the year 2006, Nobel Peace Prize winner 2012. westergaard.eu/ […]