Verification of time-bounded multiset rewriting properties

DOI10.1016/J.JLAMP.2026.101124MaRDI QIDQ7268686zbMATH OpenFDO

Authors Tajana Ban Kirigin, Jesse Comer, Max Kanovich, Andre Scedrov, Carolyn Talcott

Publication date 18 June 2026

Published in Journal of Logical and Algebraic Methods in Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.JLAMP.2026.101124

zbMATH Keywords

computational complexityMaudemultiset rewritingresilience

Mathematics Subject Classification ID

Computer science (68-XX)

Cites work

• A rewriting framework and logic for activities subject to regulations
• All about Maude -- a high-performance logical framework. How to specify, program and verify systems in rewriting logic. With CD-ROM.
• An STL-based formulation of resilience in cyber-physical systems
• Collaborative planning with confidentiality
• Complexity of matching problems
• Conditional rewriting logic as a unified model of concurrency
• Fault-tolerant systems
• scientific article; zbMATH DE number 3999312 (Why is no real title available?)
• scientific article; zbMATH DE number 2112984 (Why is no real title available?)
• On the complexity of verification of time-sensitive distributed systems
• On the formalization and computational complexity of resilience problems for cyber-physical systems
• Proving the Correctness of Multiprocess Programs
• Resilience of Timed Systems
• Resilient dynamic programming
• Rewriting logic and its applications. 15th international workshop, WRLA 2024, Luxembourg City, Luxembourg, April 6--7, 2024. Revised selected papers
• Semantics and pragmatics of real-time maude
• The complexity of facets resolved
• The polynomial-time hierarchy
• Timed Multiset Rewriting and the Verification of Time-Sensitive Distributed Systems

This page was built for publication: Verification of time-bounded multiset rewriting properties

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