Analyzing stochastic reward nets by model checking and parallel simulation

Cicirelli, Franco; Nigro, Libero

doi:10.1016/j.simpat.2021.102467

Cited by 6 publications

(2 citation statements)

References 13 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Fourth, due to the uncertainty that unavoidably accompanies the correct prediction of the execution time of task actions (e.g., [5]), an important goal of the final real-time software is to possibly admit state degradation modes and abort decisions [33] with recovery means, so as to minimize the risks corresponding to a deadline miss. Fifth, to port C-TPN on top of the Theater actor system [34] for the schedulability analysis of large models of embedded systems and, e.g., for studying workflow scheduling schemes in cloud computing [35], by parallel simulations [28] on a multi-core machine.…”

Section: Discussionmentioning

confidence: 99%

See 1 more Smart Citation

Formal Modeling and Verification of Embedded Real-Time Systems: An Approach and Practical Tool Based on Constraint Time Petri Nets

Nigro,

Cicirelli

2024

Mathematics

Self Cite

View full text Add to dashboard Cite

Modeling and verification of the correct behavior of embedded real-time systems with strict timing constraints is a well-known and important problem. Failing to fulfill a deadline in system operation can have severe consequences in the practical case. This paper proposes an approach to formal modeling and schedulability analysis. A novel extension of Petri Nets named Constraint Time Petri Nets (C-TPN) is developed, which enables the modeling of a collection of interdependent real-time tasks whose execution is constrained by the use of priority and shared resources like processors and memory data. A C-TPN model is reduced to a network of Timed Automata in the context of the popular Uppaal toolbox. Both functional and, most importantly, temporal properties can be assessed by exhaustive model checking and/or statistical model checking based on simulations. This paper first describes and motivates the proposed C-TPN modeling language and its formal semantics. Then, a Uppaal translation is shown. Finally, three models of embedded real-time systems are considered, and their properties are thoroughly verified.

show abstract

Section: Discussionmentioning

confidence: 99%

“…A C-TPN model can directly be mapped onto the Uppaal toolbox [17,18,27]. Uppaal, in fact, exposes powerful modeling abstractions that can be exploited to reproduce the operational semantics of an extended timed Petri Net formalism [20,28].…”

Section: Reducing C-tpn Onto Uppaalmentioning

confidence: 99%

Formal Modeling and Verification of Embedded Real-Time Systems: An Approach and Practical Tool Based on Constraint Time Petri Nets

Nigro,

Cicirelli

2024

Mathematics

Self Cite

View full text Add to dashboard Cite

show abstract

A comprehensive survey of UPPAAL‐assisted formal modeling and verification

Zhou,

Zhao,

Zhang

et al. 2024

Softw Pract Exp

View full text Add to dashboard Cite

UPPAAL is a formal modeling and verification tool based on timed automata, capable of effectively analyzing real‐time software and hardware systems. In this article, we investigate research on UPPAAL‐assisted formal modeling and verification. First, we propose four research questions considering tool characteristics, modeling methods, verification means and application domains. Then, the state‐of‐the‐art methods for model specification and verification in UPPAAL are discussed, involving model transformation, model repair, property specification, as well as verification and testing methods. Next, typical application cases of formal modeling and verification assisted by UPPAAL are analyzed, spanning across domains such as network protocol, multi‐agent system, cyber‐physical system, rail traffic and aerospace systems, cloud and edge computing systems, as well as biological and medical systems. Finally, we address the four proposed questions based on our survey and outline future research directions. By responding to these questions, we aim to provide summaries and insights into potential avenues for further exploration in this field.

show abstract