Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

16

CSL
2006
Springer

favoriteEmaildiscussreport

100views Automated Reasoning» more CSL 2006»

Infinite State Model-Checking of Propositional Dynamic Logics

13 years 4 months ago

Infinite State Model-Checking of Propositional Dynamic Logics

Download www.informatik.uni-leipzig.de

Model-checking problems for PDL (propositional dynamic logic) and its extension PDL (which includes the intersection operator on programs) over various classes of infinite state systems (BPP, BPA, pushdown systems, prefix-recognizable systems) are studied. Precise upper and lower bounds are shown for the data/expression/combined complexity of these model-checking problems.

Stefan Göller, Markus Lohrey

Real-time Traffic

Automated Reasoning | CSL 2006 | Extension Pdl | Infinite State Systems | Propositional Dynamic Logic |

claim paper

Related Content

» Combination Methods for Satisfiability and ModelChecking of InfiniteState Systems

» Lazy Theorem Proving for Bounded Model Checking over Infinite Domains

» Model Checking Quantified Computation Tree Logic

» Model checking propositional dynamic logic with all extras

» Model checking memoryful lineartime logics over onecounter automata

» Liveness Checking as Safety Checking for Infinite State Spaces

» Model Checking Procedures for Infinite State Systems

» The Tractability of ModelChecking for LTL The Good the Bad and the Ugly Fragments

» Fluent model checking for eventbased systems

Post Info
More Details (n/a)

Added	11 Dec 2010
Updated	11 Dec 2010
Type	Journal
Year	2006
Where	CSL
Authors	Stefan Göller, Markus Lohrey

Comments (0)