A Uniform Framework for Timed Automata and Beyond

11/28/2017
by   Tomasz Brengos, et al.
0

Timed automata, and machines alike, currently lack a general mathematical characterisation. This work introduces a uniform understanding of these devices that encompasses known behavioural equivalences such as timed bisimulations and timed language equivalences as well as their weak and time-abstract counterparts. All these notions of equivalence between systems are naturally organised in expressiveness spectra based on their discriminating power; these spectra are shown to be independent from any particular computational effect expressed by the systems under scrutiny. As an application, timed automata and their quantitative extensions such as probabilistic ones are studied.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/28/2019

Weak equivalence of higher-dimensional automata

This paper introduces a notion of weak equivalence for higher-dimensiona...
research
05/29/2018

Convex Language Semantics for Nondeterministic Probabilistic Automata

We explore language semantics for automata combining probabilistic and n...
research
10/02/2020

Combining Weak Distributive Laws: Application to Up-To Techniques

The coalgebraic modelling of alternating automata and of probabilistic a...
research
07/27/2023

Graded Semantics and Graded Logics for Eilenberg-Moore Coalgebras

Coalgebra, as the abstract study of state-based systems, comes naturally...
research
02/26/2011

Bisimulations for fuzzy automata

Bisimulations have been widely used in many areas of computer science to...
research
07/01/2020

Minimal witnesses for probabilistic timed automata

Witnessing subsystems have proven to be a useful concept in the analysis...
research
10/20/2017

The Emptiness Problem for Valence Automata over Graph Monoids

This work studies which storage mechanisms in automata permit decidabili...

Please sign up or login with your details

Forgot password? Click here to reset