Paper Titles

Refined Reachable Relationship Analysis for an Irreducible Active Rule Set

Abstract:

The existing method is deficient when characterizing the features of rules in a nonterminating rule set through the notion of reachability. To address this problem, this paper proposes a refined reachable relationship analysis based on two notions of triggering reachable and activation reachable. A counterexample and the detailed proof in this paper show that our method is effective.

You might also be interested in these eBooks

View Preview

Info:

Periodical:

Applied Mechanics and Materials (Volumes 263-266)

Pages:

1433-1437

DOI:

https://doi.org/10.4028/www.scientific.net/AMM.263-266.1433

Citation:

Cite this paper

Online since:

December 2012

Authors:

Zhong Min Xiong, Meng Lu Zhao, Dong Mei Huang, Shi Jun He

Keywords:

Active Behaviors, Active Databases, Database, Reachability, Rule Analysis

Export:

RIS, BibTeX

Price:

Permissions:

Request Permissions

Сopyright:

Citation:

References

[1] Essam Mansour and Hagen Höpfner, An approach to detecting relevant updates to cached data using XML and active databases, in: Proc. Int'l Conf. On Extended Database Technology (EDBT)(2009), p.791–802.

DOI: 10.1145/1516360.1516451

Google Scholar

[2] E. E. Almeida, J. E. Luntz, and D. M. Tilbury, Event-condition-action systems for reconfigurable logic control, IEEE Trans. Autom. Sci. Eng. 4 (2) (2007) , p.167–181.

DOI: 10.1109/tase.2006.880857

Google Scholar

[3] Bae Joonsoo, Bae Hyerim, Kang Suk-Ho and Kim Yeongho, Automatic Control of Workflow Processes Using ECA Rules, IEEE Transactions On Knowledge And Data Engineering 16 (8) (2004) , p.1010–1023.

DOI: 10.1109/tkde.2004.20

Google Scholar

[4] E.Baralis, S.Ceri and S.Paraboschi, Compile-Time and Runtime Analysis of Active Behaviors, IEEE Transactions on Knowledge and Data Engineering 10(3) (1998) , p.353– 370.

DOI: 10.1109/69.687973

Google Scholar