A study on shuffle, stopwatches and independently evolving clocks
type: Item
instance of: scholarly article
title: A study on shuffle, stopwatches and independently evolving clocks
zbMATH Open document ID: 1277.68179
author: Ruggero Lanotte
author: Cătălin Dima
published in: Distributed Computing
publication date: 2013-02-04T00:00:00Z
Mathematics Subject Classification ID: 68Q85
Mathematics Subject Classification ID: 68Q45
Mathematics Subject Classification ID: 68Q60
zbMATH DE Number: 6134266
MaRDI profile type: Publication
full work available at URL: s00446-011-0148-2
OpenAlex ID: W2014909140
cites work: Scheduling with timed automata
cites work: Distributed Timed Automata with Independently Evolving Clocks
cites work: Timed regular expressions
cites work: A theory of timed automata
cites work: Q4551179
cites work: Q4472231
cites work: Q5322945
cites work: Interrupt Timed Automata
cites work: Q4938626
cites work: Updatable timed automata
cites work: Q4807830
cites work: An algebraic approach to data languages and timed languages
cites work: Q4934330
cites work: Real-time automata
cites work: CONCUR 2005 – Concurrency Theory
cites work: Distributed Time-Asynchronous Automata
cites work: Task automata: Schedulability, decidability and undecidability
cites work: Schedulability analysis of fixed-priority systems using timed automata
cites work: What's decidable about hybrid automata?
cites work: Q4251916
cites work: Computational Logic in Multi-Agent Systems
cites work: Notes on finite asynchronous automata
DOI: 10.1007/S00446-011-0148-2
description: scientific article; zbMATH DE number 6134266