Home
Scholarly Works
Verification and Code Generation for Timed...
Conference

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 consumption of a radio-frequency identification (RFID) tag and generate code for the PIC micro-controller.

Authors

Nokovic B; Sekerinski E

Pagination

pp. 1-10

Publisher

Association for Computing Machinery (ACM)

Publication Date

January 1, 2014

DOI

10.1145/2641483.2641522

Name of conference

Proceedings of the 2014 International C* Conference on Computer Science & Software Engineering - C3S2E '14
View published work (Non-McMaster Users)

Contact the Experts team