Sciweavers

361 search results - page 10 / 73
» Parallel Model Checking for Temporal Epistemic Logic
Sort
View
CONCUR
2000
Springer
13 years 11 months ago
Model Checking with Finite Complete Prefixes Is PSPACE-Complete
Unfoldings are a technique for verification of concurrent and distributed systems introduced by McMillan. The method constructs a finite complete prefix, which can be seen as a sym...
Keijo Heljanko
ICSE
2003
IEEE-ACM
14 years 20 days ago
Data Flow Testing as Model Checking
This paper presents a model checking-based approach to data flow testing. We characterize data flow oriented coverage criteria in temporal logic such that the problem of test ge...
Hyoung Seok Hong, Sung Deok Cha, Insup Lee, Oleg S...
LOGCOM
2002
100views more  LOGCOM 2002»
13 years 7 months ago
Model Checking Games for Branching Time Logics
This paper defines and examines model checking games for the branching time temporal logic CTL . The games employ a technique called focus which enriches sets by picking out one d...
Martin Lange, Colin Stirling
WABI
2007
Springer
14 years 1 months ago
Predicting Protein Folding Kinetics Via Temporal Logic Model Checking
Christopher James Langmead⋆ and Sumit Kumar Jha Department of Computer Science, Carnegie Mellon University We present a novel approach for predicting protein folding kinetics us...
Christopher James Langmead, Sumit Kumar Jha
ACOM
2006
Springer
14 years 1 months ago
Temporal Logics for Representing Agent Communication Protocols
Abstract. This paper explores the use of temporal logics in the context of communication protocols for multiagent systems. We concentrate on frameworks where protocols are used to ...
Ulle Endriss