Proceedings of the 2014 International C* Conference on Computer Science &Amp; Software Engineering - C3S2E '14 2008
DOI: 10.1145/2641483.2641522
|View full text |Cite
|
Sign up to set email alerts
|

Verification and Code Generation for Timed Transitions in pCharts

Abstract: This paper describes timed transition in pCharts, a variation of statecharts extended with probabilistic transitions, costs/rewards, and state invariants. Timed transitions with nondeterministic and stochastic timing can be used for the specification and analysis of real-time systems. We present a translation scheme for timed transition of pCharts into probabilistic timed automata (PTA) and executable C code, as implemented in our tool pState. To illustrate the development process, we analyze the power consump… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
4
0

Year Published

2015
2015
2021
2021

Publication Types

Select...
3
1

Relationship

2
2

Authors

Journals

citations
Cited by 4 publications
(4 citation statements)
references
References 20 publications
0
4
0
Order By: Relevance
“…Probabilistic junctions, also used in other techniques [58,59], are a special form of junction introduced to capture probabilistic choices. Only transitions from a probabilistic junction can be labelled with probability values, which must add up to 1.…”
Section: Notationmentioning
confidence: 99%
“…Probabilistic junctions, also used in other techniques [58,59], are a special form of junction introduced to capture probabilistic choices. Only transitions from a probabilistic junction can be labelled with probability values, which must add up to 1.…”
Section: Notationmentioning
confidence: 99%
“…Model checking allows to explore all possible system states in a systematic manner. In our approach, the system model is described by pCharts [21], a version of hierarchical state machines extended with probabilistic transitions, timed transitions, stochastic timing, and costs/rewards. Using pCharts we can specify both a system and its environment.…”
Section: Figure 1: Conventional Software Design Processmentioning
confidence: 99%
“…The same formalism, pCharts is used to describe the system model and the environment (unlike in classical discrete event systems). Code is generated according to the algorithm presented in [21], and tested on a number of case studies. Although it is not formally proved to be correct, we believe that generated code is trustworthy.…”
Section: Figure 1: Conventional Software Design Processmentioning
confidence: 99%
“…For (sub-) charts without probabilistic transitions, executable code can be generated. Thus pCharts can model both the system under development as well as its environment [28].…”
Section: Introductionmentioning
confidence: 99%