Model checking in the modal \(\mu \)-calculus and generic solutions

DOI10.1016/j.jsc.2010.10.008zbMath1211.68249OpenAlexW2091224237MaRDI QIDQ633088

Juan-Miguel Gracia

Publication date: 31 March 2011

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jsc.2010.10.008

zbMATH Keywords

algorithmsGröbner basesconcurrencyprogramming calculi

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (1)

Solving Łukasiewicz \(\mu\)-terms

Uses Software

• PolyBoRi

Cites Work

• Results on the propositional \(\mu\)-calculus
• Polybori: A framework for Gröbner-basis computations with Boolean polynomials
• On the intrinsic complexity of elimination theory
• Ein algorithmisches Kriterium für die Lösbarkeit eines algebraischen Gleichungssystems
• The Complexity of Enumeration and Reliability Problems
• Counting and Gröbner bases
• On model checking for the \(\mu\)-calculus and its fragments
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Model checking in the modal \(\mu \)-calculus and generic solutions