Sciweavers

162 search results - page 1 / 33
» A note on an extension of PDL
Sort
View
JAPLL
2008
95views more  JAPLL 2008»
13 years 4 months ago
A note on an extension of PDL
Recently visibly pushdown automata have been extended to so called k-phase multistack visibly pushdown automata (k-MVPAs). On the occasion of introducing kMVPAs, it has been asked...
Stefan Göller, Dirk Nowotka
CSL
2006
Springer
13 years 5 months ago
Infinite State Model-Checking of Propositional Dynamic Logics
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 sy...
Stefan Göller, Markus Lohrey
FOSSACS
2006
Springer
13 years 8 months ago
Propositional Dynamic Logic with Recursive Programs
We extend the propositional dynamic logic PDL of Fischer and Ladner with a restricted kind of recursive programs using the formalism of visibly pushdown automata (Alur, Madhusudan...
Christof Löding, Olivier Serre
INFSOF
2002
126views more  INFSOF 2002»
13 years 4 months ago
Detection of dynamic execution errors in IBM system automation's rule-based expert system
We formally verify aspects of the rule-based expert system of IBM's System Automation software for IBM's zSeries mainframes. Starting with a formalization of the expert ...
Carsten Sinz, Thomas Lumpp, Jürgen M. Schneid...
FOSSACS
2007
Springer
13 years 11 months ago
PDL with Intersection and Converse Is 2 EXP-Complete
We study the complexity of satisfiability for the expressive extension ICPDL of PDL (Propositional Dynamic Logic), which admits intersection and converse as program operations. Ou...
Stefan Göller, Markus Lohrey, Carsten Lutz