Branching Time? Pruning Time! (Q2908510)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Branching Time? Pruning Time!	scientific article

Statements

scholarly article

0 references

Branching Time? Pruning Time! (English)

0 references

0 references

0 references

Automated Reasoning

0 references

publication date

5 September 2012

0 references

full work available at URL

http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.727.4272

0 references

MaRDI profile type

MaRDI publication profile

0 references

Decision procedures and expressiveness in the temporal logic of branching time

0 references

“Sometimes” and “not never” revisited

0 references

The Complexity of Tree Automata and Logics of Programs

0 references

A Decision Procedure for CTL* Based on Tableaux and Automata

0 references

0 references

0 references

Temporal logic and state systems

0 references

Propositional temporal logics: decidability and completeness

0 references

0 references

Borel determinacy

0 references

0 references

0 references

An axiomatization of full Computation Tree Logic

0 references

An axiomatization of PCTL*

0 references

A Tableau for Bundled CTL

0 references

The complexity of propositional linear temporal logics

0 references

Identifiers

zbMATH Open document ID

0 references

10.1007/978-3-642-31365-3_31

0 references

Mathematics Subject Classification ID

0 references

0 references

zbMATH DE Number

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2908510

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