Processes and Structured Transition Rules for Case-Based Reasoning

Abstract 1994) so less successful cases are a large part of the Traditional notations of processes are oftenbased on not a-tions that are formalized with different types of automata and a suitable domain specific (graphical) notation. These notations allow elaborate analysis of the processes such as proving equivalence between processes. They are also effi-cient in capturing exact behavior, but are sometimes e- rgarded as difficult to use by users less familiar with formal notations and do not always promote easy reuse and step-wise refinement. A notation for processes using transition rules and catego-rization of formulae in transition rules is exemplified and proposed for applications domains such as business proc-esses, system development processes etc. Transition rules enable users to successively refine the processes and also enable similarity measurements and reuse in a Case-Based Reasoning approach. Transition rules in the proposal handle also time, important for some features. Using formalized transition rules also gives access to logical based tools (veri-fication, simulations).