Sciweavers

DFG
2004
Springer
14 years 1 months ago
Verification of PLC Programs Given as Sequential Function Charts
Programmable Logic Controllers (PLC) are widespread in the manufacturing and processing industries to realize sequential procedures and to avoid safety-critical states. For the spe...
Nanette Bauer, Sebastian Engell, Ralf Huuck, Sven ...
CAV
2006
Springer
110views Hardware» more  CAV 2006»
14 years 1 months ago
Improving Pushdown System Model Checking
Abstract. In this paper, we reduce pushdown system (PDS) model checking to a graphtheoretic problem, and apply a fast graph algorithm to improve the running time for model checking...
Akash Lal, Thomas W. Reps
CAV
2006
Springer
129views Hardware» more  CAV 2006»
14 years 1 months ago
Languages of Nested Trees
We study languages of nested trees--structures obtained by augmenting trees with sets of nested jump-edges. These graphs can naturally model branching behaviors of pushdown program...
Rajeev Alur, Swarat Chaudhuri, P. Madhusudan
CSFW
2004
IEEE
14 years 1 months ago
Symbolic Model Checking the Knowledge of the Dining Cryptographers
This paper describes how symbolic techniques (in particular, OBDD's) may be used to to implement an algorithm for model checking specifications in the logic of knowledge for ...
Ron van der Meyden, Kaile Su
ATVA
2006
Springer
162views Hardware» more  ATVA 2006»
14 years 1 months ago
Predicate Abstraction of Programs with Non-linear Computation
e Abstraction of Programs With Non-linear Computation Songtao Xia1 Ben Di Vito2 Cesar Munoz3 1 NASA Postdoc at NASA Langley Research Center, Hampton, VA 2 NASA Langley Research Cen...
Songtao Xia, Ben Di Vito, César Muño...
ATVA
2006
Springer
123views Hardware» more  ATVA 2006»
14 years 1 months ago
Symmetry Reduction for Probabilistic Model Checking Using Generic Representatives
Generic representatives have been proposed for the effective combination of symmetry reduction and symbolic representation with BDDs in non-probabilistic model checking. This appro...
Alastair F. Donaldson, Alice Miller
ATAL
2006
Springer
14 years 1 months ago
Run-time model checking of interaction and deontic models for multi-agent systems
This paper is concerned with the problem of obtaining predictable interactions between groups of agents in open environments when individual agents do not expose their bdi logic. ...
Nardine Osman, David Robertson, Christopher Walton
ATAL
2006
Springer
14 years 1 months ago
The complexity of model checking concurrent programs against CTLK specifications
This paper presents complexity results for model checking concurrent programs against temporal-epistemic formulae. We apply these results to evaluate the complexity of verifying p...
Alessio Lomuscio, Franco Raimondi
ATAL
2006
Springer
14 years 1 months ago
Model checking knowledge, strategies, and games in multi-agent systems
We present an OBDD-based methodology for verifying time, knowledge, and strategies in multi-agent systems specified by the formalism of interpreted systems. To this end, we invest...
Alessio Lomuscio, Franco Raimondi
ATAL
2006
Springer
14 years 1 months ago
On the complexity of practical ATL model checking
We investigate the computational complexity of reasoning about multi-agent systems using the cooperation logic ATL of Alur, Henzinger, and Kupferman. It is known that satisfiabili...
Wiebe van der Hoek, Alessio Lomuscio, Michael Wool...