Results 1  10
of
1,517
An Improvement in PartialOrder ModelChecking With Ample Sets
, 1996
"... In [18], Peled describes a partialorder reduction method to alleviate the stateexplosion problem for LTL modelchecking, i.e. for verifying that concurrent programs satisfy their linear temporal logic specifications. We present an approach that improves the method in [18] by enabling a further red ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
In [18], Peled describes a partialorder reduction method to alleviate the stateexplosion problem for LTL modelchecking, i.e. for verifying that concurrent programs satisfy their linear temporal logic specifications. We present an approach that improves the method in [18] by enabling a further
Combining Partial Order Reductions with Onthefly Modelchecking
, 1994
"... Abstract Partial order modelchecking is an approach to reduce time and memory in modelchecking concurrent programs. Onthefly modelchecking is a technique to eliminate part of the search by intersecting an automaton representing the (negation of the) checked property with the state space during i ..."
Abstract

Cited by 210 (14 self)
 Add to MetaCart
Abstract Partial order modelchecking is an approach to reduce time and memory in modelchecking concurrent programs. Onthefly modelchecking is a technique to eliminate part of the search by intersecting an automaton representing the (negation of the) checked property with the state space during its generation. We prove conditions under which these two methods can be combined in order to gain reduction from both methods. An extension of the modelchecker SPIN, which implements this combination, is studied, showing substantial reduction over traditional search, not only in the number of reachable states, but directly in the amount of memory and time used. We also describe how to apply partialorder modelchecking under given fairness assumptions.
All from one, one for all: on model checking using representatives
 LNCS
, 1993
"... Checking that a given finite state program satisfies a linear temporal logic property is suffering in many cases from a severe space and time explosion. One way to cope with this is to reduce the state graph used for model checking. We define an equivalence relation between infinite sequences, based ..."
Abstract

Cited by 184 (6 self)
 Add to MetaCart
Checking that a given finite state program satisfies a linear temporal logic property is suffering in many cases from a severe space and time explosion. One way to cope with this is to reduce the state graph used for model checking. We define an equivalence relation between infinite sequences, based on infinite traces such that for each equivalence class, either all or none of the sequences satisfy the checked formula. We present an algorithm for constructing a state graph that contains at least one representative sequence for each equivalence class. This allows applying existing model checking algorithms to the reduced state graph rather than on the larger full state graph of the program. It also allows model checking under fairness assumptions, and exploits these assumptions to obtain smaller state graphs. A formula rewriting technique is presented to allow coarser equivalence relation among sequences, such that less representatives are needed. 1
[30] D. Peled, Th. Wilke, P. Wolper, An Algorithmic Approach for Checking Closure
"... [29] D. Peled. Combining partial order reductions with onthefly modelchecking. Formal Methods in System Design 8 (1996), 3964. ..."
Abstract
 Add to MetaCart
[29] D. Peled. Combining partial order reductions with onthefly modelchecking. Formal Methods in System Design 8 (1996), 3964.
Multiple trophic levels of a forest stream linked to terrestrial litter inputs
 Science
, 1997
"... The importance of terrestrialaquatic linkages was evaluated by a largescale, 3year exclusion of terrestrial leaf litter inputs to a forest stream. Exclusion of leaf litter had a strong bottomup effect that was propagated through detritivores to predators. Most invertebrate taxa in the predominan ..."
Abstract

Cited by 111 (16 self)
 Add to MetaCart
The importance of terrestrialaquatic linkages was evaluated by a largescale, 3year exclusion of terrestrial leaf litter inputs to a forest stream. Exclusion of leaf litter had a strong bottomup effect that was propagated through detritivores to predators. Most invertebrate taxa in the predominant habitat declined in either abundance, biomass, or both, compared with taxa in a nearby reference stream. However, fauna in moss habitats changed little, indicating that different food webs exist in habitats of different geomorphology. Thus, the ecosystemlevel consequences of excluding detrital inputs to an ecosystem were demonstrated. Inputs of riparian detritus are essential for conservation or restoration of diverse stream food webs. Detritus, or dead organic matter (1), is the major carbon pathway in most ecosystems: 70 to 90 % of all primary production eventually enters the detrital food web (2). The addition of detritus to food webs complicates classical plantherbi
Partial order reduction for probabilistic systems
 In Proc. 1st QEST
, 2004
"... In the past, several model checking algorithms have been proposed to verify probabilistic reactive systems. The techniques to combat the stateexplosion problem have mainly concentrated on symbolic methods with variants of decision diagrams or abstraction methods. In this paper, we show how partial ..."
Abstract

Cited by 30 (3 self)
 Add to MetaCart
order reduction with a variant of Peled’s ample set method can be applied in the context of LTL model checking for probabilistic systems modelled by Markov decision processes. 1
Children’s Witnessing of Adult Domestic Violence
 Journal of Interpersonal Violence
, 1999
"... feedback provided on earlier versions of this manuscript. ..."
Abstract

Cited by 94 (8 self)
 Add to MetaCart
feedback provided on earlier versions of this manuscript.
Fluent Model Checking for Eventbased Systems
 In Proceedings of FSE
, 2003
"... Model checking is an automated technique for verifying that a system satisfies a set of required properties. Such properties are typically expressed as temporal logic formulas, in which atomic propositions are predicates over state variables of the system. In eventbased system descriptions, states ..."
Abstract

Cited by 72 (9 self)
 Add to MetaCart
Model checking is an automated technique for verifying that a system satisfies a set of required properties. Such properties are typically expressed as temporal logic formulas, in which atomic propositions are predicates over state variables of the system. In eventbased system descriptions, states are not characterized by state variables, but rather by the behavior that originates in these states in terms of actions. In this context, it is natural for temporal formulas to be built from atomic propositions that are predicates on the occurrence of actions. The paper identifies limitations in this approach and introduces "fluent" propositions that permit formulas to naturally express properties that combine state and action. A fluent is a property of the world that holds after it is initiated by an action and ceases to hold when terminated by another action. The paper describes an approach to model checking fluentbased lineartemporal logic properties, with its implementation and application in the LTSA tool.
PartialOrder Reduction in Symbolic State Space Exploration
, 1997
"... . State space explosion is a fundamental obstacle in formal verification of designs and protocols. Several techniques for combating this problem have emerged in the past few years, among which two are significant: partialorder reductions and symbolic state space search. In asynchronous systems, ..."
Abstract

Cited by 65 (0 self)
 Add to MetaCart
. State space explosion is a fundamental obstacle in formal verification of designs and protocols. Several techniques for combating this problem have emerged in the past few years, among which two are significant: partialorder reductions and symbolic state space search. In asynchronous systems, interleavings of independent concurrent events are equivalent, and only a representative interleaving needs to be explored to verify local properties. Partialorder methods exploit this redundancy and visit only a subset of the reachable states. Symbolic techniques, on the other hand, capture the transition relation of a system and the set of reachable states as boolean functions. In many cases, these functions can be represented compactly using binary decision diagrams (BDDs). Traditionally, the two techniques have been practiced by two different schoolspartialorder methods with enumerative depthfirst search for the analysis of asynchronous network protocols, and symbolic bread...
Results 1  10
of
1,517