Egalitarian State-Transition Systems

DOI10.1007/978-3-319-44802-2_6zbMath1367.68198OpenAlexW2507585100WikidataQ123905815 ScholiaQ123905815MaRDI QIDQ2827838

Óscar Martín, Alberto Verdejo, Narciso Martí-Oliet

Publication date: 21 October 2016

Published in: Rewriting Logic and Its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-44802-2_6

zbMATH Keywords

strategymodel checkingtemporal logicrewriting logicLTSKripke structuremodular specificationstate/transition structure

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Grammars and rewriting systems (68Q42) Temporal logic (03B44)

Related Items (2)

Compositional Specification in Rewriting Logic ⋮ Egalitarian State-Transition Systems

Uses Software

• Maude

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Results on the propositional \(\mu\)-calculus
• Conditional rewriting logic as a unified model of concurrency
• Egalitarian State-Transition Systems
• Temporal logic can be more expressive
• The Temporal Logic of Rewriting: A Gentle Introduction
• “Sometimes” and “not never” revisited
• Algebraic laws for nondeterminism and concurrency
• Three logics for branching bisimulation
• The Linear Temporal Logic of Rewriting Maude Model Checker
• A Rewriting-Based Model Checker for the Linear Temporal Logic of Rewriting
• Model Checking TLR* Guarantee Formulas on Infinite Systems
• Symbolic Model Checking of Infinite-State Systems Using Narrowing
• Integrated Formal Methods

This page was built for publication: Egalitarian State-Transition Systems