Abstract
A possibilistic Petri nets model (PPN) is proposed to imitate possibilistic reasoning. A possibilistic token carries information to describe an object and its corresponding possibility and necessity measures. Possibilistic transitions are classified into four types: inference transitions perform possibilistic reasoning; duplication transitions duplicate a possibilistic token to several tokens representing the same proposition and possibility and necessity measures; aggregation transitions combine several possibilistic tokens with the same classical proposition; and aggregation-duplication transitions combine aggregation transitions and duplication transitions.
Original language | English |
---|---|
Pages | 1517-1522 |
Number of pages | 6 |
State | Published - 2001 |
Event | Joint 9th IFSA World Congress and 20th NAFIPS International Conference - Vancouver, BC, Canada Duration: 25 Jul 2001 → 28 Jul 2001 |
Conference
Conference | Joint 9th IFSA World Congress and 20th NAFIPS International Conference |
---|---|
Country/Territory | Canada |
City | Vancouver, BC |
Period | 25/07/01 → 28/07/01 |
Keywords
- High-level Petri nets
- Possibilistic entailment
- Possibilistic reasoning