Semantics and execution time of new timed statecharts

DOI10.3233/FI-2016-1414MaRDI QIDQ4589213zbMATH OpenOpenAlexFDO

Authors Jan Magott, Paweł Skrobanek

Publication date 9 November 2017

Published in Fundamenta Informaticae (Search for Journal in Brave)

Full work available at URL https://doi.org/10.3233/fi-2016-1414

zbMATH Keywords

computational complexityperformance evaluationreal-time systemsstatechartsUML

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• scientific article; zbMATH DE number 1479645
• Formal Techniques for Networked and Distributed Systems - FORTE 2005
• scientific article; zbMATH DE number 1444724
• Specification of real-time systems in UML
• Formal Techniques for Networked and Distributed Systems - FORTE 2005

Cited in

(2)

• Timed recursive state machines: expressiveness and complexity
• Timed semantics of message sequence charts based on timed automata

This page was built for publication: Semantics and execution time of new timed statecharts

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4589213)