Log in

Relevant bibliographies by topics / Timed automata / Journal articles

To see the other types of publications on this topic, follow the link: Timed automata.

Journal articles on the topic 'Timed automata'

Author: Grafiati

Published: 4 June 2021

Last updated: 8 June 2024

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the top 50 journal articles for your research on the topic 'Timed automata.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Browse journal articles on a wide variety of disciplines and organise your bibliography correctly.

1

Boumaza, Amel, and Ramdane Maamri. "Mapping OWL-S Process Model to Timed Automata." Journal of Information Technology Research 11, no. 1 (January 2018): 29–48. http://dx.doi.org/10.4018/jitr.2018010103.

Full text

Abstract:

The conversion of web services to semantic web comes the opportunity to automate various tasks. OWL-S plays a key role in describing web services behaviour. While ontology-based semantics given to OWL-S is structural rather than behaviourally oriented, we cannot automate an essential task in this field, verification. In this article, the mapping of OWL-S process model to Timed automata is investigated, which is a suitable formalism for real time systems modeling and automatic verification. Hence, this has led to not only enabling automatic verification but also covering problems related to automated verification of temporal quantitative properties as bounded liveness property. As a starting point, the OWL-S and sub entry of time ontologies for describing the timed behaviour of services has been chosen. A defined set of mapping rules is used to automatically encode control constructs defined in OWL-S and temporal information into timed automata. Also, it is shown how a Uppaal checker is used to check required properties formulated in TCTL. Finally, an EClinic case study is used to illustrate the technique.

APA, Harvard, Vancouver, ISO, and other styles

2

FIGUEIRA, DIEGO, PIOTR HOFMAN, and SŁAWOMIR LASOTA. "Relating timed and register automata." Mathematical Structures in Computer Science 26, no. 6 (December 5, 2014): 993–1021. http://dx.doi.org/10.1017/s0960129514000322.

Full text

Abstract:

Timed and register automata are well-known models of computation over timed and data words, respectively. The former has clocks that allow to test the lapse of time between two events, whilst the latter includes registers that can store data values for later comparison. Although these two models behave differently in appearance, several decision problems have the same (un)decidability and complexity results for both models. As a prominent example, emptiness is decidable for alternating automata with one clock or register, both with non-primitive recursive complexity. This is not by chance.This work confirms that there is indeed a tight relationship between the two models. We show that a run of a timed automaton can be simulated by a register automaton over ordered data domain, and conversely that a run of a register automaton can be simulated by a timed automaton. These are exponential time reductions hold both in the finite and infinite words settings. Our results allow to transfer decidability results back and forth between these two kinds of models, as well complexity results modulo an exponential time reduction. We justify the usefulness of these reductions by obtaining new results on register automata.

APA, Harvard, Vancouver, ISO, and other styles

3

Nielsen, Brian, and Arne Skou. "Automated test generation from timed automata." International Journal on Software Tools for Technology Transfer 5, no. 1 (June 17, 2003): 59–77. http://dx.doi.org/10.1007/s10009-002-0094-1.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Lanotte, Ruggero, Andrea Maggiolo-Schettini, and Adriano Peron. "Timed Cooperating Automata." Fundamenta Informaticae 43, no. 1-4 (2000): 153–73. http://dx.doi.org/10.3233/fi-2000-43123408.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Barbuti, Roberto, Andrea Maggiolo-Schettini, Paolo Milazzo, and Luca Tesei. "Timed P Automata." Fundamenta Informaticae 94, no. 1 (2009): 1–19. http://dx.doi.org/10.3233/fi-2009-114.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Jin Song Dong, Ping Hao, Shengchao Qin, Jun Sun, and Wang Yi. "Timed Automata Patterns." IEEE Transactions on Software Engineering 34, no. 6 (November 2008): 844–59. http://dx.doi.org/10.1109/tse.2008.52.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Lasota, Slawomir, and Igor Walukiewicz. "Alternating timed automata." ACM Transactions on Computational Logic 9, no. 2 (March 2008): 1–27. http://dx.doi.org/10.1145/1342991.1342994.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Krishnan, Padmanabhan. "Distributed Timed Automata." Electronic Notes in Theoretical Computer Science 28 (2000): 5–21. http://dx.doi.org/10.1016/s1571-0661(05)80627-9.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Springintveld, Jan, Frits Vaandrager, and Pedro R. D'Argenio. "Testing timed automata." Theoretical Computer Science 254, no. 1-2 (March 2001): 225–57. http://dx.doi.org/10.1016/s0304-3975(99)00134-6.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Bouyer, Patricia, Catherine Dufourd, Emmanuel Fleury, and Antoine Petit. "Updatable timed automata." Theoretical Computer Science 321, no. 2-3 (August 2004): 291–345. http://dx.doi.org/10.1016/j.tcs.2004.04.003.

Full text

APA, Harvard, Vancouver, ISO, and other styles

11

Sankur, Ocan, Patricia Bouyer, and Nicolas Markey. "Shrinking timed automata." Information and Computation 234 (February 2014): 107–32. http://dx.doi.org/10.1016/j.ic.2014.01.002.

Full text

APA, Harvard, Vancouver, ISO, and other styles

12

Lin, Huimin, and Wang Yi. "Axiomatising timed automata." Acta Informatica 38, no. 4 (January 1, 2002): 277–305. http://dx.doi.org/10.1007/s236-002-8035-2.

Full text

APA, Harvard, Vancouver, ISO, and other styles

13

Barbuti, Roberto, Andrea Maggiolo-Schettini, Paolo Milazzo, and Luca Tesei. "Timed P Automata." Electronic Notes in Theoretical Computer Science 227 (January 2009): 21–36. http://dx.doi.org/10.1016/j.entcs.2008.12.102.

Full text

APA, Harvard, Vancouver, ISO, and other styles

14

Bouyer, Patricia, Léo Henry, Samy Jaziri, Thierry Jéron, and Nicolas Markey. "Diagnosing timed automata using timed markings." International Journal on Software Tools for Technology Transfer 23, no. 2 (March 27, 2021): 229–53. http://dx.doi.org/10.1007/s10009-021-00606-2.

Full text

APA, Harvard, Vancouver, ISO, and other styles

15

LI, GUOQIANG, XIAOJUAN CAI, and SHOJI YUEN. "MODELING AND ANALYSIS OF REAL-TIME SYSTEMS WITH MUTEX COMPONENTS." International Journal of Foundations of Computer Science 23, no. 04 (June 2012): 831–51. http://dx.doi.org/10.1142/s0129054112400382.

Full text

Abstract:

Timed automata are commonly recognized as a formal behavioral model for real-time systems. For compositional system design, parallel composition of timed automata as proposed by Larsen et al. [22] is useful. Although parallel composition provides a general method for system construction, in the low level behavior, components often behave sequentially by passing control via communication. This paper proposes a behavioral model, named controller automata, to combine timed automata by focusing on the control passing between components. In a controller automaton, to each state a timed automaton is assigned. A timed automaton at a state may be preempted by the control passing to another state by a global labeled transition. A controller automaton properly extends the expressive power because of the stack, but this can make the reachability problem undecidable. Given a strict partial order over states, we show that this problem can be avoided and a controller automaton can be faithfully translated into a timed automaton.

APA, Harvard, Vancouver, ISO, and other styles

16

Srivathsan, B. "Reachability in timed automata." ACM SIGLOG News 9, no. 3 (July 2022): 6–28. http://dx.doi.org/10.1145/3559736.3559738.

Full text

Abstract:

Given a timed automaton A and a control state q , does there exist a run of A that visits q ? This problem of control state reachability in timed automata was posed in [Alur and Dill 1994] and is known to be PSPACE-complete. One does not hope to have efficient algorithms for this problem, in theory. Nevertheless, research in this subject over the last three decades has led to industry-strength award-winning tools implementing this problem. This topic continues to be an active area of research even now. In this article, we present one successful algorithmic framework for attacking this problem.

APA, Harvard, Vancouver, ISO, and other styles

17

Cornanguer, Lénaïg, Christine Largouët, Laurence Rozé, and Alexandre Termier. "TAG: Learning Timed Automata from Logs." Proceedings of the AAAI Conference on Artificial Intelligence 36, no. 4 (June 28, 2022): 3949–58. http://dx.doi.org/10.1609/aaai.v36i4.20311.

Full text

Abstract:

Event logs are often one of the main sources of information to understand the behavior of a system. While numerous approaches have extracted partial information from event logs, in this work, we aim at inferring a global model of a system from its event logs. We consider real-time systems, which can be modeled with Timed Automata: our approach is thus a Timed Automata learner. There is a handful of related work, however, they might require a lot of parameters or produce Timed Automata that either are undeterministic or lack precision. In contrast, our proposed approach, called TAG, requires only one parameter and learns a deterministic Timed Automaton having a good tradeoff between accuracy and complexity of the automata. This allows getting an interpretable and accurate global model of the real-time system considered. Our experiments compare our approach to the related work and demonstrate its merits.

APA, Harvard, Vancouver, ISO, and other styles

18

Petitjean, Eric, and Hacène Fouchal. "From Timed Automata to Testable Untimed Automata." IFAC Proceedings Volumes 32, no. 1 (May 1999): 189–94. http://dx.doi.org/10.1016/s1474-6670(17)39986-x.

Full text

APA, Harvard, Vancouver, ISO, and other styles

19

Beauquier, Danièle. "On probabilistic timed automata." Theoretical Computer Science 292, no. 1 (January 2003): 65–84. http://dx.doi.org/10.1016/s0304-3975(01)00215-8.

Full text

APA, Harvard, Vancouver, ISO, and other styles

20

Lanotte, Ruggero, Andrea Maggiolo-Schettini, and Simone Tini. "Concurrency in timed automata." Theoretical Computer Science 309, no. 1-3 (December 2003): 503–27. http://dx.doi.org/10.1016/s0304-3975(03)00316-5.

Full text

APA, Harvard, Vancouver, ISO, and other styles

21

Fahrenberg, Uli. "Higher-Dimensional Timed Automata." IFAC-PapersOnLine 51, no. 16 (2018): 109–14. http://dx.doi.org/10.1016/j.ifacol.2018.08.019.

Full text

APA, Harvard, Vancouver, ISO, and other styles

22

Herrmann, Philippe. "Timed automata and recognizability." Information Processing Letters 65, no. 6 (March 1998): 313–18. http://dx.doi.org/10.1016/s0020-0190(97)00217-2.

Full text

APA, Harvard, Vancouver, ISO, and other styles

23

Abdeddaı¨m, Yasmina, Eugene Asarin, and Oded Maler. "Scheduling with timed automata." Theoretical Computer Science 354, no. 2 (March 2006): 272–300. http://dx.doi.org/10.1016/j.tcs.2005.11.018.

Full text

APA, Harvard, Vancouver, ISO, and other styles

24

Basile, Davide, Maurice H. ter Beek, and Axel Legay. "Timed service contract automata." Innovations in Systems and Software Engineering 16, no. 2 (August 29, 2019): 199–214. http://dx.doi.org/10.1007/s11334-019-00353-3.

Full text

APA, Harvard, Vancouver, ISO, and other styles

25

Sproston, Jeremy. "Probabilistic Timed Automata with Clock-Dependent Probabilities." Fundamenta Informaticae 178, no. 1-2 (January 13, 2021): 101–38. http://dx.doi.org/10.3233/fi-2021-2000.

Full text

Abstract:

Probabilistic timed automata are classical timed automata extended with discrete probability distributions over edges. We introduce clock-dependent probabilistic timed automata, a variant of probabilistic timed automata in which transition probabilities can depend linearly on clock values. Clock-dependent probabilistic timed automata allow the modelling of a continuous relationship between time passage and the likelihood of system events. We show that the problem of deciding whether the maximum probability of reaching a certain location is above a threshold is undecidable for clock-dependent probabilistic timed automata. On the positive side, we show that the maximum and minimum probability of reaching a certain location in clock-dependent probabilistic timed automata can be approximated using a region-graph-based approach.

APA, Harvard, Vancouver, ISO, and other styles

26

Scharbarg, Jérome Ermont Jean-Luc, and Christian Fraboul. "TIMED ANALYSIS OF EMBEDDED NETWORKS USING TIMED AUTOMATA." IFAC Proceedings Volumes 40, no. 22 (2007): 255–60. http://dx.doi.org/10.3182/20071107-3-fr-3907.00035.

Full text

APA, Harvard, Vancouver, ISO, and other styles

27

Viswanathan, Mahesh. "Automata column." ACM SIGLOG News 9, no. 3 (July 2022): 5. http://dx.doi.org/10.1145/3559736.3559737.

Full text

Abstract:

For the Automata Theory Column, we have an article by B. Srivathsan on the reachability problem in timed automata. Ever since timed automata were introduced by Alur and Dill, they have been widely used in the verification of real-time systems. Their appeal comes from a simple definition that couples expressiveness with computational tractability. The control state reachability problem, which asks if there is a computation of a given timed automaton that reaches a given control state, is an important problem in this context and was shown to be decidable in PSPACE by Alur and Dill in their seminal paper. However, because of the central role this problem plays in verification, it has been extensively studied in the past 30 years. In this issue, Srivathsan lucidly articulates the main principles underlying modern approaches to solving this problem.

APA, Harvard, Vancouver, ISO, and other styles

28

Abdulla, Parosh Aziz, Mohamed Faouzi Atig, and Jari Stenman. "Zenoness for Timed Pushdown Automata." Electronic Proceedings in Theoretical Computer Science 140 (February 23, 2014): 35–47. http://dx.doi.org/10.4204/eptcs.140.3.

Full text

APA, Harvard, Vancouver, ISO, and other styles

29

Larsen, Kim G. "Playing Games with Timed Automata." Electronic Proceedings in Theoretical Computer Science 166 (October 26, 2014): 2–3. http://dx.doi.org/10.4204/eptcs.166.2.

Full text

APA, Harvard, Vancouver, ISO, and other styles

30

Figueira, Diego, Piotr Hofman, and Sławomir Lasota. "Relating timed and register automata." Electronic Proceedings in Theoretical Computer Science 41 (November 28, 2010): 61–75. http://dx.doi.org/10.4204/eptcs.41.5.

Full text

APA, Harvard, Vancouver, ISO, and other styles

31

Fontana, Peter, and Rance Cleaveland. "A menagerie of timed automata." ACM Computing Surveys 46, no. 3 (January 2014): 1–56. http://dx.doi.org/10.1145/2518102.

Full text

APA, Harvard, Vancouver, ISO, and other styles

32

Aceto, Luca, Anna Ingólfsdóttir, Mikkel Lykke Pedersen, and Jan Poulsen. "Characteristic Formulae for Timed Automata." RAIRO - Theoretical Informatics and Applications 34, no. 6 (November 2000): 565–84. http://dx.doi.org/10.1051/ita:2000131.

Full text

APA, Harvard, Vancouver, ISO, and other styles

33

Li, Guoqiang, Li Liu, and Akira Fukuda. "Asynchronous multi-process timed automata." Software Quality Journal 26, no. 3 (June 28, 2017): 961–89. http://dx.doi.org/10.1007/s11219-017-9380-8.

Full text

APA, Harvard, Vancouver, ISO, and other styles

34

Lynch, Nancy, and Frits Vaandrager. "Action transducers and timed automata." Formal Aspects of Computing 8, no. 5 (September 1996): 499–538. http://dx.doi.org/10.1007/bf01211907.

Full text

APA, Harvard, Vancouver, ISO, and other styles

35

Herbreteau, Frédéric, B. Srivathsan, and Igor Walukiewicz. "Better abstractions for timed automata." Information and Computation 251 (December 2016): 67–90. http://dx.doi.org/10.1016/j.ic.2016.07.004.

Full text

APA, Harvard, Vancouver, ISO, and other styles

36

Barbuti, Roberto, and Luca Tesei. "Timed automata with urgent transitions." Acta Informatica 40, no. 5 (March 1, 2004): 317–47. http://dx.doi.org/10.1007/s00236-003-0135-6.

Full text

APA, Harvard, Vancouver, ISO, and other styles

37

De Wulf, Martin, Laurent Doyen, Nicolas Markey, and Jean-François Raskin. "Robust safety of timed automata." Formal Methods in System Design 33, no. 1-3 (September 13, 2008): 45–84. http://dx.doi.org/10.1007/s10703-008-0056-7.

Full text

APA, Harvard, Vancouver, ISO, and other styles

38

Alur, Rajeev, and David L. Dill. "A theory of timed automata." Theoretical Computer Science 126, no. 2 (April 1994): 183–235. http://dx.doi.org/10.1016/0304-3975(94)90010-8.

Full text

APA, Harvard, Vancouver, ISO, and other styles

39

Sun, Jun. "Are Timed Automata Bad for a Specification Language? Language Inclusion Checking for Timed Automata." Electronic Proceedings in Theoretical Computer Science 156 (July 8, 2014): 2. http://dx.doi.org/10.4204/eptcs.156.2.

Full text

APA, Harvard, Vancouver, ISO, and other styles

40

Kurkowski, Mirosław, and Wojciech Penczek. "Timed Automata Based Model Checking of Timed Security Protocols." Fundamenta Informaticae 93, no. 1-3 (2009): 245–59. http://dx.doi.org/10.3233/fi-2009-0100.

Full text

APA, Harvard, Vancouver, ISO, and other styles

41

Braberman, Víctor, and Alfredo Olivero. "Extending Timed Automata for Compositional Modeling Healthy Timed Systems." Electronic Notes in Theoretical Computer Science 52, no. 3 (May 2002): 227–45. http://dx.doi.org/10.1016/s1571-0661(04)00226-9.

Full text

APA, Harvard, Vancouver, ISO, and other styles

42

Kokash, Natallia, Mohammad Mahdi Jaghoori, and Farhad Arbab. "From Timed Reo Networks to Networks of Timed Automata." Electronic Notes in Theoretical Computer Science 295 (May 2013): 11–29. http://dx.doi.org/10.1016/j.entcs.2013.04.004.

Full text

APA, Harvard, Vancouver, ISO, and other styles

43

Wang, Ting, Yan Shen, Tieming Chen, Baiyang Ji, Tiantian Zhu, and Mingqi Lv. "Language Inclusion Checking of Timed Automata Based on Property Patterns." Applied Sciences 12, no. 24 (December 16, 2022): 12946. http://dx.doi.org/10.3390/app122412946.

Full text

Abstract:

The language inclusion checking of timed automata is described as the following: given two timed automata M and N, where M is a system model and N is a specification model (which represents the properties that the system needs to satisfy), check whether the language of M is included in the language of N. The language inclusion checking of timed automata can detect whether a system model satisfies a given property under the time constraints. There exist excellent studies on verifying real-time systems using timed automata. However, there is no thorough method of timed automata language inclusion checking for real-life systems. Therefore, this paper proposes a language inclusion checking method of timed automata based on the property patterns. On the one hand, we summarize commonly used property patterns described by timed automata, which can guide people to model the properties with time constraints. On the other hand, the system model M often contains a large number of events, but in general, the property N only needs to pay attention to the sequences and time limits of a few events. Therefore, the timed automata language inclusion checking algorithm is improved so that only the concerned events are required. Our method is applied to a water disposal system and it is also evaluated using benchmark systems. The determinization problem of timed automata is undecidable, which may lead to an infinite state space. However, our method is still practical because the properties established according to property patterns are often deterministic.

APA, Harvard, Vancouver, ISO, and other styles

44

Alur, Rajeev, Limor Fix, and Thomas A. Henzinger. "Event-clock automata: a determinizable class of timed automata." Theoretical Computer Science 211, no. 1-2 (January 1999): 253–73. http://dx.doi.org/10.1016/s0304-3975(97)00173-4.

Full text

APA, Harvard, Vancouver, ISO, and other styles

45

Aybar, Aydın. "Decentralized Controller Design for Forbidden States Avoidance in Timed Discrete Event Systems." International Journal of Computers Communications & Control 5, no. 4 (November 1, 2010): 447. http://dx.doi.org/10.15837/ijccc.2010.4.2494.

Full text

Abstract:

A decentralized controller design approach is developed for the timed discrete event systems which are modelled by timed automata in this work. An approach, called augmentation, is presented to obtain the new modelling method such that each unit delay of any event represents a pair of new state and event. The augmented automata model, obtained by using this approach, is considered to design a decentralized controller. This controller design approach is developed such that the local controller is designed for each subautomaton, obtained by using overlapping decompositions and expansions and these controllers are then combined to obtain a decentralized controller for the given timed automaton. The designed decentralized controller guarantees the unreachability of a forbidden state in the considered automaton.

APA, Harvard, Vancouver, ISO, and other styles

46

Lucas, Philipp. "Timed Semantics of Message Sequence Charts Based on Timed Automata." Electronic Notes in Theoretical Computer Science 65, no. 6 (June 2002): 160–79. http://dx.doi.org/10.1016/s1571-0661(04)80475-4.

Full text

APA, Harvard, Vancouver, ISO, and other styles

47

Kara, Mustafa Yavuz, and Ebru Aydin Gol. "Adaptive Cruise Control with Timed Automata." IFAC-PapersOnLine 53, no. 2 (2020): 1918–23. http://dx.doi.org/10.1016/j.ifacol.2020.12.2585.

Full text

APA, Harvard, Vancouver, ISO, and other styles

48

Kitouni, Ilham. "Reducing Timed Automata: A New Approach." International Journal of Information Sciences and Techniques 2, no. 4 (July 31, 2012): 15–27. http://dx.doi.org/10.5121/ijist.2012.2402.

Full text

APA, Harvard, Vancouver, ISO, and other styles

49

Kaczmarczyk, Václav, Zdeněk Bradáĕ, and Michal Ser. "On simulation methods for timed automata." IFAC Proceedings Volumes 43, no. 24 (2010): 221–26. http://dx.doi.org/10.3182/20101006-2-pl-4019.00042.

Full text

APA, Harvard, Vancouver, ISO, and other styles

50

Bhave, Devendra, Shankara Narayanan Krishna, and Ashutosh Trivedi. "On Nonlinear Prices in Timed Automata." Electronic Proceedings in Theoretical Computer Science 232 (December 13, 2016): 65–78. http://dx.doi.org/10.4204/eptcs.232.9.

Full text

APA, Harvard, Vancouver, ISO, and other styles

We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!