English

Timed Concurrent State Machines

Logic in Computer Science 2017-10-24 v1 Distributed, Parallel, and Cluster Computing Formal Languages and Automata Theory

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.

Keywords

Cite

@article{arxiv.1710.07997,
  title  = {Timed Concurrent State Machines},
  author = {Wiktor B. Daszczuk},
  journal= {arXiv preprint arXiv:1710.07997},
  year   = {2017}
}

Comments

13 pages, 4 figures

R2 v1 2026-06-22T22:21:59.573Z