Sciweavers

502 search results - page 39 / 101
» Model Checking Timed Systems with Priorities
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
SPIN
2010
Springer
13 years 6 months ago
Context-Enhanced Directed Model Checking
Directed model checking is a well-established technique to efficiently tackle the state explosion problem when the aim is to find error states in concurrent systems. Although dir...
Martin Wehrle, Sebastian Kupferschmid
CHARME
2001
Springer
105views Hardware» more  CHARME 2001»
14 years 13 days ago
Net Reductions for LTL Model-Checking
We present a set of reduction rules for LTL model-checking of 1-safe Petri nets. Our reduction techniques are of two kinds: (1) Linear programming techniques which are based on wel...
Javier Esparza, Claus Schröter
DALT
2008
Springer
13 years 9 months ago
Model-Checking Strategic Ability and Knowledge of the Past of Communicating Coalitions
We propose a variant of alternating time temporal logic (ATL) with imperfect information, perfect recall, epistemic modalities for the past and strategies which are required to be ...
Dimitar P. Guelev, Catalin Dima
POPL
2007
ACM
14 years 8 months ago
On the analysis of interacting pushdown systems
Pushdown Systems (PDSs) has become an important paradigm for program analysis. Indeed, recent work has shown a deep connection between inter-procedural dataflow analysis for seque...
Vineet Kahlon, Aarti Gupta