https://www.science.smith.edu/~jcardell/Courses/EGR328/Readings/WSNSurvey2.pdf

Wireless sensor network survey

Model Checking

https://www.cs.montana.edu/courses/csci566/Ref/WMSN-Survey.pdf

A survey on wireless multimedia sensor networks

Model checkers and other finite-state verification tools allow developers to detect certain kinds of errors automatically. Nevertheless, the transition of this technology from research to practice has been slow. While there are a number of potential causes for reluctance to adopt such formal methods, we believe that a primary cause is that practitioners are unfamiliar with specification processes, notations, and strategies. In a recent paper, we proposed a pattern-based approach to the presentation, codification and reuse of property specifications for finite-state verification. Since then, we have carried out a survey of available specifications, collecting over 500 examples of property specifications. We found that most are instances of our proposed patterns. Furthermore, we have updated our pattern system to accommodate new patterns and variations of existing patterns encountered in this survey. This paper reports the results of the survey and the current status of our pattern system.

/pdf/patterns-in-property-specifications-for-finite-state-126awsf84j.pdf

Patterns in property specifications for finite-state verification

Extensively class tested, this text takes an innovative approach to explaining the process of software testing: it defines testing as the process of applying a few well-defined, general-purpose test criteria to a structure or model of the software. The structure of the text directly reflects the pedagogical approach and incorporates the latest innovations in testing, including techniques to test modern types of software such as OO, web applications, and embedded software.

Introduction to Software Testing: List of Figures

We propose to extend existing Petri-net-based tools for concurrency analysis to real-time analysis. The goal is to create a fully automated system, which starts from code in a higher level language for real-time programming, and answers programmers' queries about timing properties of the code. The key difficulty with all reachability-based approaches is that the state space quickly becomes intractably large. To circumvent this state explosion problem, we propose using a combination of several heuristics for model reduction and state space reduction that have been effective for untimed concurrency analysis. >

A Petri-net-based approach to real-time program analysis

Traditional analysis and design approaches focus on "fit for purpose." Experience with contextual environment concerns demonstrates that "fit to context" is a consideration that is equally significant for the appropriateness of the chosen architecture. We propose a multilevel, context-aware approach to software architecture that (1) treats contextual environment concerns as first class entities and (2) groups concerns and techniques of different abstraction, scope and grain into separate explicit levels. We categorize contextual environment concerns into enterprise and system. The proposed method groups software architecture in macro-architecture and micro-architecture levels. In a significant departure from most current software architecture practices, we view and treat macro-architecture as a decision analysis discipline while applying the engineering modeling and design practices used in traditional software architecture methods to the micro-architecture level. In this paper we introduce the software architecture approach and method, discuss our current research, and identify the topics that must be addressed and further defined to complete the method.

The Need for a Multilevel Context-Aware Software Architecture Analysis and Design Method with Enterprise and System Architecture Concerns as First Class Entities

We automatically synthesize supervisory controllers that force a system to perform a certain operation by a given deadline. The operation must be executed by a pre-specified delay lambda with respect to the previous execution of the operation. We model both the controlled system and our control supervisors as time Petri nets. Given a target transition and a deadline, our supervisors disable net behaviors in which the firing of the target transition may miss the deadline. Our method is subject to a merge exclusion assumption on the structure of paths contained in a so-called net unfolding. If a control problem does not satisfy this assumption, we abandon supervisor generation. Preliminary empirical results show that our method is both relatively general and more tractable from a computational standpoint than most other real-time analysis methods.

/pdf/enforcing-transition-deadlines-in-time-petri-nets-2v02beful5.pdf

Enforcing transition deadlines in time Petri nets

At TAV3, we described a prelimimu-y version of the constrained expression toolset, and reported on the results of our initial experiments with it, Through those experiments we discovered shortcomings in some of the tools that limited the size of the examples that we could analyze. We have since redesigned and reimplementcd several components of the toolset, with performance improvements of more than two orders of magnitude in some cases. The improved toolset has been successfully used with designs that involve hundreds of concurrent processes. In this paper, we describe several experiments with the new version of the toolset, including preliminary experiments with a technique for analyzing systems that include an essentially arbitrary number of identical components.

/pdf/experiments-with-an-improved-constrained-expression-toolset-5gar8g772g.pdf

Experiments with an improved constrained expression toolset

/pdf/integer-programming-in-the-analysis-of-concurrent-systems-1bi4nuismi.pdf

Ugo Buy

Papers

A Petri-net-based approach to real-time program analysis

The Need for a Multilevel Context-Aware Software Architecture Analysis and Design Method with Enterprise and System Architecture Concerns as First Class Entities

Enforcing transition deadlines in time Petri nets

Experiments with an improved constrained expression toolset

Integer Programming in the Analysis of Concurrent Systems