2000 character limit reached
Timed Concurrent State Machines (1710.07997v1)
Published 22 Oct 2017 in cs.LO, cs.DC, and cs.FL
Abstract: Timed Concurrent State Machines are an application of Alur's Timed Automata concept to coincidence-based (rather than interleaving) CSM modeling technique. TCSM support the idea of testing automata, allowing to specify time properties easier than temporal formulas. Also, calculation of a global state space in real-time domain (Region Concurrent State Machines) is defined, allowing to store a verified system in ready-to-verification form, and to multiply it by various testing automata.