Experts has a new look! Let us know what you think of the updates.

Provide feedback
Home
Scholarly Works
Verifying MITL formulae on Timed Automata...
Preprint

Verifying MITL formulae on Timed Automata considering a Continuous Time Semantics

Abstract

Timed Automata (TA) is de facto a standard modelling formalism to represent systems when the interest is the analysis of their behaviour as time

Authors

Menghi C; Bersani M; Rossi M; Pietro PS

Publication date

June 22, 2018

DOI

10.48550/arxiv.1806.08684

Preprint server

arXiv