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
Timed-Automata Based Model-Checking of a Multi-Agent System: A Case Study
2015
Journal of Software Engineering and Applications
Preserved Fulltext
A multi-agent based transport system is modeled by timed automata model extended with clock variables. ...
The multi-agent system is modeled as a network of timed automata based agents supported by clock variables. ...
Acknowledgements We are grateful to The Worthy Vice Chancellor, The Islamia University of Bahawalpur for motivation and en-N. Akhtar, M. Nauman ...
doi:10.4236/jsea.2015.82006
fatcat:ivdz5ti6e5e7xjkb7dptfac5mm
Analysing the PGM protocol with UPPAAL
2004
International Journal of Production Research
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.
In Sections 3 and 4, we describe how a simplified model of the protocol is built, via a network of timed automata. ...
We first propose a modelization of (a simplified version of) PGM via a network of timed automata. ...
In addition, a clock tick and a new parameter ERROR_DELAY have been added to the receiver currently tested. The clock is reset each time the receiver updates its receive window. ...
doi:10.1080/00207540410001705220
fatcat:k736d7phxnekjkt2idu6z57zaq
Revisiting Local Time Semantics for Networks of Timed Automata
2019
International Conference on Concurrency Theory
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 2022; you can also visit the original URL.
The file type is application/pdf.
We investigate a zone based approach for the reachability problem in timed automata. ...
This observation was used in an algorithm which from time to time detects and aggregates these zones into a single zone. ...
Let g be a guard and R a set of clocks. ...
doi:10.4230/lipics.concur.2019.16
dblp:conf/concur/GovindHSW19
fatcat:ig2gdtmlozd7nmtdkqrjcm2via
An Analyzable Model of Automated Service Negotiation
2013
2013 IEEE Seventh International Symposium on Service-Oriented System Engineering
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 how to analyze the negotiation model against timing, cost and utility constraints, by transforming it into the Timed Automata formal framework. ...
Often, service negotiation proceeds with timing, cost and resource constraints, under which the users and providers exchange information on their respective goals, until reaching a consensus. ...
Clock constraints are used as guards (g) for timed automata. χ(C) is used to denote the set of clock constraints, ranged over by guards g. ...
doi:10.1109/sose.2013.51
dblp:conf/sose/CausevicSP13
fatcat:dtl4o32jcjhtnoexbwrxc7auly
An Approach for Logic-based Knowledge Representation and Automated Reasoning over Underspecification and Refinement in Safety-Critical Cyber-Physical Systems
2020
CEUR Workshop Proceedings
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 2021; you can also visit the original URL.
The file type is application/pdf.
Formal knowledge representation using higher-order logic and intelligent reasoning is shown to be applied to software engineering problems to perform correctness proofs, execute symbolic tests or find ...
The theorem prover Isabelle is a mature and fundamental tool, which allows to represent knowledge as a collection of definitions and theorems and reason about systems. ...
The unfair clock has to output nondeterministicially true or false (input and transition guards can be modeled in MontiArc [15] , but are not present in this component). ...
doi:10.18154/rwth-2020-08278
fatcat:j5wnd4jedffqtdf3um7axqcwti
Uniform Sampling for Timed Automata with Application to Language Inclusion Measurement
[chapter]
2016
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.
We improve over their work by employing a zone graph abstraction instead of the region graph abstraction and incorporating uniform sampling within a zone-based Monte Carlo model checking framework. ...
The uniformity is defined with respect to volume measure of timed languages previously studied by Asarin, Basset and Degorre. ...
Guards for a and b are the same in the two TAs. The blue part represents clock vectors reachable through entry zones by time elapsing. ...
doi:10.1007/978-3-319-43425-4_13
fatcat:2wvhbvijcvfx3coczbnro2nyn4
A quantitative verification framework of SysML activity diagrams under time constraints
2015
Expert systems with 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 2016; you can also visit the original URL.
The file type is application/pdf.
diagram as input and produce their equivalent timed probabilistic automata that is/are expressed in PRISM language. ...
Time-constrained and probabilistic verification approaches gain a great importance in system behavior validation including avionic, transport risk assessment, automotive systems and industrial process ...
Probabilistic Timed Automata (PTA) is a Probabilistic Automata equipped with a finite set of real-valued clock variables called clocks. ...
doi:10.1016/j.eswa.2015.05.049
fatcat:vfj6qdqtyrb4bjl6k4nu7ogk5q
Multi-core Reachability for Timed Automata
[chapter]
2012
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.
Acknowledgments We would like to thank the LTSmin and APRON developers for making their excellent code available to others in the research community. ...
Timed Automata Timed automata are finite state machines with a finite set of real-valued, resettable clocks. Transitions between states can be guarded by constraints on clocks. ...
Timed automata extended with variables can now be defined: l is the source location, g is an extended guard constraint over the clocks and discrete variables, a is the action, s is the update statement ...
doi:10.1007/978-3-642-33365-1_8
fatcat:qwhq3mr2bzfizm54xhsw7ddd5a
Parametric Timed Model Checking for Guaranteeing Timed Opacity
[chapter]
2019
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 2020; you can also visit the original URL.
The file type is application/pdf.
Other Versions
We solve this problem in the setting of timed automata (TAs). ...
We first provide a general solution, and then extend the problem to parametric TAs, by synthesizing internal timings making the TA secure. ...
We thank Sudipta Chattopadhyay for helpful suggestions, Jiaying Li for his help with preliminary model conversion, and a reviewer for suggesting Remark 1. ...
doi:10.1007/978-3-030-31784-3_7
fatcat:v25khacdczavhpoqw47xwgtv7q
A Symbolic Algorithm for the Analysis of Robust Timed Automata
[chapter]
2014
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.
Similarly to the assumptions made by Puri, we restrict our analysis to the class of timed automata with closed guards, progress cycles, and bounded clocks. ...
We propose an algorithm for the analysis of robustness of timed automata, that is, the correctness of a model in the presence of small drifts of the clocks. ...
Timed automata are automata extended by clock variables that can be tested and reset. ...
doi:10.1007/978-3-319-06410-9_25
fatcat:26ug5owy3nd73c3vg3xoi34f7m
Timed Temporal Logics
[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.
We survey expressiveness and algorithmic results on those logics, and discuss semantic choices that may look unimportant but do have an impact on the questions we consider. ...
Since the early 1990's, classical temporal logics have been extended with timing constraints. ...
To that aim, a fragment of L ν has been investigated [1] , which fully characterizes properties that can be expressed through a reachability query via test automata. ...
doi:10.1007/978-3-319-63121-9_11
fatcat:nytl6mhwojf5jeuzdkec2igwf4
Fault Diagnosis in Wireless Sensor Network using Timed Automata
2011
International Journal of Computer 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.
In this paper, we propose a diagnosis algorithm on the basis of diagnosability definitions and theoretical studies developed for timed and hybrid automata. ...
In this paper we consider the problem of identifying faulty (crashed) nodes in a wireless sensor network and used timed automata for representation. ...
Here proposed a procedure to check diagnosability, and show that the computational complexity is in PTIME for the system class of our abstraction, namely for a subclass of timed automata: the durational ...
doi:10.5120/3578-4948
fatcat:5gm5knwfsjh6pcuflfrbtb524q
Compositional Formal Analysis Based on Conventional Engineering Models
[article]
2020
arXiv
pre-print
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 2020; you can also visit the original URL.
The file type is application/pdf.
Formal methods enable discovery of error conditions that conventional testing may miss, and can aid in planning complex system operations. ...
We demonstrate SLICED using the Virtual ADAPT model published by NASA and validate our results by replicating them using Simulink. ...
Use of a discrete clock enables us to model timed automata (strictly, ordered automata) where assumptions about the duration of events can be applied. ...
arXiv:2004.03666v1
fatcat:bktch2lfbvgxlouu5pxzj7qjda
Analysis of a biphase mark protocol with Uppaal and PVS
2006
Formal Aspects of 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 2017; you can also visit the original URL.
The file type is application/pdf.
In this article, we show how the protocol can be modelled naturally in terms of timed automata. ...
The biphase mark protocol is a convention for representing both a string of bits and clock edges in a square wave. ...
earlier version of this paper and the formalization of the biphase mark protocol. ...
doi:10.1007/s00165-006-0008-1
fatcat:7oui7xbv5zhhvfew7uviyhqffi
REAFFIRM: Model-Based Repair of Hybrid Systems for Improving Resiliency
[article]
2019
arXiv
pre-print
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.
expressed as a Signal Temporal Logic formula, and then outputs a repaired model which satisfies the requirement. ...
There is currently a shortage of an inexpensive, automated mechanism that can effectively repair the initial design, and a model-based system developer regularly needs to redesign and reimplement the system ...
Figure 8 shows a resiliency pattern written as a HATL script that introduces the clock variable as a timer, and the switching time relies on the value of θ. ...
arXiv:1902.04064v1
fatcat:wajqnsnj25ewhh64lcac4evjay
« Previous
Showing results 1 — 15 out of 309 results