Reachability results for timed automata with unbounded data structures
type: Item
instance of: scholarly article
title: Reachability results for timed automata with unbounded data structures
zbMATH Open document ID: 1214.68199
author: Ruggero Lanotte
author: Andrea Maggiolo-Schettini
author: Angelo Troina
published in: Acta Informatica
publication date: 2010-10-08T00:00:00Z
Mathematics Subject Classification ID: 68Q45
Mathematics Subject Classification ID: 68Q05
zbMATH DE Number: 5797365
zbMATH Keywords: systems of data management timed automata
describes a project that uses: Uppaal
describes a project that uses: Kronos
MaRDI profile type: Publication
full work available at URL: s00236-010-0121-8
OpenAlex ID: W2048551412
cites work: A theory of timed automata
cites work: Formal Methods for the Design of Real-Time Systems
cites work: A logic of authentication
cites work: Pushdown timed automata: A binary reachability characterization and safety verification.
cites work: On the security of public key protocols
cites work: Q2754157
cites work: Q4654725
cites work: Augmenting the discrete timed automaton with other data structures.
cites work: Communicating Timed Automata: The More Synchronous, the More Difficult to Verify
cites work: Q3517258
cites work: Automatic analysis of a non-repudiation protocol
cites work: Q4220896
cites work: Kronos: A verification tool for real-time systems
cites work: A calculus of durations
DOI: 10.1007/S00236-010-0121-8
description: scientific article; zbMATH DE number 5797365