You are required to read and agree to the below before accessing a full-text version of an article in the IDE article repository.

The full-text document you are about to access is subject to national and international copyright laws. In most cases (but not necessarily all) the consequence is that personal use is allowed given that the copyright owner is duly acknowledged and respected. All other use (typically) require an explicit permission (often in writing) by the copyright owner.

For the reports in this repository we specifically note that

  • the use of articles under IEEE copyright is governed by the IEEE copyright policy (available at http://www.ieee.org/web/publications/rights/copyrightpolicy.html)
  • the use of articles under ACM copyright is governed by the ACM copyright policy (available at http://www.acm.org/pubs/copyright_policy/)
  • technical reports and other articles issued by M‰lardalen University is free for personal use. For other use, the explicit consent of the authors is required
  • in other cases, please contact the copyright owner for detailed information

By accepting I agree to acknowledge and respect the rights of the copyright owner of the document I am about to access.

If you are in doubt, feel free to contact webmaster@ide.mdh.se

Processes and Structured Transition Rules for Case-Based Reasoning

Authors:

Peter Funk

Publication Type:

Conference/Workshop Paper

Venue:

Workshop on Case-Based Reasoning Approaches for Process-Oriented Knowledge Management, ICCBR’2001

Publisher:

Technical Report of the Navy Center for Applied Research in Artificial Intelligence (NCARAI)

Abstract

Traditional notations of processes are often based on nota-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 re-garded 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).

Bibtex

@inproceedings{Funk270,
author = {Peter Funk},
title = {Processes and Structured Transition Rules for Case-Based Reasoning},
editor = {Fenstermacher K., Tautz C.},
month = {July},
year = {2001},
booktitle = {Workshop on Case-Based Reasoning Approaches for Process-Oriented Knowledge Management, ICCBR’2001},
publisher = {Technical Report of the Navy Center for Applied Research in Artificial Intelligence (NCARAI)},
url = {http://www.es.mdu.se/publications/270-}
}