Marc Gillé

Learn More
A graph G = (V, E) can be described by the characteristic function of the edge set χ E which maps a pair of binary encoded nodes to 1 iff the nodes are adjacent. Using Ordered Binary Decision Diagrams (OBDDs) to store χ E can lead to a (hopefully) compact representation. Given the OBDD as an input, symbolic/implicit OBDD-based graph algorithms can solve(More)
Workflow management systems have come a long way from the first office automation prototypes of the late 1970s. Today, workflow systems are deployed in a variety of situations, ranging from the coordination of document-centric processes in office environments to the automation of application data flow in enterprise application integration scenarios. The(More)
  • 1