We focus on well-behaved Adaptive Hypermedia Systems, which means the adaptation engine that executes adaptation rules always terminates and produces predictable (confluent) adaptation results. Unfortunately termination and confluence are undecidable in general. In this paper we discuss sufficient conditions to help authors to write adaptation rules that satisfy termination and confluence.