Sciweavers

44 search results - page 1 / 9
» Local Model Checking for Context-Free Processes
Sort
View
ICALP
1993
Springer
13 years 9 months ago
Local Model Checking for Context-Free Processes
Hardi Hungar, Bernhard Steffen
FSTTCS
2004
Springer
13 years 10 months ago
Symbolic Reachability Analysis of Higher-Order Context-Free Processes
We consider the problem of symbolic reachability analysis of higher-order context-free processes. These models are generalizations of the context-free processes (also called BPA pr...
Ahmed Bouajjani, Antoine Meyer
ISDA
2009
IEEE
13 years 12 months ago
From Local Patterns to Global Models: Towards Domain Driven Educational Process Mining
Educational process mining (EPM) aims at (i) constructing complete and compact educational process models that are able to reproduce all observed behavior (process model discovery...
Nikola Trcka, Mykola Pechenizkiy
SPIN
2001
Springer
13 years 9 months ago
Transformations for Model Checking Distributed Java Programs
Abstract. This paper describes three program transformations that extend the scope of model checkers for Java programs to include distributed programs, i.e., multi-process programs...
Scott D. Stoller, Yanhong A. Liu
COLING
1996
13 years 6 months ago
Computational Complexity of Probabilistic Disambiguation by means of Tree-Grammars
This paper studies the computational complexity of disambiguation under probabilistic tree-grammars as in (Bod, 1992; Schabes and Waters, 1993). It presents a proof that the follo...
Khalil Sima'an