A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Filters
Distributed Timed Automata
2000
Electronical Notes in Theoretical Computer Science
Preserved Fulltext
The rst point is addressed by amalgamating nite state automata with dense time (or Alur-Dill automata) and asynchronous distributed (or Zielonka) automata over a distributed alphabet. ...
In this article we discuss (i) a model suitable for describing a distributed real-time system and (ii) a notion of implementation for such systems on a uniprocessor system. ...
In the next section we present a quick review of distributed automata and timed automata. ...
doi:10.1016/s1571-0661(05)80627-9
fatcat:ydsl5odgivhurdswljtepjfwki
Multi-timed Bisimulation for Distributed Timed Automata
[chapter]
2017
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Timed bisimulation was shown decidable for Timed Automata (TA). Distributed TA and TA with Independent Clocks (icTA) were introduced to model Distributed Real-time Systems. ...
In this paper, we first propose to extend the theory of Timed Labeled Transition Systems to Multi-Timed Labeled Transition Systems, and relate them by an extension of timed bisimulation to multi-timed ...
In this paper, we study two variants of TA called Distributed Timed Automata (DTA) and Timed Automata with Independent Clocks (icTA) proposed by [11, 1, 16] to model DTS, where the clocks are not necessarily ...
doi:10.1007/978-3-319-57288-8_4
fatcat:dkzuzdonvndcph7m7r4ak77uoi
Distributed Behavioral Cartography of Timed Automata
2014
Proceedings of the 21st European MPI Users' Group Meeting on - EuroMPI/ASIA '14
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
We propose here an attempt to distribute a synthesis algorithm, the behavioral cartography, and we evaluate two work distribution algorithms. ...
Real-time systems, characterized by a set of timings constants (internal delays, timers, clock speeds), need to be perfectly reliable. ...
Parametric Timed Automata Timed Automata (TA) are finite state automata (made of control states and transitions labeled with actions), extended with clocks, i.e., real-valued variables evolving at the ...
doi:10.1145/2642769.2642784
dblp:conf/pvm/AndreCE14
fatcat:n6yudyd4sjejlbjvu7fz4yhfqm
Distributed Timed Automata with Independently Evolving Clocks
[chapter]
2008
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
We propose a model of distributed timed systems where each component is a timed automaton with a set of local clocks that evolve at a rate independent of the clocks of the other components. ...
However, the above works differ from ours since they consider timed words rather than untimed languages. This also explains why our automata differ from hybrid automata [9] . ...
The model Let us recall the fundamental notion of timed automata [2] . These will constitute the building blocks of our distributed timed automata. ...
doi:10.1007/978-3-540-85361-9_10
fatcat:ozrma2s43vcslfjsreulyuzc5m
Enhanced Distributed Behavioral Cartography of Parametric Timed Automata
[chapter]
2015
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Parametric timed automata (PTA) allow the specification and verification of timed systems incompletely specified, or subject to future changes. ...
Here, we present enhanced distributed algorithms to compute the cartography efficiently. Experimental results show that our new algorithms significantly outperform previous distribution techniques. ...
The notion of timed automata (TA) is a well-known formalism for specifying and verifying concurrent real-time systems. ...
doi:10.1007/978-3-319-25423-4_21
fatcat:oqxie3rxabbbfnw2ogvrsvrate
Succinct discrete time approximations of distributed hybrid automata
2010
Proceedings of the 13th ACM international conference on Hybrid systems: computation and control - HSCC '10
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2011; you can also visit the original URL.
The file type is application/pdf.
We study the discrete time behavior of such networks of hybrid automata. We show that the set of global control state sequences displayed by the network is regular. ...
We consider a network of hybrid automata that observe and control a plant whose state space is determined by a finite set of continuous variables. ...
INTRODUCTION We study the discrete time behavior of a network of hybrid automata. The network models the behavior of a set of controllers that interact with a plant in a distributed fashion. ...
doi:10.1145/1755952.1755955
dblp:conf/hybrid/ThiagarajanY10
fatcat:zu2gcb2pvfc73aojasfban26pe
Modular discrete time approximations of distributed hybrid automata
2012
Theoretical Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2012; you can also visit the original URL.
The file type is application/pdf.
We model this setting as a network of hybrid automata and study its discrete time behavior. We show that the set of global control state sequences displayed by the network is regular. ...
More importantly, we show that one can succinctly represent this regular language as a family of communicating finite state automata. ...
We use a distributed version of hybrid automata to model this rich setting. ...
doi:10.1016/j.tcs.2011.12.050
fatcat:qf7rvubznzcbjhk23gmlitwowq
Concurrency theory: timed automata, testing, program synthesis
2011
Distributed computing
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
Further, a correspondence is proved with the new class of distributed time-asynchronous automata: asynchronous compositions of timed automata in which time is allowed to progress independently between ...
Timed automata accept timed words; these are infinite sequences in which each symbol is associated with a real-valued time information. ...
Further, a correspondence is proved with the new class of distributed time-asynchronous automata: asynchronous compositions of timed automata in which time is allowed to progress independently between ...
doi:10.1007/s00446-011-0156-2
fatcat:r6z4smxgfrcwhm5yzoh7sdye7a
Using Timed Automata for Response Time Analysis of Distributed Real-Time Systems
1999
IFAC Proceedings Volumes
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2004; you can also visit the original URL.
The file type is application/pdf.
Adaptations of this technique have been made to perform Response Time Analysis RTA, accounting for jitter, blocking, distributed systems and end-to end timing constraints. ...
From this a timed hybrid automaton is generated which can be analysed automatically to predict end-to-end response times. ...
MODELLING DISTRIBUTED SYSTEMS WITH HYBRID AUTOMATA Before explaining how we translate system descriptions in PG into hybrid automata section 4.2, we rst brie y review the de nition of hybrid automata section ...
doi:10.1016/s1474-6670(17)39989-5
fatcat:cmo5m55ahnetdda7tdvpezjcmy
A Performance Study of Distributed Timed Automata Reachability Analysis
2002
Electronical Notes in Theoretical Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
We experimentally evaluate an existing distributed reachability algorithm for timed automata on a Linux Beowulf cluster. ...
The load balancing problems are caused by inclusion checking performed between symbolic states unique to the timed automaton reachability algorithm. ...
Little work on distributed reachability analysis for timed automata has been done. ...
doi:10.1016/s1571-0661(05)80388-3
fatcat:j4ovueaw65a5tm4sv3ilirc4mq
Dealing with practical limitations of distributed timed model checking for timed automata
2006
Formal methods in system design
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Zeus is a distributed model checker for timed automata that uses the backwards algorithm. It works assigning each automata location to only one processor. ...
This article explores the limitations of Zeus-like approaches for the distribution of timed model checkers. ...
Background Timed automata (Alur and Dill, 1994) are a widely used formalism to model and analyze timed systems. ...
doi:10.1007/s10703-006-0012-3
fatcat:54pm6j2l4jhdtm33egrimvz2a4
Counter Machines and Distributed Automata
[chapter]
2018
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Other Versions
These devices form a subclass of linear-time one-way cellular automata. ...
We prove the equivalence of two classes of counter machines and one class of distributed automata. ...
We also thank Martin Kutrib and Pierre Guillon for interesting discussions, especially concerning the connection of our results with the field of cellular automata. ...
doi:10.1007/978-3-319-92675-9_2
fatcat:cbnyumg5tjgzloepyhlazr7atq
Timed automata based analysis of embedded system architectures
2006
Proceedings 20th IEEE International Parallel & Distributed Processing Symposium
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
We show that timed automata can be used to model and to analyze timeliness properties of embedded system architectures. ...
Using a case study inspired by industrial practice, we present in detail how a suitable timed automata model is composed. ...
As a consequence, for each deployment diagram we need to construct a separate network of timed automata, because the functionality is distributed differently over the given hardware. ...
doi:10.1109/ipdps.2006.1639422
dblp:conf/ipps/HendriksV06
fatcat:boaagoaxqzfmteb42ye6prdfoa
A Timed-Automata Based Middleware for Time-Critical Multicore Applications
2015
2015 IEEE International Symposium on Object/Component/Service-Oriented Real-Time Distributed Computing Workshops
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
To overcome this difficulty, we represent both the models of computation and the scheduling policies by timed automata. ...
While, traditionally, they are only used for simulation and validation, we use the automata for programming. ...
system design based on the timed-automata language RT-BIP [4] . ...
doi:10.1109/isorcw.2015.55
dblp:conf/isorc/SocciPBB15a
fatcat:kekv4y7t6ng4xewqh53mte2cue
Modeling decentralized real-time control by state space partition of timed automata
2005
Ninth IEEE International Symposium on Distributed Simulation and Real-Time Applications
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
Given a set of timed automata representing a centralized real-time control system, the algorithm partitions them into a collection of interacting submachines. ...
Timed automata provide useful state machine based representations for the validation and verification of realtime control systems. ...
The centralized real-time control system, consisting of interdependent tasks, is modeled using timed automata and the decentralization is achieved by distributing the states of the timed automata over ...
doi:10.1109/distra.2005.28
dblp:conf/dsrt/SivanthiCK05
fatcat:hey6h65iije23pg7gothmdjsia
« Previous
Showing results 1 — 15 out of 59,677 results