Back to Results
First PageMeta Content
Mathematics / Μ operator / Symbol / Well-formed formula / Boolean satisfiability problem / Model theory / Linear temporal logic / Theoretical computer science / Logic / Metalogic


The Journal of Symbolic Logic Volume 00, Number 0, XXX 0000 PDL WITH INTERSECTION AND CONVERSE: SATISFIABILITY AND INFINITE-STATE MODEL CHECKING
Add to Reading List

Document Date: 2008-01-18 08:51:04


Open Document

File Size: 391,13 KB

Share Result on Facebook

Currency

pence / USD / /

IndustryTerm

infinite state systems / prefix-recognizable systems / non-elementary algorithm / pushdown systems / finite-state systems / infinite-state systems / model checking infinite-state systems / /

OperatingSystem

Xp / /

Organization

European Union / Association for Symbolic Logic / /

Person

CARSTEN LUTZ / STEFAN GOLLER / MARKUS LOHREY / /

Position

author / MODEL / second author / /

ProgrammingLanguage

C / XML / K / /

Technology

XML / dom / simulation / non-elementary algorithm / /

SocialTag