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.
Filters
Probabilistic duration automata for analyzing real-time systems
[chapter]
1996
Lecture Notes in Computer Science
Preserved Fulltext
1 We present a novel methodology and tools for analyzing real-time systems that use probability density functions (pdfs) to represent the durations of operations within the system. ...
These pdfs are used to determine whether a real-time system can meet its probabilistic timing constraints. ...
We describe a novel methodology and tools for analyzing real-time systems that represent the durations of operations by probability density functions (pdfs), rather than by upper and lower bounds. ...
doi:10.1007/3-540-61042-1_55
fatcat:seu26sm6pndq7hjtrdnwawwihq
Statistical Models Of Network Traffic
2010
Zenodo
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.
The main contribution of this paper is the introduction of a model formalism called 'probabilistic regression automaton' suitable for the tasks mentioned above. ...
Automatically deriving models by observing and analyzing running systems is one possible way to amend this bottleneck. ...
SUMMARY AND OUTLOOK Timed automata are a powerful means for modeling and verifying real-time system behavior. ...
doi:10.5281/zenodo.1055518
fatcat:rdkst7haazal3m437ysl5qzpma
Towards Approximate Model Checking DC and PDC Specifications
[article]
2012
arXiv
pre-print
Preserved Fulltext
The Internet Archive has a preservation copy of this work in our general collections.
The file type is application/pdf.
This work was motivated to develop approximate techniques checking automata models of hard real-time systems for DC and PDC specifications. ...
The first results of our work, namely, approximate techniques checking real-time automata models of systems for LDI and PLDI specifications, are described in this paper. ...
Duration Calculus (abbreviated to DC) was introduced in [1] as a logic for specifying quantitative timing requirements of hard real-time systems and fully analyzed in [2, 3] . ...
arXiv:1212.3838v1
fatcat:rsln3ehnafafto354kqlt2i2n4
Simulation and Bisimulation for Probabilistic Timed Automata
[chapter]
2010
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.
In this paper, we study probabilistic timed simulation and bisimulation relations for probabilistic timed automata. ...
We present an EXPTIME algorithm for deciding whether two probabilistic timed automata are probabilistically timed similar or bisimilar. ...
A widespread example of a system description formalism for real-time systems is timed automata [1] . ...
doi:10.1007/978-3-642-15297-9_17
fatcat:yq3o2j2safgd3heifpm7osgwci
Probabilistic bounds on message delivery for the totem single-ring protocol
1994
Proceedings Real-Time Systems Symposium REAL-94
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 2001; you can also visit the original URL.
The file type is application/pdf.
bilistic bounds on message delivery for the Totem single-ring protocol," Proceedings of the 15th IEEE Real- ...
Our probabilistic duration automata and algorithm provide a means of analyzing such probability density functions. ...
Probabilistic Duration Automata In 12 w e i n troduced the notion of a probabilistic duration automaton in which clocks are de ned by pdfs, rather than by explicit times. ...
doi:10.1109/real.1994.342712
dblp:conf/rtss/MoserM94
fatcat:yliyhxlz75fc5clsici4kqwxvq
Time-Abstracting Bisimulation for Markovian Timed Automata
2016
International Journal of Software Engineering & 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.
Markovian timed automata (MTA) has been proposed as an expressive formalism for specification of realtime properties in Markovian stochastic processes. ...
In this paper, we define bisimulation relation for deterministic MTA. This definition provides a basis for developing effective algorithms for deciding bisimulation relation for such automata. ...
INTRODUCTION Timed automata have shown to be very useful formalism for modeling and analyzing of real-time systems [4] . ...
doi:10.5121/ijsea.2016.7403
fatcat:wvoxl5akivd3bpxmzjcjr3jhtq
A Model-Based Framework for the Specification and Analysis of Hierarchical Scheduling Systems
[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 2018; you can also visit the original URL.
The file type is application/pdf.
Over the years, schedulability of Cyber-Physical Systems (CPS) has mainly been performed by analytical methods. ...
In this paper, we go one step further and show how our formalism can be extended to account for stochastic information, such as sporadic tasks whose attributes depend on the hardware domain. ...
(a) SWA for a simple real-time task (b) PTA for a task dispatcher Probabilistic Timed Automata (PTA) [1] is an extension of SWA that adds discrete probabilities to the transitions. ...
doi:10.1007/978-3-319-45943-1_9
fatcat:4zfi3rf5ebd5rdtsydmckeapye
Probabilistic Timed Graph Transformation Systems
[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 2018; you can also visit the original URL.
The file type is application/pdf.
We introduce the formal model of PTGTSs in this paper and present a mapping of models with finite state spaces to probabilistic timed automata (PTA) that allows to use the PRISM model checker to analyze ...
Today, software has become an intrinsic part of complex distributed embedded real-time systems. ...
[25] resp. timed automata [2, 3] and then combine them to the notion of probabilistic timed automata [18] used for modeling of real-time systems with probability. ...
doi:10.1007/978-3-319-61470-0_10
fatcat:l43jzpsdpzhp3iikdgcbfyldba
On the effects of noise and speed on computations
1994
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.
Our model, combining basic notions from algebraic automata theory and the theory of stochastic processes, can serve as a starting point for a rigorous theory of computational systems embedded in the real ...
We prove upper and lower bounds on the effect of noise for various classes of finite automata. ...
Pnueli and an anonymous referee for their attention and comments. ...
doi:10.1016/0304-3975(94)90029-9
fatcat:gotyzkpudre2tllsekcvgrqlrq
Learning the Structure of Graphical Models Based on Discrete Time Series Data in the Context of Ambient Assisted Living
2015
SNE Simulation Notes Europe
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.
This work addresses the issue of building a probabilistic system in an ambient assisted living environment to ensure a proper living for older adults. ...
The aim in this context is to detect recurrent patterns in a stream of domestic sensor data using the Temporal-Pattern (T-Pattern) algorithm and to automatically generate probabilistic finite-state automata ...
Probabilistic automata have similarities to widely used Hidden Markov Models, as analyzed in [17] . ...
doi:10.11128/sne.25.tn.10308
fatcat:dhfo5r6y5veixa57cp4rez547q
Model Checking Probabilistic Real-Time Properties for Service-Oriented Systems with Service Level Agreements
2011
Electronic Proceedings in Theoretical Computer Science
Preserved Fulltext
The Internet Archive has a preservation copy of this work in our general collections.
The file type is application/pdf.
Note that this fulltext copy is not of the "primary" version of this work. The version it corresponds to is:
2011 pre-print arXiv:1111.3110v1 fatcat:pcpchtwzwzfy7j6hxej7ac5o5a
In this paper, we suggest to employ the recently introduced model of Interval Probabilistic Timed Automata (IPTA) for formal verification of QoS properties of service-oriented systems. ...
On the other hand, formal methods for verification of probabilistic real-time behavior have reached a level of expressiveness and efficiency which allows to apply them in real-world scenarios. ...
Acknowledgments The authors of this paper are grateful to Dave Parker for his support with the IPTA implementation in PRISM. ...
doi:10.4204/eptcs.73.8
fatcat:vgvwm6k7yza7vmrtr2yvrxgddq
Probabilistic Model Checking of Deadline Properties in the IEEE 1394 FireWire Root Contention Protocol
2003
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.
Probabilistic timed automata are used to formally model and verify the protocol against properties which require that a leader is elected before a deadline with a certain probability. ...
The interplay of real-time and probability is crucial to the correctness of the IEEE 1394 FireWire root contention protocol. ...
A probabilistic timed automaton comprises a finitary, probabilistic transition system equipped with a finite set of real-valued variables which increase at the same rate as real-time. ...
doi:10.1007/s001650300007
fatcat:j44aupeidjbfdexwe3eaxlzrsm
The Unmet Challenge of Timed Systems
[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 2019; you can also visit the original URL.
The file type is application/pdf.
Timed systems constitute a class of dynamical systems that live in an extremely useful level of abstraction. ...
The paper stresses their importance in modeling without necessarily endorsing the orthodox approach for reasoning about them which is practiced in the theoretical and applied branches of formal verification ...
Thiagarajan for commenting on various versions of this manuscript. This work was partially supported by the French project EQINOCS (ANR-11-BS02-004). ...
doi:10.1007/978-3-642-54848-2_12
fatcat:ryn4p7csg5cb7iaxtwk2ktvl3m
A General Overview of Formal Languages for Individual-Based Modelling of Ecosystems
[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 2020; you can also visit the original URL.
The file type is application/pdf.
Each modelling language offers a distinct view and techniques for analyzing systems. Most of the languages are based on process calculi or P systems. ...
Various formal languages have been proposed in the literature for the individual-based modelling of ecological systems. These languages differ in their treatment of time and space. ...
In probabilistic P systems, the rules include a real number between zero and one: a probability of the rule for its application [3] . ...
arXiv:1901.10820v1
fatcat:2x5nucj7frd5nlfkrp7sszhlf4
SReach: A Bounded Model Checker for Stochastic Hybrid Systems
[article]
2014
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.
Other Versions
The second one is probabilistic hybrid automata with additional randomness for both transition probabilities and variable resets. ...
In this paper we describe a new tool, SReach, which solves probabilistic bounded reachability problems for two classes of stochastic hybrid systems. ...
For each sample generated, SReach analyzed systems with 62 variables, and 24 ODEs. ...
arXiv:1404.7206v2
fatcat:w2ksrikju5hibc2qqmuinsekxm
« Previous
Showing results 1 — 15 out of 2,126 results