More Precise Partition Abstractions (Q5452605)

From MaRDI portal

Jump to:navigation, search

scientific article; zbMATH DE number 5259433

Language	Label	Description	Also known as
English	More Precise Partition Abstractions	scientific article; zbMATH DE number 5259433

Statements

scholarly article

0 references

More Precise Partition Abstractions (English)

0 references

0 references

0 references

Lecture Notes in Computer Science

0 references

publication date

4 April 2008

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/978-3-540-69738-1_12

0 references

0 references

0 references

Verification, Model Checking, and Abstract Interpretation

0 references

Ranked Predicate Abstraction for Branching Time: Complete, Incremental, and Precise

0 references

Deciding the winner in parity games is in \(\mathrm{UP}\cap\mathrm{co-UP}\)

0 references

Results on the propositional \(\mu\)-calculus

0 references

SPECIFICATION AND VERIFICATION OF CONURRENT SYSTEMS IN CESAR

0 references

Tools and Algorithms for the Construction and Analysis of Systems

0 references

Alternating tree automata, parity games, and modal \(\mu\)-calculus

0 references

Identifiers

zbMATH Open document ID

0 references

10.1007/978-3-540-69738-1_12

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

zbMATH DE Number

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:5452605

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q5452605&oldid=35048633"