Shuffle Automat: A Formal Model for Behavior Recognition in Distributed

  • Authors:
  • Peter C. Bates

  • Affiliations:
  • -

  • Venue:
  • Shuffle Automat: A Formal Model for Behavior Recognition in Distributed
  • Year:
  • 1987

Quantified Score

Hi-index 0.00

Visualization

Abstract

`EVENT BASED BEHAVIOR ABSTRACTION'' IS A PARADIGM FOR DEBUGGING DISTRI- BUTED SYSTEMS WHICH FOCUSES ATTENTION ON COMPARING PATTERNS OF EXPECTED AND ACTUAL SYSTEM BEHAVIOR PATTERNS. RECOGNIZING PATTERNS OF BEHAVIOR IN COMPLEX DISTRIBUTED SYSTEMS FOR THE PURPOSES OF DEBUGGING IS A HARD TASK. THE `SHUFFLE AUTOMATA'' MODEL DESCRIBES A FORMALISM FOR RECOGNIZING BEHAV- IORS IN DISTRIBUTED SYSTEMS. THE `SIMPLE SHUFFLE AUTOMATA'' DEFINES THE BASIC OPERATIONAL CHARACTERISTICS OF SHUFFLE AUTOMATA MODEL. HOWEVER, SIMPLE SHUFFLE AUTOMATA ARE NOT CAPABLE OF SATISFYING ALL THE NEEDS OF AN EVENT BASED BEHAVIOR RECOGNIZER, SO MORE CAPABLE MEMBERS OF THE SHUFFLE AUTOMATA FAMILY ARE DEFINED. A COLLECTION OF SIMPLE SHUFFLE AUTOMATA FORMED AS A `BASIC SHUFFLE SYSTEM'' AND AUGMENTED WITH CONSTRAINTS BASED ON DYNAMIC PROPERTIES OF EVENT MODELS AS A `CONSTRAINED SHUFFLE SYSTEM'' WILL REPRESENT ALL EVENT MODELS DESCRIBED WITHIN THE EVENT BASED MODELLING SCHEME. THIS PAPER DEVELOPS THE SHUFFLE AUTOMATA FAMILY AND TIES IT TO EVENT BASED BEHAVIOR MODELLING.