Model checking in the modal \(\mu \)-calculus and generic solutions
type: Item
instance of: scholarly article
title: Model checking in the modal \(\mu \)-calculus and generic solutions
zbMATH Open document ID: 1211.68249
author: Juan-Miguel Gracia
published in: Journal of Symbolic Computation
publication date: 2011-03-31T00:00:00Z
Mathematics Subject Classification ID: 68Q60
Mathematics Subject Classification ID: 68Q17
Mathematics Subject Classification ID: 68Q85
zbMATH DE Number: 5872534
zbMATH Keywords: algorithms
zbMATH Keywords: concurrency
zbMATH Keywords: programming calculi
zbMATH Keywords: Gröbner bases
describes a project that uses: PolyBoRi
MaRDI profile type: Publication
full work available at URL: j.jsc.2010.10.008
OpenAlex ID: W2091224237
cites work: Polybori: A framework for Gröbner-basis computations with Boolean polynomials
cites work: An algorithm for finding the basis elements of the residue class ring of a zero dimensional polynomial ideal
cites work: Ein algorithmisches Kriterium für die Lösbarkeit eines algebraischen Gleichungssystems
cites work: On model checking for the \(\mu\)-calculus and its fragments
cites work: On the intrinsic complexity of elimination theory
cites work: Counting and Gröbner bases
cites work: Results on the propositional \(\mu\)-calculus
cites work: Q2754084
cites work: Q3221403
cites work: Q4733387
cites work: The Complexity of Enumeration and Reliability Problems
DOI: 10.1016/J.JSC.2010.10.008
description: scientific article; zbMATH DE number 5872534