Sciweavers

70 search results - page 7 / 14
» Reachability Analysis of Pushdown Automata: Application to M...
Sort
View
AAAI
2010
14 years 11 months ago
Dominance Testing via Model Checking
Dominance testing, the problem of determining whether an outcome is preferred over another, is of fundamental importance in many applications. Hence, there is a need for algorithm...
Ganesh Ram Santhanam, Samik Basu, Vasant Honavar
ACRI
2004
Springer
15 years 2 months ago
SAT-Based Analysis of Cellular Automata
Abstract. Cellular Automata are a powerful formal model for describing physical and computational processes. Qualitative analysis of Cellular Automata is in general a hard problem....
Massimo D'Antonio, Giorgio Delzanno
EDOC
2000
IEEE
15 years 1 months ago
Model Checking of Workflow Schemas
Practical experience indicates that the definition of realworld workflow applications is a complex and error-prone process. Existing workflow management systems provide the means,...
Christos T. Karamanolis, Dimitra Giannakopoulou, J...
CAV
2000
Springer
197views Hardware» more  CAV 2000»
15 years 1 months ago
Bounded Model Construction for Monadic Second-Order Logics
Address: Abstraction, Composition, Symmetry, and a Little Deduction: The Remedies to State Explosion . . . . . . . . . . . . . . . . . . . . . . . . . . 1 A. Pnueli Invited Address...
Abdelwaheb Ayari, David A. Basin
SPIN
2010
Springer
14 years 7 months ago
Analysing Mu-Calculus Properties of Pushdown Systems
Pushdown systems provide a natural model of software with recursive procedure calls. We provide a tool implementing an algorithm for computing the winning regions of a pushdown par...
Matthew Hague, C.-H. Luke Ong