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
Towards Testing Stochastic Timed Systems
[chapter]
2003
Lecture Notes in Computer Science
Preserved Fulltext
In order to define our formal model, we will provide a stochastic extension of the notion of finite state machine. ...
In this paper we present a first approach to the definition of conformance testing relations for systems presenting stochastic timed behavior. ...
Stochastic Finite State Machines In this section we introduce our notion of finite state machines with stochastic time. We use random variables to model stochastic delays. ...
doi:10.1007/978-3-540-39979-7_22
fatcat:npsx5gn3ffcj5ol2iknlx4arcm
Production Systems Flow Modelling Using Decomposition Method and Required Buffers
2017
International Journal of Simulation Modelling
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 the first phase, the manufacturing line is analysed, then the Markov chains for subsystems with two machines and a buffer are constructed. ...
To find the production rate for all the system, it is necessary to apply the Markov chains and the decomposition method. Those methods are implemented in the C/C++ programming. ...
The authors offered solutions for performance analysis of flow production systems, first of all for two-three machines with finite buffers and then, they used recursive matrix and geometric matrix for ...
doi:10.2507/ijsimm16(2)2.367
fatcat:mvu7zhingjcztae7aw66y4vzpi
Hidden Quantum Markov Models and non-adaptive read-out of many-body states
[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.
Other Versions
Stochastic finite-state generators are compressed descriptions of infinite time series. Alternatively, compressed descriptions are given by quantum finite- state generators [K. Wiesner and J. P. ...
Here we generalise the quantum finite-state generators by replacing the von Neumann pro jections by stochastic quantum operations. ...
Stochastic finite-state generators differ from finite-state machines used for recognition of regular languages in two ways. ...
arXiv:1002.2337v2
fatcat:v2kee6vinvgsrf2g3wdutgr35i
Extending Refusal Testing by Stochastic Refusals for Testing Non-deterministic Systems
[article]
2012
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.
Second,we present a new technique to generate automatically a canonical tester from stochastic refusal graph and conformance relation confSRG. ...
Finally, implementation is proposed and the application of our approach is shown by an example. ...
For that, we use an implementation relation, and the system is valid when the relation is respected. ...
arXiv:1211.2708v1
fatcat:ewn32jotgbfq3gccz2t2i4a3s4
Language Diversity of Measured Quantum Processes
[article]
2006
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.
We explore these questions by analyzing the language diversity of quantum finite-state generators. ...
One result is a new way to distinguish quantum devices from their classical (stochastic) counterparts. ...
STOCHASTIC FINITE-STATE GENERATORS Automata with finite memory-finite-state machines-consist of a finite set of states and transitions between them [4] . ...
arXiv:quant-ph/0611203v1
fatcat:zteu62ubcbb2rkh6blwj7zyifu
Strong and Weak Optimizations in Classical and Quantum Models of Stochastic Processes
2019
Journal of statistical physics
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.
Abstract Among the predictive hidden Markov models that describe a given stochastic process, the -machine is strongly minimal in that it minimizes every Rényi-based memory measure. ...
In contrast with the -machine's unique role in the classical setting, however, among the class of processes described by pure-state hidden quantum Markov models, there are those for which there does not ...
Where finite, C μ is known to be the minimal memory rate over all classical implementations. ...
doi:10.1007/s10955-019-02344-x
fatcat:bh5mvmkzbjd4pgnbel7dvwqhxq
Programmability of Chemical Reaction Networks
[chapter]
2009
Natural Computing Series
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 2009; you can also visit the original URL.
The file type is application/pdf.
We survey known connections and give new connections between SCRNs and Boolean Logic Circuits, Vector Addition Systems, Petri Nets, Gate Implementability, Primitive Recursive Functions, Register Machines ...
, Fractran, and Turing Machines. ...
Acknowledgments The research was supported in part by the "Alpha Project" at the Center for Genomic Experimentation and Computation, an NIH Center of Excellence (grant number P50 HG02370), as well as NSF ...
doi:10.1007/978-3-540-88869-7_27
fatcat:i4idrzntobh2na5grdk6enmf3m
Page 1257 of Mathematical Reviews Vol. , Issue 96b
[page]
1996
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
Summary: “The concept of dynamical consistency is introduced to define a high-level transition function for an arbitrary partition of the state space of a finite input-state machine #. ...
Summary: “In this paper we study the effects of finite-precision controller implementation on the stability and performance of sampled-data systems. ...
Testing from a stochastic timed system with a fault model
2009
The Journal of Logic and Algebraic Programming
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 present a method for testing a system against a non-deterministic stochastic finite state machine. ...
We show how previous work on testing from stochastic systems can be encoded into the framework presented in this paper as an instantiation of our parameterized implementation relation. ...
In this paper we consider an extension of finite state machines (FSMs), Stochastic Finite Sate Machines (SFSMs), where (stochastic) time information is included. ...
doi:10.1016/j.jlap.2008.06.001
fatcat:ci4inbweqbf3pbnuic6bgw5rru
Formal Testing of Timed and Probabilistic Systems
[chapter]
2011
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.
All the methodologies have as common assumption that the system under test is a black-box and that the specification is described as a timed and/or probabilistic extension of the finite state machines ...
For example, in a specific situation it might be desirable that a system is as fast as possible while in a different application it might be required that the performance of the system is exactly equal ...
Intuitively, transitions in finite state machines indicate that if the machine is in a state s and receives an input i then it will produce an output o and it will change its state to s . ...
doi:10.1007/978-3-642-24580-0_2
fatcat:2jgjoneygbejvmgpf2dhqxysrq
Modeling of the Technological Process for Metal Production using a Probability Finite Automatic Machine
2019
VOLUME-8 ISSUE-10, AUGUST 2019, REGULAR ISSUE
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.
And the most frequently used tool for this in modern research and scientific projects is state machines - finite discrete or probabilistic automata, although they often do not allow the creation of decision-making ...
To date, the popularity of areas such as system management and the development of automated control systems using finite state machines has grown significantly, while the degree of mutual integration of ...
The laws of the distribution of outputs and states for a probabilistic finite state machine can be represented in the form of a table (table 1 ). ...
doi:10.35940/ijitee.a8110.119119
fatcat:yk4ztzlhxjdtlne2p4tztukzsm
Estimating Software Reliability by Monitoring Software Execution through OpCode
2015
International Journal of Information Technology and 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.
The extracted opcode is then used to learn stochastic finite state machine (SFSM) representation of executable software which is later employed to trace software state-to-state transition at each runtime ...
Previous studies on estimating software reliability employed statistical functions for next system failure prediction. ...
Figure 3 next depicts the Stochastic Finite State Machine obtained at the end of this step. At the end of phase I, stochastic finite state representation of software is obtained. ...
doi:10.5815/ijitcs.2015.09.04
fatcat:xf2dtk42dzfg3a45unizpeaoym
Rule-based Modeling and Simulation of Biochemical Systems with Molecular Finite Automata
[article]
2010
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.
Other Versions
We propose a theoretical formalism, molecular finite automata (MFA), to describe individual proteins as rule-based computing machines. ...
The MFA formalism provides a framework for modeling individual protein behaviors and systems-level dynamics via construction of programmable and executable machines. ...
We thank the Center for Nonlinear Studies for support that made it possible for J.Y. to visit Los Alamos. ...
arXiv:1007.1315v2
fatcat:ho2moevktvdmxo2nsgbf2n3lla
Computation in Finitary Stochastic and Quantum Processes
[article]
2008
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.
Other Versions
We introduce stochastic and quantum finite-state transducers as computation-theoretic models of classical stochastic and quantum finitary processes. ...
Quantum finite-state transducers and generators are a first step toward a computation-theoretic analysis of individual, repeatedly measured quantum dynamical systems. ...
Strelioff for helpful discussions. ...
arXiv:quant-ph/0608206v4
fatcat:rjkyslchxrakrfybdg4ie7lglm
Computation in finitary stochastic and quantum processes
2008
Physica D : Non-linear phenomena
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 2010; you can also visit the original URL.
The file type is application/pdf.
We introduce stochastic and quantum finite-state transducers as representations of classical stochastic and quantum finitary processes. ...
Quantum finite-state transducers and generators represent a first step toward a computational description of individual closed quantum systems observed over time. ...
Strelioff for helpful discussions. ...
doi:10.1016/j.physd.2008.01.021
fatcat:6gtwgqef6va5zlyk7h7ftj4lri
« Previous
Showing results 1 — 15 out of 54,638 results