Symbolic termination and confluence checking for ECA rules

DOI10.1007/978-3-662-45730-6_6MaRDI QIDQ3452476zbMATH OpenOpenAlexFDO

Authors Yousra Lembachar, Gianfranco Ciardo, Xiao-Qing Jin

Publication date 12 November 2015

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-662-45730-6_6

zbMATH Keywords

confluenceECA rulesterminationverification

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• scientific article; zbMATH DE number 1863368
• scientific article; zbMATH DE number 1952106
• Fuzzy colored time Petri net and termination analysis for fuzzy event-condition-action rules
• scientific article; zbMATH DE number 2087719
• Refined rules termination analysis through transactions.

Cites work

• AI 2003: Advances in Artificial Intelligence
• Graph-Based Algorithms for Boolean Function Manipulation
• scientific article; zbMATH DE number 1701768 (Why is no real title available?)
• scientific article; zbMATH DE number 3750300 (Why is no real title available?)
• scientific article; zbMATH DE number 1304711 (Why is no real title available?)
• scientific article; zbMATH DE number 2016088 (Why is no real title available?)
• scientific article; zbMATH DE number 2087719 (Why is no real title available?)
• scientific article; zbMATH DE number 1863368 (Why is no real title available?)
• scientific article; zbMATH DE number 1423226 (Why is no real title available?)
• Symbolic CTL model checking of asynchronous systems using constrained saturation
• Ten years of saturation: a Petri net perspective

Cited in

(5)

• Event trace independence of active behavior
• scientific article; zbMATH DE number 1952106 (Why is no real title available?)
• scientific article; zbMATH DE number 1863368 (Why is no real title available?)
• A new approach to detecting active rule confluence with exclusive rules during an indeterminable rule process
• Embedding event algebras and process algebras in a framework for ECA rules for the semantic web

This page was built for publication: Symbolic termination and confluence checking for ECA rules

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3452476)