From complementation to certification (Q2575735)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	From complementation to certification	scientific article

Statements

scholarly article

0 references

From complementation to certification (English)

0 references

0 references

0 references

Theoretical Computer Science

0 references

publication date

6 December 2005

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1016/j.tcs.2005.07.021

0 references

An algorithm for strongly connected component analysis in \(n \log n\) symbolic steps

0 references

0 references

Symbolic model checking: \(10^{20}\) states and beyond

0 references

Theories of automata on \(\omega\)-tapes: a simplified approach

0 references

0 references

0 references

Correct Hardware Design and Verification Methods

0 references

A new heuristic for bad cycle detection using BDDs

0 references

Weak alternating automata are not that weak

0 references

Model checking of safety properties

0 references

The complexity of verification

0 references

0 references

Synthesis of Communicating Processes from Temporal Logic Specifications

0 references

Alternating finite automata on \(\omega\)-words

0 references

0 references

0 references

0 references

Safety, liveness and fairness in temporal logic

0 references

The complementation problem for Büchi automata with applications to temporal logic

0 references

0 references

Reasoning about infinite computations

0 references

Temporal logic can be more expressive

0 references

Identifiers

zbMATH Open document ID

0 references

10.1016/j.tcs.2005.07.021

0 references

Mathematics Subject Classification ID

0 references

0 references

zbMATH DE Number

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2575735

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