The Temporal Logic of Rewriting: A Gentle Introduction
From MaRDI portal
Recommendations
Cited in
(21)- Compositional specification in rewriting logic
- Twenty years of rewriting logic
- ACTLW -- an action-based computation tree logic with unless operator
- A simple rewrite system for the normalization of linear temporal logic
- Qualitative and quantitative monitoring of spatio-temporal properties with SSTL
- TAGED Approximations for Temporal Properties Model-Checking
- A rewriting-based model checker for the linear temporal logic of rewriting
- Analysis of spatio-temporal properties of stochastic systems using TSTL
- Strategies, model checking and branching-time properties in Maude
- Infinite-state model checking of LTLR formulas using narrowing
- Algebraic simulations
- Programming and symbolic computation in Maude
- Egalitarian State-Transition Systems
- Writing out Unifiers in Linear Temporal Logic
- Comparing three coordination models: Reo, ARC, and PBRD
- scientific article; zbMATH DE number 1755151 (Why is no real title available?)
- Two Decades of Maude
- Rewrite rules for \(\mathrm{CTL}^\ast\)
- A Spatial Logic for Simplicial Models
- Inspecting rewriting logic computations (in a parametric and stepwise way)
- From linear temporal logic properties to rewrite propositions
This page was built for publication: The Temporal Logic of Rewriting: A Gentle Introduction
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3507374)
