Results 1  10
of
10
On the Formal Verification of Middleware Behavioral Properties
 In 9th International Workshop on Formal Methods for Industrial Critical Systems (FMICS’04
, 2004
"... Distribution middleware is often integrated as a COTS, providing distribution facilities for critical, embedded or largescale applications. So far, typical middleware does not come with a complete analysis of their behavioral properties. In this paper, we present our work on middleware modeling and ..."
Abstract

Cited by 19 (16 self)
 Add to MetaCart
Distribution middleware is often integrated as a COTS, providing distribution facilities for critical, embedded or largescale applications. So far, typical middleware does not come with a complete analysis of their behavioral properties. In this paper, we present our work on middleware modeling and the verification of its behavioral properties; the study is applied to our middleware architecture: PolyORB. Then we present the tools and techniques deployed to actually verify the behavioral properties of our model: Petri nets, temporal logic and advanced algorithms to reduce the size of the state space. Finally, we detail some properties we verify and assess our methodology.
Exploiting partial symmetries in wellformed nets for the reachability and the linear time model checking problems
 in Proc. of the 7th Workshop on Discrete Event Systems (WODES’04
, 2004
"... Abstract: Taking advantage of the symmetries of a system is an efficient way to cope with the combinatory explosion involved by the verification process. Whereas numerous algorithms and tools efficiently deal with the verification of a symmetrical formula on a symmetrical model, the management of pa ..."
Abstract

Cited by 9 (6 self)
 Add to MetaCart
Abstract: Taking advantage of the symmetries of a system is an efficient way to cope with the combinatory explosion involved by the verification process. Whereas numerous algorithms and tools efficiently deal with the verification of a symmetrical formula on a symmetrical model, the management of partial symmetries is still an open research topic. In this work, we present the design and the evaluation of two methods applicable on coloured Petri nets. These two methods are extensions of the symbolic reachability graph construction for the wellformed Petri nets. The first algorithm, called the extended symbolic reachability graph construction, tackles the reachability problem. The second one, called the symbolic synchronized product, checks a partially symmetric linear time formula on a net. The evaluations show that these two methods outperform the previous approaches dealing with partial symmetries. Furthermore they are complementary ones since the former while being less general gives better results than the latter when applied to the reachability problem.
Improving Reachability Analysis for Partially Symmetric High Level Petri Nets
"... this paper, we propose to use an eventbased automaton, namely control automaton, to control the firings of the transitions by means of synchronization operations. Each arc of the automaton is labelled by a boolean expression made of atomic propositions being predicates controlling the WN actions. I ..."
Abstract
 Add to MetaCart
this paper, we propose to use an eventbased automaton, namely control automaton, to control the firings of the transitions by means of synchronization operations. Each arc of the automaton is labelled by a boolean expression made of atomic propositions being predicates controlling the WN actions. In Figure 3, the arc labelled by t 4 [max(x)] means that among a given set of possible events for the t 4 transition, only the event that corresponds to the highest value for the variable x is allowed
Abstract FMICS 2004 Preliminary Version On the Formal Verification of Middleware Behavioral Properties
"... Distribution middleware is often integrated as a COTS, providing distribution facilities for critical, embedded or largescale applications. So far, typical middleware does not come with a complete analysis of their behavioral properties. In this paper, we present our work on middleware modeling and ..."
Abstract
 Add to MetaCart
Distribution middleware is often integrated as a COTS, providing distribution facilities for critical, embedded or largescale applications. So far, typical middleware does not come with a complete analysis of their behavioral properties. In this paper, we present our work on middleware modeling and the verification of its behavioral properties; the study is applied to our middleware architecture: PolyORB. Then we present the tools and techniques deployed to actually verify the behavioral properties of our model: Petri nets, temporal logic and advanced algorithms to reduce the size of the state space. Finally, we detail some properties we verify and assess our methodology.
Emptiness Check of Powerset Büchi Automata using Inclusion Tests
"... We introduce two emptiness checks for Büchi automata whose states represent sets that may include each other. The first is equivalent to a traditional emptiness check but uses inclusion tests to direct the onthefly construction of the automaton. The second is impressively faster but may return fal ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
We introduce two emptiness checks for Büchi automata whose states represent sets that may include each other. The first is equivalent to a traditional emptiness check but uses inclusion tests to direct the onthefly construction of the automaton. The second is impressively faster but may return false negatives. We illustrate and benchmark the improvement on a symmetrybased reduction.
Mechanizing the Minimization of Deterministic Generalized Büchi Automata
"... Abstract. Deterministic Büchi automata (DBA) are useful to (probabilistic) model checking and synthesis. We survey techniques used to obtain and minimize DBAs for different classes of properties. We extend these techniques to support DBA that have generalized and transitionbased acceptance (DTGBA ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
Abstract. Deterministic Büchi automata (DBA) are useful to (probabilistic) model checking and synthesis. We survey techniques used to obtain and minimize DBAs for different classes of properties. We extend these techniques to support DBA that have generalized and transitionbased acceptance (DTGBA) as they can be even smaller. Our minimization technique—a reduction to a SAT problem—synthesizes a DTGBA equivalent to the input DTGBA for any given number of states and number of acceptance sets (assuming such automaton exists). We present benchmarks using a framework that implements all these techniques. 1
SATbased Minimization of Deterministic ωAutomata
"... Abstract. We describe a tool that inputs a deterministic ωautomaton with any acceptance condition, and synthesizes an equivalent ωautomaton with another arbitrary acceptance condition and a given number of states, if such an automaton exists. This tool, that relies on a SATbased encoding of the p ..."
Abstract
 Add to MetaCart
Abstract. We describe a tool that inputs a deterministic ωautomaton with any acceptance condition, and synthesizes an equivalent ωautomaton with another arbitrary acceptance condition and a given number of states, if such an automaton exists. This tool, that relies on a SATbased encoding of the problem, can be used to provide minimal ωautomata equivalent to given properties, for different acceptance conditions. 1
On the use of exact lumpability in partially symmetrical Wellformed Nets
"... Wellformed Nets (WNs) have proved an efficient model for building quotient reachability graphs that can be used either for qualitative or performance analysis. However, local asymmetries often break any possibility of grouping states into classes, thus drastically reducing the interest of the appro ..."
Abstract

Cited by 4 (3 self)
 Add to MetaCart
Wellformed Nets (WNs) have proved an efficient model for building quotient reachability graphs that can be used either for qualitative or performance analysis. However, local asymmetries often break any possibility of grouping states into classes, thus drastically reducing the interest of the approach. An efficient solution has been proposed for qualitative analysis, which relies on a separate representation of the asymmetries in a socalled control automaton. The quotient graph is then obtained by synchronising the transitions of the WN model with the transitions of the control automaton. In this paper, we improve this approach to quantitative analysis. We show that it can be used to build an aggregated graph that is isomorphic to a Markov chain which verifies exact lumpability. Theoretical considerations and practical experiments show that our method outperforms previous approaches. 1
From partially to fully lumped Markov chains in stochastic well formed Petri nets
 In Proc. of Valuetools 2009 Conf
, 2009
"... This paper presents a generic framework for building quotient graphs for Stochastic Wellformed Net models by exploiting the symmetries implicitly defined in the model. Two instantiations are presented, one based on static symmetries and the other one based on dynamic symmetries. The second metho ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
This paper presents a generic framework for building quotient graphs for Stochastic Wellformed Net models by exploiting the symmetries implicitly defined in the model. Two instantiations are presented, one based on static symmetries and the other one based on dynamic symmetries. The second method can usually deal with partially symmetric systems in a more effective way than the first one. However, in some cases it may result in a larger graph. We present here a new approach that overcomes the weakness of these methods. All these techniques can be used for efficient performance analysis of systems. 1.
Practical StutterInvariance Checks for ωRegular Languages
"... Abstract. An ωregular language is stutterinvariant if it is closed by the operation that duplicates some letter in a word or that removes some duplicate letter. Model checkers can use powerful reduction techniques when the specification is stutterinvariant. We propose several automatabased cons ..."
Abstract
 Add to MetaCart
Abstract. An ωregular language is stutterinvariant if it is closed by the operation that duplicates some letter in a word or that removes some duplicate letter. Model checkers can use powerful reduction techniques when the specification is stutterinvariant. We propose several automatabased constructions that check whether a specification is stutterinvariant. These constructions assume that a specification and its negation can be translated into Büchi automata, but aside from that, they are independent of the specification formalism. These transformations were inspired by a construction due to Holzmann and Kupferman, but that we broke down into two operations that can have different realizations, and that can be combined in different ways. As it turns out, implementing only one of these operations is needed to obtain a functional stutterinvariant check. Finally we have implemented these techniques in a tool so that users can easily check whether an LTL or PSL formula is stutterinvariant. 1