ACM Transactions on Software Engineering and Methodology (TOSEM): Volume 22 Issue 1, February 2013
Citation Count: 10
Downloads (6 Weeks): 4, Downloads (12 Months): 52, Downloads (Overall): 466
Full text available:
Modeling and verifying complex real-time systems are challenging research problems. The de facto approach is based on Timed Automata, which are finite state automata equipped with clock variables. Timed Automata are deficient in modeling hierarchical complex systems. In this work, we propose a language called Stateful Timed CSP and an ...
PAT, Stateful Timed CSP, Zone Abstraction, Non-Zenoness
ICECCS '12: Proceedings of the 2012 IEEE 17th International Conference on Engineering of Complex Computer Systems
Publisher: IEEE Computer Society
Modeling and verifying complex real-time systems, involving timing delays, are notoriously difficult problems. Checking the correctness of a system for one particular value for each delay does not give any information for other values. It is hence interesting to reason parametrically, by considering that the delays are parameters (unknown constants) ...
CSP, parametric timed verification, model checking, robustness, refinement