Jump to content

Transition constraint

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by 2601:581:302:fb9b:61d9:b2c1:560a:e815 (talk) at 00:35, 11 June 2017 (satisfactorily generalized an inane remark). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

A transition constraint is a way of enforcing that the data does not enter an impossible state because of a previous state. For example, it should not be possible for a person to change from being "married" to being "single, never married". The only valid states after "married" might be "divorced", "widowed", or "deceased".

Transition constraint is commonly used in formal models in computer security.

References