2007 IEEE International Conference on Systems, Man and Cybernetics 2007
DOI: 10.1109/icsmc.2007.4414028
|View full text |Cite
|
Sign up to set email alerts
|

Verification of active rule base via conditional colored Petri nets

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2008
2008
2021
2021

Publication Types

Select...
2
1
1

Relationship

0
4

Authors

Journals

citations
Cited by 4 publications
(2 citation statements)
references
References 15 publications
0
2
0
Order By: Relevance
“…Verification concerns the correctness and appropriateness of the structure of a rule base, and must be an essential part of the whole system development. In our previous works [2] - [5], we have tackled active rule base verification issues.…”
Section: Rule Base Developmentmentioning
confidence: 99%
“…Verification concerns the correctness and appropriateness of the structure of a rule base, and must be an essential part of the whole system development. In our previous works [2] - [5], we have tackled active rule base verification issues.…”
Section: Rule Base Developmentmentioning
confidence: 99%
“…Baralis (1999) proposed a technique, based on relational algebra, to check if active rules are terminated or confluent. Other results Choi et al (2006b); Chavarría-Báez and Li (2007) addressed both termination and confluence properties using model checking techniques. One important property that has not received much attention is data constraint property of a system.…”
Section: Introductionmentioning
confidence: 99%