An algebraic and algorithmic method for analysing transition systems

DOI10.1016/0304-3975(86)90034-4zbMath0617.68035OpenAlexW2075662707MaRDI QIDQ1822237

Anne Dicky

Publication date: 1986

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(86)90034-4

zbMATH Keywords

concurrent processesexpressive powertransition systemsmu-calculustemporal logicspower algebraseffectively computable functions

Mathematics Subject Classification ID

Logic in computer science (03B70) Abstract data types; algebraic specification (68Q65) Theory of operating systems (68N25)

Related Items (5)

Verification and comparison of transition systems ⋮ A linear algorithm to solve fixed-point equations on transition systems ⋮ An algebraic characterization of transition system equivalences ⋮ Nivat's processes and their synchronization ⋮ An even faster solver for general systems of equations

Cites Work

• Unnamed Item
• Results on the propositional \(\mu\)-calculus
• Fairness and related properties in transition systems - a temporal logic to deal with fairness
• Automatic verification of finite-state concurrent systems using temporal logic specifications

This page was built for publication: An algebraic and algorithmic method for analysing transition systems