Symbolic Termination and Confluence Checking for ECA Rules

DOI10.1007/978-3-662-45730-6_6zbMath1428.68201OpenAlexW61183124MaRDI QIDQ3452476

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

verificationconfluenceterminationECA rules

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)

Cites Work

• Ten Years of Saturation: A Petri Net Perspective
• Symbolic CTL Model Checking of Asynchronous Systems Using Constrained Saturation
• Graph-Based Algorithms for Boolean Function Manipulation
• AI 2003: Advances in Artificial Intelligence
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Symbolic Termination and Confluence Checking for ECA Rules