Gotowa bibliografia na temat „Timed automata”

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

Wybierz rodzaj źródła:

Zobacz listy aktualnych artykułów, książek, rozpraw, streszczeń i innych źródeł 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.

Artykuły w czasopismach na temat "Timed automata"

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.
Więcej źródeł

Rozprawy doktorskie na temat "Timed automata"

1

Carlier, Pierre. "Verification of Stochastic Timed Automata." Thesis, Université Paris-Saclay (ComUE), 2017. http://www.theses.fr/2017SACLN058/document.

Pełny tekst źródła
Streszczenie:
La vérification est maintenant une branche très connue des sciences informatiques. Elle est cruciale lorsque l'on a affaire à des programmes informatiques dans des systèmes automatiques : on veut vérifier si un système donné est correct et s'il satisfait des propriétés nécessaires à son bon fonctionnement. Une façon d'analyser ces systèmes se fait par la modélisation mathématique. La question est alors : peut-on vérifier si le modèle satisfait les propriétés requises ? C'est ce que l'on appelle le problème du model-checking. Plusieurs modèles ont été étudiés dans la littérature. Nous portons n
Style APA, Harvard, Vancouver, ISO itp.
2

Park, Young-Saeng. "Automatic schedule computation for distributed real-time systems using timed automata." Thesis, Northumbria University, 2008. http://nrl.northumbria.ac.uk/745/.

Pełny tekst źródła
Streszczenie:
The time-triggered architecture is becoming accepted as a means of implementing scalable, safer and more reliable solutions for distributed real-time systems. In such systems, the execution of distributed software components and the communication of messages between them take place in a fixed pattern and are scheduled in advance within a given scheduling round by a global scheduling policy. The principal obstacle in the design of time-triggered systems is the difficulty of finding the static schedule for all resources which satisfies constraints on the activities within the scheduling round, s
Style APA, Harvard, Vancouver, ISO itp.
3

Amnell, Tobias. "Code synthesis for timed automata." Licentiate thesis, Uppsala universitet, Avdelningen för datorteknik, 2003. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-86154.

Pełny tekst źródła
Streszczenie:
In this thesis, we study executable behaviours of timed models. The focus is on synthesis of executable code with predictable behaviours from high level abstract models. We assume that a timed system consists of two parts: the control software and the plant (i.e. the environment to be controlled). Both are modelled as timed automata extended with real time tasks. We consider the extended timed automata as design models. We present a compilation procedure to transform design models to executable code including a run-time scheduler (run time system) preserving the correctness and schedulability
Style APA, Harvard, Vancouver, ISO itp.
4

Trivedi, Ashutosh. "Competative optimisation on timed automata." Thesis, University of Warwick, 2009. http://wrap.warwick.ac.uk/2243/.

Pełny tekst źródła
Streszczenie:
Timed automata are finite automata accompanied by a finite set of real-valued variables called clocks. Optimisation problems on timed automata are fundamental to the verification of properties of real-time systems modelled as timed automata, while the control-program synthesis problem of such systems can be modelled as a two-player game. This thesis presents a study of optimisation problems and two-player games on timed automata under a general heading of competitive optimisation on timed automata. This thesis views competitive optimisation on timed automata as a multi-stage decision process,
Style APA, Harvard, Vancouver, ISO itp.
5

Sankur, Ocan. "Robustness in timed automata : analysis, synthesis, implementation." Phd thesis, École normale supérieure de Cachan - ENS Cachan, 2013. http://tel.archives-ouvertes.fr/tel-00910333.

Pełny tekst źródła
Streszczenie:
Timed automata are a formalism to model, verify, and synthesize real-time systems. They have the advantage of having an abstract mathematical semantics, which allow formalizing and solving several verification and synthesis problems. However, timed automata are intended to design models, rather than completely describe real systems. Therefore, once the design phase is over, it remains to check whether the behavior of an actual implementation corresponds to that of the timed automaton model. An important step before implementing a system design is ensuring its robustness. This thesis considers
Style APA, Harvard, Vancouver, ISO itp.
6

Ericsson, Ann-Marie. "Deriving ECA-rules from timed-automata specifications." Thesis, University of Skövde, Department of Computer Science, 2002. http://urn.kb.se/resolve?urn=urn:nbn:se:his:diva-655.

Pełny tekst źródła
Streszczenie:
<p>Real-time systems are required to answer to external stimuli within a specified time-period. For this to be possible, the systems behaviour must be predictable. The use of active databases in real-time systems introduces unpredictability in the system, e.g. due to their use of active rules. The behaviour in active databases is usually specified in ECA-rules. Sets of ECA-rules are hard to analyse, which implies that the behaviour of the ECA-rule set is hard to predict.</p><p>The purpose of this project is to evaluate the ability to support the development of a predictable ECA-rule set. Using
Style APA, Harvard, Vancouver, ISO itp.
7

Nehme, Carl 1981. "The VAT tool : automatic transformation of VHDL to timed automata." Thesis, Massachusetts Institute of Technology, 2004. http://hdl.handle.net/1721.1/17790.

Pełny tekst źródła
Streszczenie:
Thesis (S.M.)--Massachusetts Institute of Technology, Dept. of Aeronautics and Astronautics, 2004.<br>Includes bibliographical references (leaves 61-66).<br>Embedded systems have become an integral part of the systems we use today. These types of systems are constrained by both stringent time requirements and limited resource availability. Traditionally, high-integrity embedded systems operated on well understood hardware platforms. The emergence of inexpensive FPGAs (Field Programmable Gate Arrays) and ASICs (Application Specific Integrated Circuits) as operational platforms for embedded soft
Style APA, Harvard, Vancouver, ISO itp.
8

Hagman, Mikael. "Instrumentation of timed automata for formal verification of timed properties." Thesis, Linköping University, Department of Computer and Information Science, 2007. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-9861.

Pełny tekst źródła
Streszczenie:
<p>Embedded systems are used in many technical products of today. The tendency also points to the fact that they are in many ways becoming more and more complex as technology advances. Systems like advanced avionics, air bags, ABS brakes or any real-time embedded system requires reliability, correctness and timeliness. This puts hard pressure on designers, analyzers and developers. The need for high performance and non failing systems has therefore led to a growing interest in modeling and verification of component-based embedded systems in order to reduce costs and simplify design and develop
Style APA, Harvard, Vancouver, ISO itp.
9

Mavrommatis, Panayiotis P. "Simulation of timed input/output automata." Thesis, Massachusetts Institute of Technology, 2006. http://hdl.handle.net/1721.1/36395.

Pełny tekst źródła
Streszczenie:
Thesis (M. Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2006.<br>This electronic version was submitted by the student author. The certified thesis is available in the Institute Archives and Special Collections.<br>Includes bibliographical references (p. 73-74).<br>This Master of Engineering Thesis describes the design, implementation, and usage of the TIOA Simulator. The TIOA Simulator, along with the other components of the TIOA Toolset aims to provide a framework for developing dependable distributed systems. The project is based on the
Style APA, Harvard, Vancouver, ISO itp.
10

Widerberg, Ernst. "A Modeling Language for Timed Automata." Thesis, KTH, Skolan för elektroteknik och datavetenskap (EECS), 2021. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-291554.

Pełny tekst źródła
Streszczenie:
This work details the design and implementation of a modeling language for timed automata. The primary intended use of the language TML is as an interface to controller synthesis system m2mc, which is being developed in a current KTH/Chalmers research project. TML is evaluated by a qualitative comparison with the modeling languages of two well-known model checking tools: Uppaal and Kronos. Two example systems (Fischer’s mutual exclusion protocol and CSMA/CD) are implemented in all three languages, to discover the relative merits of each language. Although not as feature rich as Uppaal, TML bri
Style APA, Harvard, Vancouver, ISO itp.
Więcej źródeł

Książki na temat "Timed automata"

1

Kaynar, Dilsun K., Nancy Lynch, Roberto Segala, and Frits Vaandrager. The Theory of Timed I/O Automata. Springer International Publishing, 2011. http://dx.doi.org/10.1007/978-3-031-02003-2.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
2

Kaynar, Dilsun K., Nancy Lynch, Roberto Segala, and Frits Vaandrager. The Theory of Timed I/O Automata. Springer International Publishing, 2006. http://dx.doi.org/10.1007/978-3-031-01794-0.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
3

Penczek, Wojciech, and Agata Pólrola. Advances in Verification of Time Petri Nets and Timed Automata. Springer Berlin Heidelberg, 2006. http://dx.doi.org/10.1007/978-3-540-32870-4.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
4

Jansen, Nils, Mariëlle Stoelinga, and Petra van den Bos, eds. A Journey from Process Algebra via Timed Automata to Model Learning. Springer Nature Switzerland, 2022. http://dx.doi.org/10.1007/978-3-031-15629-8.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
5

Rodolfo, Gomez, ed. Concurrency theory: Calculi and automata for modelling untimed and timed concurrent systems. Springer, 2006.

Znajdź pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
6

1957-, Larsen K. G., and Niebert Peter, eds. Formal modeling and analysis of timed systems: First international workshop, FORMATS 2003, Marseille, France, September 6-7, 2003 : revised papers. Springer, 2004.

Znajdź pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
7

FORMATS, 2010 (2010 Klosterneuburg Austria). Formal modeling and analysis of timed systems: 8th international conference, FORMATS 2010, Klosterneuburg, Austria, September 8-10, 2010 : proceedings. Springer, 2010.

Znajdź pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
8

FORMATS 2004 (2004 Grenoble, France). Formal techniques, modelling and analysis of timed and fault-tolerant systems: Joint international conferences on Formal Modelling and Analysis of Timed Systems, FORMATS 2004 and Formal Techniques in Real-Time and Fault-Tolerant Systems, FTRTFT 2004, Grenoble, France, September 22-24, 2004 : proceedings. Springer, 2004.

Znajdź pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
9

FORMATS 2010 (2010 Klosterneuburg, Austria). Formal modeling and analysis of timed systems: 8th international conference, FORMATS 2010, Klosterneuburg, Austria, September 8-10, 2010 : proceedings. Springer, 2010.

Znajdź pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
10

Fahrenberg, Uli. Formal Modeling and Analysis of Timed Systems: 9th International Conference, FORMATS 2011, Aalborg, Denmark, September 21-23, 2011. Proceedings. Springer-Verlag GmbH Berlin Heidelberg, 2011.

Znajdź pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
Więcej źródeł

Części książek na temat "Timed automata"

1

Bouyer, Patricia. "Timed automata." In Handbook of Automata Theory. European Mathematical Society Publishing House, 2021. http://dx.doi.org/10.4171/automata-1/34.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
2

Alur, Rajeev. "Timed Automata." In Verification of Digital and Hybrid Systems. Springer Berlin Heidelberg, 2000. http://dx.doi.org/10.1007/978-3-642-59615-5_12.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
3

Kaynar, Dilsun K., Nancy Lynch, Roberto Segala, and Frits Vaandrager. "Timed Automata." In The Theory of Timed I/O Automata. Springer International Publishing, 2006. http://dx.doi.org/10.1007/978-3-031-01794-0_4.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
4

Bérard, Béatrice, Michel Bidoit, Alain Finkel, et al. "Timed Automata." In Systems and Software Verification. Springer Berlin Heidelberg, 2001. http://dx.doi.org/10.1007/978-3-662-04558-9_5.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
5

Alur, Rajeev. "Timed Automata." In Computer Aided Verification. Springer Berlin Heidelberg, 1999. http://dx.doi.org/10.1007/3-540-48683-6_3.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
6

Kaynar, Dilsun K., Nancy Lynch, Roberto Segala, and Frits Vaandrager. "Timed Automata." In The Theory of Timed I/O Automata. Springer International Publishing, 2011. http://dx.doi.org/10.1007/978-3-031-02003-2_4.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
7

Sankur, Ocan. "Timed Automata Verification and Synthesis via Finite Automata Learning." In Tools and Algorithms for the Construction and Analysis of Systems. Springer Nature Switzerland, 2023. http://dx.doi.org/10.1007/978-3-031-30820-8_21.

Pełny tekst źródła
Streszczenie:
AbstractWe present algorithms for model checking and controller synthesis of timed automata, seeing a timed automaton model as a parallel composition of a large finite-state machine and a relatively smaller timed automaton, and using compositional reasoning on this composition. We use automata learning algorithms to learn finite automata approximations of the timed automaton component, in order to reduce the problem at hand to finite-state model checking or to finite-state controller synthesis. We present an experimental evaluation of our approach.
Style APA, Harvard, Vancouver, ISO itp.
8

Bérard, Beatrice, and Serge Haddad. "Interrupt Timed Automata." In Foundations of Software Science and Computational Structures. Springer Berlin Heidelberg, 2009. http://dx.doi.org/10.1007/978-3-642-00596-1_15.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
9

Li, Guoqiang, Xiaojuan Cai, Mizuhito Ogawa, and Shoji Yuen. "Nested Timed Automata." In Lecture Notes in Computer Science. Springer Berlin Heidelberg, 2013. http://dx.doi.org/10.1007/978-3-642-40229-6_12.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
10

Trivedi, Ashutosh, and Dominik Wojtczak. "Recursive Timed Automata." In Automated Technology for Verification and Analysis. Springer Berlin Heidelberg, 2010. http://dx.doi.org/10.1007/978-3-642-15643-4_23.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.

Streszczenia konferencji na temat "Timed automata"

1

Wallner, Felix, Bernhard K. Aichernig, Florian Lorber, and Martin Tappler. "Mutating Skeletons: Learning Timed Automata via Domain Knowledge." In 2025 IEEE International Conference on Software Testing, Verification and Validation Workshops (ICSTW). IEEE, 2025. https://doi.org/10.1109/icstw64639.2025.10962513.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
2

Pastore, Fabrizio, Daniela Micucci, and Leonardo Mariani. "Timed k-Tail: Automatic Inference of Timed Automata." In 2017 IEEE International Conference on Software Testing, Verification and Validation (ICST). IEEE, 2017. http://dx.doi.org/10.1109/icst.2017.43.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
3

Jenkin, Mark, Joël Ouaknine, Alexander Rabinovich, and James Worrell. "Alternating Timed Automata over Bounded Time." In 2010 25th Annual IEEE Symposium on Logic in Computer Science (LICS 2010). IEEE, 2010. http://dx.doi.org/10.1109/lics.2010.45.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
4

Cao, Yizhen, Zhiying Duan, and Yongbin Wang. "Uninterrupted Automatic Broadcasting Based on Timed Automata." In 2015 3rd International Conference on Applied Computing and Information Technology/2nd International Conference on Computational Science and Intelligence (ACIT-CSI). IEEE, 2015. http://dx.doi.org/10.1109/acit-csi.2015.93.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
5

Abdulla, Parosh Aziz, Mohamed Faouzi Atig, and Jari Stenman. "Dense-Timed Pushdown Automata." In 2012 27th Annual IEEE Symposium on Logic in Computer Science (LICS 2012). IEEE, 2012. http://dx.doi.org/10.1109/lics.2012.15.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
6

Clemente, Lorenzo, and Slawomir Lasota. "Timed Pushdown Automata Revisited." In 2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS). IEEE, 2015. http://dx.doi.org/10.1109/lics.2015.73.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
7

David, Alexandre, Kim G. Larsen, Axel Legay, Ulrik Nyman, and Andrzej Wasowski. "Timed I/O automata." In the 13th ACM international conference. ACM Press, 2010. http://dx.doi.org/10.1145/1755952.1755967.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
8

Lampka, Kai, Simon Perathoner, and Lothar Thiele. "Analytic real-time analysis and timed automata." In the seventh ACM international conference. ACM Press, 2009. http://dx.doi.org/10.1145/1629335.1629351.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
9

Berard, Beatrice, Serge Haddad, and Mathieu Sassolas. "Real Time Properties for Interrupt Timed Automata." In 2010 17th International Symposium on Temporal Representation and Reasoning (TIME 2010). IEEE, 2010. http://dx.doi.org/10.1109/time.2010.11.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
10

Chen, Taolue, Tingting Han, and Joost-Pieter Katoen. "Time-Abstracting Bisimulation for Probabilistic Timed Automata." In 2008 2nd IEEE/IFIP International Symposium on Theoretical Aspects of Software Engineering (TASE). IEEE, 2008. http://dx.doi.org/10.1109/tase.2008.29.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.

Raporty organizacyjne na temat "Timed automata"

1

Archer, Myla, and Constance Heitmeyer. Mechanical Verification of Timed Automata: A Case Study. Defense Technical Information Center, 1998. http://dx.doi.org/10.21236/ada359891.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
2

Seshia, Sanjit A., and Randal E. Bryant. A Boolean Approach to Unbounded, Fully Symbolic Model Checking of Timed Automata. Defense Technical Information Center, 2003. http://dx.doi.org/10.21236/ada460035.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
3

Ouaknine, Joel, and James Worrell. On the Language Inclusion Problem for Timed Automata: Closing a Decidability Gap. Defense Technical Information Center, 2003. http://dx.doi.org/10.21236/ada461167.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
4

Archer, Myla. Tools for Simplifying Proofs of Properties of Timed Automata: The TAME Template, Theories, and Strategies. Defense Technical Information Center, 1999. http://dx.doi.org/10.21236/ada361638.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
5

Cleveland, Gary A., Richard L. Piazza, and Richard H. Brown. Real Time Automatic Programming. Defense Technical Information Center, 1990. http://dx.doi.org/10.21236/ada220162.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
6

Pasupuleti, Murali Krishna. Automated Smart Contracts: AI-powered Blockchain Technologies for Secure and Intelligent Decentralized Governance. National Education Services, 2025. https://doi.org/10.62311/nesx/rrv425.

Pełny tekst źródła
Streszczenie:
Abstract: Automated smart contracts represent a paradigm shift in decentralized governance by integrating artificial intelligence (AI) with blockchain technologies to enhance security, scalability, and adaptability. Traditional smart contracts, while enabling trustless and automated transactions, often lack the flexibility to adapt to dynamic regulatory frameworks, evolving economic conditions, and real-time security threats. AI-powered smart contracts leverage machine learning, reinforcement learning, and predictive analytics to optimize contract execution, detect fraudulent transactions, and
Style APA, Harvard, Vancouver, ISO itp.
7

Videa, Aldo, and Yiyi Wang. Inference of Transit Passenger Counts and Waiting Time Using Wi-Fi Signals. Western Transportation Institute, 2021. http://dx.doi.org/10.15788/1715288737.

Pełny tekst źródła
Streszczenie:
Passenger data such as real-time origin-destination (OD) flows and waiting times are central to planning public transportation services and improving visitor experience. This project explored the use of Internet of Things (IoT) Technology to infer transit ridership and waiting time at bus stops. Specifically, this study explored the use of Raspberry Pi computers, which are small and inexpensive sets of hardware, to scan the Wi-Fi networks of passengers’ smartphones. The process was used to infer passenger counts and obtain information on passenger trajectories based on Global Positioning Syste
Style APA, Harvard, Vancouver, ISO itp.
8

Jackson, Richard Henry Frymuth, and Albert Jones. Real-time optimization in automated manufacturing facilities. National Bureau of Standards, 1986. http://dx.doi.org/10.6028/nbs.sp.724.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
9

Kuruganti, Teja, Olufemi Omitaomu, Ozgur Ozmen, et al. Real-Time Automated Health Information Technology Hazard Detection. Office of Scientific and Technical Information (OSTI), 2019. http://dx.doi.org/10.2172/1615805.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
10

Berney, Ernest, Jami Lynn Daugherty, and Lulu Edwards. Validation of the automatic dynamic cone penetrometer. Engineer Research and Development Center (U.S.), 2022. http://dx.doi.org/10.21079/11681/44704.

Pełny tekst źródła
Streszczenie:
The U.S. military requires a rapid means of measuring subsurface soil strength for construction and repair of expeditionary pavement surfaces. Traditionally, a dynamic cone penetrometer (DCP) has served this purpose, providing strength with depth profiles in natural and prepared pavement surfaces. To improve upon this device, the Engineer Research and Development Center (ERDC) validated a new battery-powered automatic dynamic cone penetrometer (A-DCP) apparatus that automates the driving process by using a motor-driven hammering cap placed on top of a traditional DCP rod. The device improves u
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!