Structural Error Verification in Active Rule-Based Systems using Petri Nets

Chavarría-Báez, Lorena; Li, Xiaoou

doi:10.1109/micai.2006.44

Cited by 6 publications

(3 citation statements)

References 13 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Petri Nets. Tight relations between rule-based systems and Petri Nets are well-known e.g., [202,49,138]. Petri Nets are used to verify properties of rule-based systems such as inconsistency, redundancy and circularity rules.…”

Section: Knowlegde Representationmentioning

confidence: 99%

The Horn Non-Clausal Class and its Polynomiality

Imaz¹

2021

Preprint

View full text Add to dashboard Cite

The expressiveness of propositional non-clausal (NC) formulas is exponentially richer than that of clausal formulas. Yet, clausal efficiency outperforms non-clausal one. Indeed, a major weakness of the latter is that, while Horn clausal formulas, along with Horn algorithms, are crucial for the high efficiency of clausal reasoning, no Horn-like formulas in non-clausal form had been proposed.To overcome such weakness, we define the hybrid class H NC of Horn Non-Clausal (Horn-NC) formulas, by adequately lifting the Horn pattern to NC form, and argue that H NC , along with future Horn-NC algorithms, shall increase non-clausal efficiency just as the Horn class has increased clausal efficiency.Secondly, we: (i) give the compact, inductive definition of H NC ; (ii) prove that syntactically H NC subsumes the Horn class but semantically both classes are equivalent, and (iii) characterize the non-clausal formulas belonging to H NC .Thirdly, we define the Non-Clausal Unit-Resolution calculus, UR NC , and prove that it checks the satisfiability of H NC in polynomial time. This fact, to our knowledge, makes H NC the first characterized polynomial class in NC reasoning.Finally, we prove that H NC is linearly recognizable, and also that it is both strictly succincter and exponentially richer than the Horn class.We discuss that in NC automated reasoning, e.g. satisfiability solving, theorem proving, logic programming, etc., can directly benefit from H NC and UR NC and that, as a by-product of its proved properties, H NC arises as a new alternative to analyze Horn functions and implication systems.

show abstract

Section: Knowlegde Representationmentioning

confidence: 99%

The Horn Non-Clausal Class and its Polynomiality

Imaz¹

2021

Preprint

View full text Add to dashboard Cite

show abstract

“…The areas of its applications include discrete-event systems [13]- [15], flexible manufacturing systems [16]- [19], fault-tolerant systems [20] [21], data-flow computing systems [22] [23], and concurrent control systems [24] [25]. It can not only describe the behavior of a system but also verify its correctness [26]. The vitality of scientific theory lies in its application.…”

Section: Introductionmentioning

confidence: 99%

A State-Equation-Based Method to Non-Reachability Analysis of Ordinary Petri Nets With Token-Free Circuit-Based Subnets

2022

IEEE Access

View full text Add to dashboard Cite

Petri nets (PNs) can model various event-driven systems well and detect a fault via reachability analysis. Some state-equation-based approaches are designed for only subclasses of PNs with specific structures. A key issue for PNs' reachability analysis approach based on state equation is that a non-negative integer solution (NIS) to a state equation is necessary but not sufficient for a marking's reachability. In this paper, we propose a circuit-based subnet. For ordinary Petri nets with token-free circuit-based subnets, we present an algorithm to determine that the state equation has NISs but the marking is non-reachable. We adopt a divide-and-conquer strategy to consider each circuit-based subnet. The proposed method is tested on a PN-based flexible manufacturing system with unreliable resources. When unreliable resources are lost, the non-reachable markings can be determined effectively. Besides, simulations are done, and the results verify the efficiency of the proposed algorithm compared with the reachability-tree-based method.

show abstract

“…Active systems are able to respond automatically to events that are taking place either inside or outside the system itself. The central part of those systems is a set of active rules which codifies the knowledge of domain experts [6]. Active rules constantly monitor systems and user activities.…”

Section: Introductionmentioning

confidence: 99%

An Active System for Dynamic Vertical Partitioning of Relational Databases

Rodríguez

Mejía-Álvarez

2011

Advances in Soft Computing

Self Cite

View full text Add to dashboard Cite

Vertical partitioning is a well known technique to improve query response time in relational databases. This consists in dividing a table into a set of fragments of attributes according to the queries run against the table. In dynamic systems the queries tend to change with time, so it is needed a dynamic vertical partitioning technique which adapts the fragments according to the changes in query patterns in order to avoid long query response time. In this paper, we propose an active system for dynamic vertical partitioning of relational databases, called DYVEP (DYnamic VErtical Partitioning). DYVEP uses active rules to vertically fragment and refragment a database without intervention of a database administrator (DBA), maintaining an acceptable query response time even when the query patterns in the database suffer changes. Experiments with the TPC-H benchmark demonstrate efficient query response time.

show abstract

Structural Error Verification in Active Rule-Based Systems using Petri Nets

Cited by 6 publications

References 13 publications

The Horn Non-Clausal Class and its Polynomiality

The Horn Non-Clausal Class and its Polynomiality

A State-Equation-Based Method to Non-Reachability Analysis of Ordinary Petri Nets With Token-Free Circuit-Based Subnets

An Active System for Dynamic Vertical Partitioning of Relational Databases

Contact Info

Product

Resources

About