AI Chat AI Image Generator AI Video Text to Speech

Timed Concurrent State Machines

10/22/2017

∙

by Wiktor B. Daszczuk, et al.

∙

∙

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.

page 1

page 2

page 3

page 4

research

∙ 10/24/2017

Macrogeneration and Automata Libraries For COSMA design environment

In ICS, WUT a COSMA design environment is being developed. COSMA is base...

0 Wiktor B. Daszczuk, et al. ∙

research

∙ 12/03/2018

Conscious enactive computation

This paper looks at recent debates in the enactivist literature on compu...

0 Daniel Estrada, et al. ∙

research

∙ 12/21/2022

Fair Must Testing for I/O Automata

The concept of must testing is naturally parametrised with a chosen comp...

0 Rob van Glabbeek, et al. ∙

research

∙ 07/18/2023

Crème de la Crem: Composable Representable Executable Machines (Architectural Pearl)

In this paper we describe how to build software architectures as a compo...

0 Marco Perone, et al. ∙

research

∙ 12/05/2018

Sculptures in Concurrency

We give a formalization of Pratt's intuitive sculpting process for highe...

0 Uli Fahrenberg, et al. ∙

research

∙ 12/09/2022

Efficient Convex Zone Merging in Parametric Timed Automata

Parametric timed automata are a powerful formalism for reasoning on conc...

0 Étienne André, et al. ∙

research

∙ 10/16/2017

A Hierarchy of Scheduler Classes for Stochastic Automata

Stochastic automata are a formal compositional model for concurrent stoc...

0 Pedro R. D'Argenio, et al. ∙