And here’s the demo I gave on the demo slide: MichaelTime person of the year 2006, Nobel Peace Prize winner 2012. westergaard.eu/ […]
Read More… from Access/CPN 2.0 — A High-level Interface to Coloured Petri Net Models
MichaelTime person of the year 2006, Nobel Peace Prize winner 2012. westergaard.eu/ […]
Read More… from Towards Verifying Parallel Algorithms using Coloured Petri Nets
MichaelTime person of the year 2006, Nobel Peace Prize winner 2012. westergaard.eu/ […]
Read More… from Efficient Implementation of Prioritized Transitions for High-level Petri Nets
I think it would be neat to view a trace as a message sequence chart with the processes being resources and messages events. Mockup: Aside from being useful in and of itself, it could also be used with the KeyValue plug-in to generate MSCs of CPN model executions. Which would be neat. A further perspective […]
Read More… from ProM Plug-in Suggestion: Social Network MSC Visualization
I’ve been looking a bit at log representations in ProM. We are using the XES standard and the OpenXES implementation. This was prompted by me wondering why ProM was so slow at handling logs. Many of the things ProM did with logs, I could replicate in a short time (i.e., less than an hour) in […]
Now, this is a manly classpath… Edit: That’s, like, so one hour ago. Now, I’m using this bad boy: MichaelTime person of the year 2006, Nobel Peace Prize winner 2012. westergaard.eu/ […]