Zaloguj się

Gotowe bibliografie tematyczne / Timed automata / Artykuły w czasopismach

Kliknij ten link, aby zobaczyć inne rodzaje publikacji na ten temat: Timed automata.

Artykuły w czasopismach na temat „Timed automata”

Autor: Grafiati

Data publikacji: 4 czerwca 2021

Data aktualizacji: 25 lipca 2025

Utwórz poprawne odniesienie w stylach APA, MLA, Chicago, Harvard i wielu innych

Wybierz rodzaj źródła:

Sprawdź 50 najlepszych artykułów w czasopismach naukowych na temat „Timed automata”.

Przycisk „Dodaj do bibliografii” jest dostępny obok każdej pracy w bibliografii. Użyj go – a my automatycznie utworzymy odniesienie bibliograficzne do wybranej pracy w stylu cytowania, którego potrzebujesz: APA, MLA, Harvard, Chicago, Vancouver itp.

Możesz również pobrać pełny tekst publikacji naukowej w formacie „.pdf” i przeczytać adnotację do pracy online, jeśli odpowiednie parametry są dostępne w metadanych.

Przeglądaj artykuły w czasopismach z różnych dziedzin i twórz odpowiednie bibliografie.

1

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

Pełny tekst źródła

Streszczenie:

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 aut

Style APA, Harvard, Vancouver, ISO itp.

2

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

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

3

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.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

4

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.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

5

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

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

6

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

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

7

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.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

8

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

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

9

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

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

10

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.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

11

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

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

12

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.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

13

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 (2021): 229–53. http://dx.doi.org/10.1007/s10009-021-00606-2.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

14

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

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

15

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

Pełny tekst źródła

Streszczenie:

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 p

Style APA, Harvard, Vancouver, ISO itp.

16

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

Pełny tekst źródła

Streszczenie:

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.

Style APA, Harvard, Vancouver, ISO itp.

17

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

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

18

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

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

19

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.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

20

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

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

21

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

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

22

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

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

23

Mason, Kahn, and Padmanabhan Krishnan. "Decomposition of Timed Automata." JUCS - Journal of Universal Computer Science 5, no. (9) (1999): 574–87. https://doi.org/10.3217/jucs-005-09-0574.

Pełny tekst źródła

Streszczenie:

In this paper we extend the notion of homomorphisms and decomposition to timed automata. This is based on the classical Hartmanis-Stearns decomposition results for finite state automata. As in the classical theory, the existence of non-trivial orthogonal partitions is both necessary and sufficient for non-trivial decompositions. Of course, now these partitions have to include both the set of states and the set of timers (or clocks) in the system. We present an example which illustrate the various issues.

Style APA, Harvard, Vancouver, ISO itp.

24

Nabiałek, Wojciech, Agata Janowska, and Paweł Janowski. "Translation of Timed Promela to Timed Automata with Discrete Data." Fundamenta Informaticae 85, no. 1-4 (2008): 409–24. https://doi.org/10.3233/fun-2008-851-428.

Pełny tekst źródła

Streszczenie:

The aim of the work is twofold. In order to face the problem of modeling time constraints in Promela, a timed extension of the language is presented. Next, timed Promela is translated to timed automata with discrete data, that is timed automata extended with integer variables. The translation enables verification of Promela specifications via tools accepting timed automata as input, such as VerICS or Uppaal. The translation is illustrated with a well known example of Fischer's mutual exclusion protocol. Some experimental results are also presented.

Style APA, Harvard, Vancouver, ISO itp.

25

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.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

26

Zbrzezny, Andrzej, and Bożena Woźna. "Towards Verification of Java Programs in perICS." Fundamenta Informaticae 85, no. 1-4 (2008): 533–48. https://doi.org/10.3233/fun-2008-851-436.

Pełny tekst źródła

Streszczenie:

VerICS is a tool for the automated verification of timed automata and protocols written in both the Intermediate Language and the specification language Estelle. Recently, the tool has been extended to work with Timed Automata with Discrete Data and with multi-agent systems. This paper presents a prototype Timed Automata with Discrete Data model of Java programs. In addition, we show how to use the model together with the verification core of VerICS to validate the well-known alternating bit protocol written in Java.

Style APA, Harvard, Vancouver, ISO itp.

27

Krishnan, Padmanabhan. "Decomposing Timed Push Down Automata." Fundamenta Informaticae 45, no. 3 (2001): 215–29. https://doi.org/10.3233/fun-2001-45305.

Pełny tekst źródła

Streszczenie:

In this paper we define a particular type of timed push down automata. We show that the emptiness problem for this class is decidable. We also present a notion of homomorphism and parallel decomposition for these automata. These notions are a generalisation of the homomorphism and decomposition via partitions for finite automata.

Style APA, Harvard, Vancouver, ISO itp.

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.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

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.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

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.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

31

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

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

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 (2000): 565–84. http://dx.doi.org/10.1051/ita:2000131.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

33

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

Pełny tekst źródła

Streszczenie:

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

Style APA, Harvard, Vancouver, ISO itp.

34

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

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

35

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

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

36

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.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

37

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

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

38

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 (2008): 45–84. http://dx.doi.org/10.1007/s10703-008-0056-7.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

39

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

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

40

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.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

41

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 (2022): 12946. http://dx.doi.org/10.3390/app122412946.

Pełny tekst źródła

Streszczenie:

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 inclusio

Style APA, Harvard, Vancouver, ISO itp.

42

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.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

43

Reniers, M. A., and R. L. P. Tielen. "Expressivity of Timed Discrete Event Systems and Timed Automata." IFAC-PapersOnLine 58, no. 1 (2024): 216–21. http://dx.doi.org/10.1016/j.ifacol.2024.07.037.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

44

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

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

45

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.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

46

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

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

47

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 (2022): 3949–58. http://dx.doi.org/10.1609/aaai.v36i4.20311.

Pełny tekst źródła

Streszczenie:

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 on

Style APA, Harvard, Vancouver, ISO itp.

48

Bouzenada, Ahmed, Djamel Eddine Saidouni, and Gregorio Díaz. "A Finite Representation of Durational Action Timed Automata Semantics." Mathematics 12, no. 24 (2024): 4008. https://doi.org/10.3390/math12244008.

Pełny tekst źródła

Streszczenie:

Durational action timed automata (daTAs) are state transition systems like timed automata (TAs) that capture information regarding the concurrent execution of actions and their durations using maximality-based semantics. As the underlying semantics of daTAs are infinite due to the modeling of time progress, conventional model checking techniques become impractical for systems specified using daTAs. Therefore, a finite abstract representation of daTA behavior is required to enable model checking for such system specifications. For that, we propose a finite abstraction of the underlying semantic

Style APA, Harvard, Vancouver, ISO itp.

49

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

Pełny tekst źródła

Streszczenie:

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 semin

Style APA, Harvard, Vancouver, ISO itp.

50

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

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Oferujemy zniżki na wszystkie plany premium dla autorów, których prace zostały uwzględnione w tematycznych zestawieniach literatury. Skontaktuj się z nami, aby uzyskać unikalny kod promocyjny!