2016 IEEE 17th International Symposium on High Assurance Systems Engineering (HASE) 2016
DOI: 10.1109/hase.2016.24
|View full text |Cite
|
Sign up to set email alerts
|

Statistical Model Checking for SystemC Models

Abstract: Abstract-Transaction-level modeling with SystemC has been very successful in describing the behavior of embedded systems by providing high-level executable models, in which many of them have an inherent probabilistic behavior, i.e., random data, unreliable components. It is crucial to evaluate the quantitative and qualitative analysis of the probability of the system properties. Such analysis can be conducted by constructing a formal model of the system and using probabilistic model checking. However, this met… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
6
0

Year Published

2016
2016
2019
2019

Publication Types

Select...
4
1

Relationship

3
2

Authors

Journals

citations
Cited by 11 publications
(6 citation statements)
references
References 23 publications
(38 reference statements)
0
6
0
Order By: Relevance
“…We have implemented an SMC‐based verification tool,() PSCV, that contains 2 main original components: a Monitor and Aspect‐advice Generator (MAG) and a Statistical Model Checker (SystemC Plugin). The tool whose architecture is depicted in Figure is considered as a runtime verification tool for probabilistic temporal properties.…”
Section: Methodsmentioning
confidence: 99%
See 1 more Smart Citation
“…We have implemented an SMC‐based verification tool,() PSCV, that contains 2 main original components: a Monitor and Aspect‐advice Generator (MAG) and a Statistical Model Checker (SystemC Plugin). The tool whose architecture is depicted in Figure is considered as a runtime verification tool for probabilistic temporal properties.…”
Section: Methodsmentioning
confidence: 99%
“…The FIFO channel is designed to ensure that all data is reliably delivered despite the varying rates of production and consumption 6 of 17 NGO AND LEGAY time required to transfer completely a message, or message latency, depends on the production and consumption rates, the FIFO buffer size, the message size, and the probabilities of successful writing and reading. The full implementation of the example can be obtained at the website of our tool, 26,27 in which the probabilities of writing and reading are implemented with the Bernoulli distributions with probabilities p 1 and p 2 respectively from GNU Scientific Library (GSL). 28 The quantitative analysis under consideration is as follows: What is the probability that each single message is transferred completely (eg, including the message delimiters) within T 1 nanoseconds during T nanoseconds of operation?…”
Section: A Running Examplementioning
confidence: 99%
“…Plasma Lab includes a simulator for the Reactive Module Language (RML) of the probabilistic modelchecker Prism [17] that allows to specify discrete and continuous time Markov chains, as well as Markov decision processes. It also includes interfaces to external simulators such as SystemC [22], LLVM bytecode, or MATLAB/Simulink models [21].…”
Section: Implementation Using Plasma Labmentioning
confidence: 99%
“…Hence, the temporal resolution is defined by the following disjunction (MON DELTA CYCLE END | e.notified), where MON DELTA CYCLE END and e.notified are Boolean observed variables that have the value true whenever the kernel phase is at the end of delta-cycle and e is notified, respectively. The observed variables used to describe SystemC code features, the simulation semantics, and temporal resolution are summarized below; see [13,12] for the full syntax and semantics. Attribute.…”
Section: Expressing Propertiesmentioning
confidence: 99%
“…Given a property, a user-defined absolute error and confidence, the tool implements the statistical estimation and hypothesis testing techniques [8,16] for computing probability that the property is satisfied by the model or asserting that this probability is at least equal to a threshold. The theoretical and algorithmic foundations of the tool are based on Ngo et al's work [12].…”
Section: Introductionmentioning
confidence: 99%