Loading

Error: Cannot Load Popup Box

Hit List

Title:

Aggregation of Linear

Description:

weak alternating automata and the model checking problem

weak alternating automata and the model checking problem Minimize

Contributors:

The Pennsylvania State University CiteSeerX Archives

Year of Publication:

2008-07-17

Source:

http://www.pst.ifi.lmu.de/DA/hammer/preview.pdf

http://www.pst.ifi.lmu.de/DA/hammer/preview.pdf Minimize

Document Type:

text

Language:

en

Rights:

Metadata may be used without restrictions as long as the oai identifier remains attached to it.

Metadata may be used without restrictions as long as the oai identifier remains attached to it. Minimize

URL:

Content Provider:

My Lists:

My Tags:

Notes:

Title:

Correct Execution of Reconfiguration for Stateful Component?

Description:

In component-based software engineering, reconfiguration describes structural changes to the architecture of a component system. For stateful components, not only structural but also behavioural aspects have to be taken into account in recon-figuration. We present a procedure to conduct reconfiguration in systems of concurrent, stateful componen...

In component-based software engineering, reconfiguration describes structural changes to the architecture of a component system. For stateful components, not only structural but also behavioural aspects have to be taken into account in recon-figuration. We present a procedure to conduct reconfiguration in systems of concurrent, stateful components that interferes as little as possible with unchanged subsystems. Reconfiguration is described by a plan for adding, deleting and recon-necting components. A plan is executed by a sequence of simple, local steps, which are suitable for implementation in a programming language. We prove that plan execution is indistinguishable from atomic reconfiguration and use this fact for state-space reduction for verifying properties by model checking. Minimize

Contributors:

The Pennsylvania State University CiteSeerX Archives

Year of Publication:

2015-02-27

Source:

http://www.pst.ifi.lmu.de/~hammer/publications/facs08.pdf

http://www.pst.ifi.lmu.de/~hammer/publications/facs08.pdf Minimize

Document Type:

text

Language:

en

Subjects:

Reconfiguration ; stateful components ; model checking

Reconfiguration ; stateful components ; model checking Minimize

Rights:

Metadata may be used without restrictions as long as the oai identifier remains attached to it.

Metadata may be used without restrictions as long as the oai identifier remains attached to it. Minimize

URL:

Content Provider:

My Lists:

My Tags:

Notes:

Title:

To Store or Not To Store” reloaded: Reclaiming memory on demand

Description:

Abstract. Behrmann et al. posed the question whether “To Store or Not To Store ” [1] states during reachability analysis, in order to counter the effects of the well-known state space explosion problem in explicitstate model checking. Their answer was to store not all but only some strategical states. They pay in run-time if the answer too often...

Abstract. Behrmann et al. posed the question whether “To Store or Not To Store ” [1] states during reachability analysis, in order to counter the effects of the well-known state space explosion problem in explicitstate model checking. Their answer was to store not all but only some strategical states. They pay in run-time if the answer too often is “Not To Store”. We propose a different strategy to adaptively trade time for space: “To Store ” as many states as memory limits permit. If free memory becomes scarce, we gradually swap states out to secondary storage. We are careful to minimize revisits, and I/O overhead, and also stay sound, i.e. on termination it is guaranteed that the full state space has been explored. It is also available for counterexample reconstruction. In our experiments we tackled state spaces of industrial-scale models with more than 10 9 explicit states with still modest storage requirements. 1 Minimize

Publisher:

Springer

Contributors:

The Pennsylvania State University CiteSeerX Archives

Year of Publication:

2008-07-17

Source:

http://www.foldr.org/~michaelw/papers/fmics-2006-disk-mc.pdf

http://www.foldr.org/~michaelw/papers/fmics-2006-disk-mc.pdf Minimize

Document Type:

text

Language:

en

Rights:

Metadata may be used without restrictions as long as the oai identifier remains attached to it.

Metadata may be used without restrictions as long as the oai identifier remains attached to it. Minimize

URL:

Content Provider:

My Lists:

My Tags:

Notes:

Title:

Truly on-the-fly LTL model checking

Author:

Description:

Abstract. We propose a novel algorithm for automata-based LTL model checking that interleaves the construction of the generalized Büchi automaton for the negation of the formula and the emptiness check. Our algorithm first converts the LTL formula into a linear weak alternating automaton; configurations of the alternating automaton correspond to...

Abstract. We propose a novel algorithm for automata-based LTL model checking that interleaves the construction of the generalized Büchi automaton for the negation of the formula and the emptiness check. Our algorithm first converts the LTL formula into a linear weak alternating automaton; configurations of the alternating automaton correspond to the locations of a generalized Büchi automaton, and a variant of Tarjan’s algorithm is used to decide the existence of an accepting run of the product of the transition system and the automaton. Because we avoid an explicit construction of the Büchi automaton, our approach can yield significant improvements in runtime and memory, for large LTL formulas. The algorithm has been implemented within the SPIN model checker, and we present experimental results for some benchmark examples. 1 Minimize

Publisher:

Springer-Verlag

Contributors:

The Pennsylvania State University CiteSeerX Archives

Year of Publication:

2012-05-06

Source:

http://hal.inria.fr/docs/00/04/39/89/PDF/final.pdf

http://hal.inria.fr/docs/00/04/39/89/PDF/final.pdf Minimize

Document Type:

text

Language:

en

Rights:

Metadata may be used without restrictions as long as the oai identifier remains attached to it.

URL:

Content Provider:

My Lists:

My Tags:

Notes:

Title:

Truly on-the-fly LTL model checking

Author:

Description:

We propose a novel algorithm for automata-based LTL model checking that interleaves the construction of the generalized Büchi automaton for the negation of the formula and the emptiness check. Our algorithm first converts the LTL formula into a linear weak alternating automaton; configurations of the alternating automaton correspond to the locat...

We propose a novel algorithm for automata-based LTL model checking that interleaves the construction of the generalized Büchi automaton for the negation of the formula and the emptiness check. Our algorithm first converts the LTL formula into a linear weak alternating automaton; configurations of the alternating automaton correspond to the locations of a generalized Büchi automaton, and a variant of Tarjan’s algorithm is used to decide the existence of an accepting run of the product of the transition system and the automaton. Because we avoid an explicit construction of the Büchi automaton, our approach can yield significant improvements in runtime and memory, for large LTL formulas. The algorithm has been implemented within the SPIN model checker, and we present experimental results for some benchmark examples. Minimize

Publisher:

Springer-Verlag

Contributors:

The Pennsylvania State University CiteSeerX Archives

Year of Publication:

2009-11-06

Source:

http://www.loria.fr/~merz/papers/tacas2005.pdf

http://www.loria.fr/~merz/papers/tacas2005.pdf Minimize

Document Type:

text

Language:

en

Rights:

Metadata may be used without restrictions as long as the oai identifier remains attached to it.

URL:

Content Provider:

My Lists:

My Tags:

Notes:

Title:

eingereicht am 24.4.2009Berichterstatter:

Author:

Description:

The increasing importance of distributed and decentralized software architectures entails more and more attention for adaptive software. Obtaining adaptiveness, however, is a difficult task as the software design needs to foresee and cope with a variety of situations. Using reconfiguration of components facilitates this task, as the adaptivity i...

The increasing importance of distributed and decentralized software architectures entails more and more attention for adaptive software. Obtaining adaptiveness, however, is a difficult task as the software design needs to foresee and cope with a variety of situations. Using reconfiguration of components facilitates this task, as the adaptivity is conducted on an architecture level instead of directly in the code. This results in a separation of concerns; the appropriate reconfiguration can be devised on a coarse level, while the implementation of the components can remain largely unaware of reconfiguration scenarios. We study reconfiguration in component frameworks based on formal theory. We first discuss programming with components, exemplified with the development of the cmc model checker. This highly efficient model checker is made of C++ components and serves as an example for component-based software development practice in general, and also provides insights into the principles of adaptivity. However, the component model focuses on high performance and is not geared towards using the structuring principle of components for controlled reconfiguration. We thus Minimize

Contributors:

The Pennsylvania State University CiteSeerX Archives

Year of Publication:

2012-06-21

Source:

http://edoc.ub.uni-muenchen.de/10192/1/hammer_moritz.pdf

http://edoc.ub.uni-muenchen.de/10192/1/hammer_moritz.pdf Minimize

Document Type:

text

Language:

en

Rights:

Metadata may be used without restrictions as long as the oai identifier remains attached to it.

URL:

Content Provider:

My Lists:

My Tags:

Notes:

Title:

How To Touch a Running System

Description:

The increasing importance of distributed and decentralized software architectures entails more and more attention for adaptive software. Obtaining adaptiveness, however, is a difficult task as the software design needs to foresee and cope with a variety of situations. Using reconfiguration of components facilitates this task, as the adaptivity i...

The increasing importance of distributed and decentralized software architectures entails more and more attention for adaptive software. Obtaining adaptiveness, however, is a difficult task as the software design needs to foresee and cope with a variety of situations. Using reconfiguration of components facilitates this task, as the adaptivity is conducted on an architecture level instead of directly in the code. This results in a separation of concerns; the appropriate reconfiguration can be devised on a coarse level, while the implementation of the components can remain largely unaware of reconfiguration scenarios. We study reconfiguration in component frameworks based on formal theory. We first discuss programming with components, exemplified with the development of the cmc model checker. This highly efficient model checker is made of C++ components and serves as an example for component-based software development practice in general, and also provides insights into the principles of adaptivity. However, the component model focuses on high performance and is not geared towards using the structuring principle of components for controlled reconfiguration. We thus complement this highly optimized model by a message passing-based component model which takes reconfigurability to be its central principle. Supporting reconfiguration in a framework is about alleviating the programmer from caring about the peculiarities as much as possible. We utilize the formal description of the component model to provide an algorithm for reconfiguration that retains as much flexibility as possible, while avoiding most problems that arise due to concurrency. This algorithm is embedded in a general four-stage adaptivity model inspired by physical control loops. The reconfiguration is devised to work with stateful components, retaining their data and unprocessed messages. Reconfiguration plans, which are provided with a formal semantics, form the input of the reconfiguration algorithm. We show that the algorithm achieves perceived atomicity of the reconfiguration process for an important class of plans, i.e., the whole process of reconfiguration is perceived as one atomic step, while minimizing the use of blocking of components. We illustrate the applicability of our approach to reconfiguration by providing several examples like fault-tolerance and automated resource control. Minimize

Publisher:

Ludwig-Maximilians-Universität München

Year of Publication:

2009-05-07

Document Type:

Dissertation ; NonPeerReviewed

Subjects:

Fakultät für Mathematik ; Informatik und Statistik

Fakultät für Mathematik ; Informatik und Statistik Minimize

DDC:

004 Data processing & computer science *(computed)*

Relations:

http://edoc.ub.uni-muenchen.de/10192/

URL:

Content Provider:

My Lists:

My Tags:

Notes:

Title:

Truly On-The-Fly LTL Model Checking

Author:

Description:

We propose a novel algorithm for automata-based LTL model checking that interleaves the construction of the generalized B\"{u}chi automaton for the negation of the formula and the emptiness check. Our algorithm first converts the LTL formula into a linear weak alternating automaton; configurations of the alternating automaton correspond to the l...

We propose a novel algorithm for automata-based LTL model checking that interleaves the construction of the generalized B\"{u}chi automaton for the negation of the formula and the emptiness check. Our algorithm first converts the LTL formula into a linear weak alternating automaton; configurations of the alternating automaton correspond to the locations of a generalized B\"{u}chi automaton, and a variant of Tarjan's algorithm is used to decide the existence of an accepting run of the product of the transition system and the automaton. Because we avoid an explicit construction of the B\"{u}chi automaton, our approach can yield significant improvements in runtime and memory, for large LTL formulas. The algorithm has been implemented within the SPIN model checker, and we present experimental results for some benchmark examples. Minimize

Year of Publication:

2005-11-16

Document Type:

text

Subjects:

Computer Science - Logic in Computer Science

Computer Science - Logic in Computer Science Minimize

Content Provider:

My Lists:

My Tags:

Notes:

Title:

Constructing a Hidden Markov Model based earthquake detector: application to induced seismicity

Author:

Description:

The triggering or detection of seismic events out of a continuous seismic data stream is one of the key issues of an automatic or semi-automatic seismic monitoring system. In the case of dense networks, either local or global, most of the implemented trigger algorithms are based on a large number of active stations. However, in the case of only ...

The triggering or detection of seismic events out of a continuous seismic data stream is one of the key issues of an automatic or semi-automatic seismic monitoring system. In the case of dense networks, either local or global, most of the implemented trigger algorithms are based on a large number of active stations. However, in the case of only few available stations or small events, for example, like in monitoring volcanoes or hydrothermal power plants, common triggers often show high false alarms. In such cases detection algorithms are of interest, which show reasonable performance when operating even on a single station. In this context, we apply Hidden Markov Models (HMM) which are algorithms borrowed from speech recognition. However, many pitfalls need to be avoided to apply speech recognition technology directly to earthquake detection. We show the fit of the model parameters in an innovative way. State clustering is introduced to refine the intrinsically assumed time dependency of the HMMs and we explain the effect coda has on the recognition results. The methodology is then used for the detection of anthropogenicly induced earthquakes for which we demonstrate for a period of 3.9 months of continuous data that the single station HMM earthquake detector can achieve similar detection rates as a common trigger in combination with coincidence sums over two stations. To show the general applicability of state clustering we apply the proposed method also to earthquake classification at Mt. Merapi volcano, Indonesia. Minimize

Publisher:

Oxford University Press

Year of Publication:

2012-04-01 00:00:00.0

Document Type:

TEXT

Language:

en

Subjects:

Seismology

Seismology Minimize

Rights:

Copyright (C) 2012, Oxford University Press

Copyright (C) 2012, Oxford University Press Minimize

URL:

Content Provider:

My Lists:

My Tags:

Notes:

Title:

Truly On-The-Fly LTL Model Checking

Author:

Description:

We propose a novel algorithm for automata-based LTL model checking that interleaves the construction of the generalized Büchi automaton for the negation of the formula and the emptiness check. Our algorithm first converts the LTL formula into a linear weak alternating automaton; configurations of the alternating automaton correspond to the locat...

We propose a novel algorithm for automata-based LTL model checking that interleaves the construction of the generalized Büchi automaton for the negation of the formula and the emptiness check. Our algorithm first converts the LTL formula into a linear weak alternating automaton; configurations of the alternating automaton correspond to the locations of a generalized Büchi automaton, and a variant of Tarjan's algorithm is used to decide the existence of an accepting run of the product of the transition system and the automaton. Because we avoid an explicit construction of the Büchi automaton, our approach can yield significant improvements in runtime and memory, for large LTL formulas. The algorithm has been implemented within the SPIN model checker, and we present experimental results for some benchmark examples. Minimize

Publisher:

HAL - CCSD

Year of Publication:

2005

Document Type:

text

Language:

EN

Subjects:

[INFO:INFO_LO] Computer Science/Logic in Computer Science ; model checking ; temporal logic ; alternating automata ; Büchi automata ; Spin

[INFO:INFO_LO] Computer Science/Logic in Computer Science ; model checking ; temporal logic ; alternating automata ; Büchi automata ; Spin Minimize

URL:

Content Provider:

My Lists:

My Tags:

Notes:

Currently in BASE: 71,429,514 Documents of 3,428 Content Sources

http://www.base-search.net