CSP-Based Sensor Network Architecture for Reconfigurable Measurement Systems

Jaskó, Szilárd; Simon, Gyula

doi:10.1109/tim.2011.2117210

Cited by 8 publications

(3 citation statements)

References 47 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Many publications deal with the development of error detection methods [17], [18]. The increasing complexity of PLC programs also generates the need of developing effective validation processes.…”

Section: Applying the Cpn Model For Validationmentioning

confidence: 99%

Coloured Petri Net based PLC program validation with a fast simulation method

Schné

Holczinger

2013

2013 International Conference on Process Control (PC)

View full text Add to dashboard Cite

A Coloured Petri Net (CPN) based method for Programmable Logic Controller (PLC) program validation is proposed in this paper. It uses a simple fixed net structure and does not require the creation of different Petri Nets for every new PLC program. The base of the method is the so-called technology description and operation state table used in engineering practice. The CPN simulates the operation of the PLC and compares the resulted values to the desired ones. In the case of a difference it indicates the existence of an error. The method is capable of automatic program validation and safety analysis, which is demonstrated through the example of an oil tank system.

show abstract

Section: Applying the Cpn Model For Validationmentioning

confidence: 99%

Coloured Petri Net based PLC program validation with a fast simulation method

Schné

Holczinger

2013

2013 International Conference on Process Control (PC)

View full text Add to dashboard Cite

show abstract

“…In the literature, CSP has been applied in similar efforts to guarantee behaviours or performance goals. Jaskó and Simon [5] used the language to prove deadlock-free operation in a sensor network architecture, while Sakellariou et al [6] incorporated CSP into programming languages for constraint programming, and employed it as a tool for distributed constraint satisfaction problems. Using timed CSP, Liu et al [7] introduced the concept of Wireless Sensor Processes (WSP) to model contention-based wireless sensor networking systems.…”

Section: Introductionmentioning

confidence: 99%

Formalising Nondeterministic Communication in Wireless Sensor Networks Using CSP

Andersen

Espe

Hendseth

et al. 2021

2021 10th Mediterranean Conference on Embedded Computing (MECO)

View full text Add to dashboard Cite

Using communicating sequential processes (CSP), this paper presents a model for wireless sensor networks (WSNs) to be used for formal verification of communication reliability in mesh networks. Process models are derived for sensor nodes and communication links, introducing nondeterminism in order to capture the unreliability inherent in wireless communication. It is shown that a guarantee may be issued concerning the CSP model's worst-case performance in terms of packet corruption. This guarantee is substantiated by transformation of the model, employing a series of operations introduced to simplify the network while preserving worst-case performance. The end result is a formal proof of the entire network's worst-case reliability. As long as the nondeterminism of the communication links is modelled with care, the packet corruption rate through the network will be equal to or better than the worst-case performance of its most deterministic path.

show abstract

“…One approach is to use additional analog circuits to condition sensors output signal [3], [4], [5]. However, analog compensation is not always appropriate for sensors integrated into reconfigurable sensor networks [1], [6], [7]. A more flexible solution is to convert sensor output into the digital domain, where various numerical linearization methods may be applied in the form of compensation algorithms.…”

Section: Introductionmentioning

confidence: 99%

On the node ordering of progressive polynomial approximation for the sensor linearization

et al. 2019

View full text Add to dashboard Cite

Many sensors exhibit nonlinear dependence between their input and output variables and specific techniques are often applied for the linearization of their transfer characteristics. Some of them include additional analog circuits, while the others are based on different numerical procedures. One commonly used software solution is Progressive Polynomial Approximation. This method for sensor transfer function linearization shows strong dependence on the order of selected nodes in the linearization vector. There are several modifications of this method which enhance its effectiveness but require extensive computational time. This paper proposes the methodology that shows improvement over Progressive Polynomial Approximation without additional increase of complexity. It concerns the order of linearization nodes in linearization vector. The optimal order of nodes is determined on the basis of sensor transfer function concavity. The proposed methodology is compared to the previously reported methods on a set of analytical functions. It is then implemented in the temperature measurement system using a set of thermistors with negative temperature coefficients. It is shown that its implementation in the low-cost microcontrollers integrated into the nodes of reconfigurable sensor networks is justified.

show abstract

CSP-Based Sensor Network Architecture for Reconfigurable Measurement Systems

Cited by 8 publications

References 47 publications

Coloured Petri Net based PLC program validation with a fast simulation method

Coloured Petri Net based PLC program validation with a fast simulation method

Formalising Nondeterministic Communication in Wireless Sensor Networks Using CSP

On the node ordering of progressive polynomial approximation for the sensor linearization

Contact Info

Product

Resources

About