Better Algorithms for Analyzing and Enacting Declarative Workflows using LTL

This is a presentation of the paper [bibtex file=conferences.bib key=improved-translation] i gave at BPM 2011.

Time person of the year 2006, Nobel Peace Prize winner 2012.

2 thoughts on “Better Algorithms for Analyzing and Enacting Declarative Workflows using LTL”

Twan says:

July 7, 2012 at 00:11

Your approach reminds me of the Karatsuba multiplication algorithm.

Reply
1. Michael says:
  
  July 10, 2012 at 12:42
  
  Heh, I never thought of it like that, though I agree there is a connection in the whole looking at a seemingly opaque problem and applying a trick to be able to use divide and conquer. It would be interesting to look into whether similar tricks used in Karatsuba multiplication could be used in automaton multiplication…
  
  Reply