A timed model for communicating sequential processes
Theoretical Computer Science - Thirteenth International Colloquim on Automata, Languages and Programming, Renne
Computer Networks and ISDN Systems - Protocol specification, testing and verification
Theoretical Computer Science
A process algebra for timed systems
Information and Computation
Reactive, generative, and stratified models of probabilistic processes
Information and Computation
A compositional approach to performance modelling
A compositional approach to performance modelling
A process algebra of communicating shared resources with dense time and priorities
Theoretical Computer Science
Theoretical Computer Science
Testing preorders for probabilistic processes
Information and Computation
Theoretical Computer Science
The theory of interactive generalized semi-Markov processes
Theoretical Computer Science
PAMR: A Process Algebra for the Management of Resources in Concurrent Systems
FORTE '01 Proceedings of the IFIP TC6/WG6.1 - 21st International Conference on Formal Techniques for Networked and Distributed Systems
Encoding PAMR into (Timed) EFSMs
FORTE '02 Proceedings of the 22nd IFIP WG 6.1 International Conference Houston on Formal Techniques for Networked and Distributed Systems
A Testing Theory for Generally Distributed Stochastic Processes
CONCUR '01 Proceedings of the 12th International Conference on Concurrency Theory
An Overview and Synthesis on Timed Process Algebras
CAV '91 Proceedings of the 3rd International Workshop on Computer Aided Verification
Generating Test Cases for a Timed I/O Automaton Model
Proceedings of the IFIP TC6 12th International Workshop on Testing Communicating Systems: Method and Applications
Automatic generation of tests for timing constraints from requirements
WORDS '97 Proceedings of the 3rd Workshop on Object-Oriented Real-Time Dependable Systems - (WORDS '97)
Specification, testing and implementation relations for symbolic-probabilistic systems
Theoretical Computer Science
A theory of stochastic systems part I: Stochastic automata
Information and Computation
A testing scenario for probabilistic automata
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
A guided method for testing timed input output automata
TestCom'03 Proceedings of the 15th IFIP international conference on Testing of communicating systems
Testing finite state machines presenting stochastic time and timeouts
EPEW'07 Proceedings of the 4th European performance engineering conference on Formal methods and stochastic models for performance evaluation
FMOODS'10/FORTE'10 Proceedings of the 12th IFIP WG 6.1 international conference and 30th IFIP WG 6.1 international conference on Formal Techniques for Distributed Systems
| Hi-index | 0.00 |
We present a timed extension of the classical finite state machines model where time is introduced in two ways. On the one hand, timeouts can be specified, that is, we can express that if an input action is not received before a fix amount of time then the machine will change its state. On the other hand, we can associate time with the performance of actions. In this case, time will be given by means of random variables. Intuitively, we will not have conditions such as “the action a takes t time units to be performed” but conditions such as “the action a will be completed before time t with probability p.” In addition to introducing the new language, we present several conformance relations to relate implementations and specifications that are defined in terms of our new notion of stochastic finite state machine