Petri nets: an introduction
Theoretical Computer Science
A compositional approach to performance modelling
A compositional approach to performance modelling
Diagnostic model-checking for real-time systems
Proceedings of the DIMACS/SYCON workshop on Hybrid systems III : verification and control: verification and control
Computer networks (3rd ed.)
Model-Checking for Probabilistic Real-Time Systems (Extended Abstract)
ICALP '91 Proceedings of the 18th International Colloquium on Automata, Languages and Programming
Modeling Urgency in Timed Systems
COMPOS'97 Revised Lectures from the International Symposium on Compositionality: The Significant Difference
An algebraic approach to the specification of stochastic systems
PROCOMET '98 Proceedings of the IFIP TC2/WG2.2,2.3 International Conference on Programming Concepts and Methods
Composition in Multiparadigm Specification Techniques
Proceedings of the IFIP TC6/WG6.1 Third International Conference on Formal Methods for Open Object-Based Distributed Systems (FMOODS)
Integrating Performance and Functional Analysis of Concurrent Systems with EMPA
Integrating Performance and Functional Analysis of Concurrent Systems with EMPA
Specifying and analysing multimedia systems
Formal methods for distributed processing
An Integrated Approach for the Specification and Analysis of Stochastic Real-Time Systems
PAPM-PROBMIV '02 Proceedings of the Second Joint International Workshop on Process Algebra and Probabilistic Methods, Performance Modeling and Verification
Specification and Analysis of Automata-Based Designs
IFM '00 Proceedings of the Second International Conference on Integrated Formal Methods
A methodology for implementing a stress workload generator for the GTP-U plane
WWIC'05 Proceedings of the Third international conference on Wired/Wireless Internet Communications
| Hi-index | 0.00 |
Modern distributed systems include a class of applications in which non-functional requirements are important. In particular, these applications include multimedia facilities where real time constraints are crucial to their correct functioning. In order to specify such systems it is necessary to describe that events occur at times given by probability distributions. Stochastic process algebras have emerged as a useful technique by which such systems can be specified and verified. However, stochastic descriptions are very general, in particular they allow the use of general probability distribution functions, and therefore their verification can be complex. In this paper we define a translation from stochastic process algebras to timed automata. By doing so we aim to use the simpler verification methods for timed automata (e.g. reachability properties) for the more complex stochastic descriptions.