Petri net models for algebraic theories of concurrency
Volume II: Parallel Languages on PARLE: Parallel Architectures and Languages Europe
Real and complex analysis, 3rd ed.
Real and complex analysis, 3rd ed.
Model-checking for probabilistic real-time systems (extended abstract)
Proceedings of the 18th international colloquium on Automata, languages and programming
Bisimulation through probabilistic testing
Information and Computation
Information and Computation
Theoretical Computer Science
Symbolic model checking for real-time systems
Information and Computation
Reactive, generative, and stratified models of probabilistic processes
Information and Computation
Modeling and verification of randomized distributed real-time systems
Modeling and verification of randomized distributed real-time systems
Bisimulation for probabilistic transition systems: a coalgebraic approach
Theoretical Computer Science
Model checking
Communication and Concurrency
The theory of interactive generalized semi-Markov processes
Theoretical Computer Science
Automatic verification of real-time systems with discrete probability distributions
Theoretical Computer Science
Performance Modelling of Communication Networks and Computer Architectures (International Computer S
Performance Modelling of Communication Networks and Computer Architectures (International Computer S
Probabilistic simulations for probabilistic processes
Nordic Journal of Computing
Probabilistic Verification of Discrete Event Systems Using Acceptance Sampling
CAV '02 Proceedings of the 14th International Conference on Computer Aided Verification
Bisimulation for labelled Markov processes
Information and Computation - Special issue: LICS'97
Compositional and symbolic model-checking of real-time systems
RTSS '95 Proceedings of the 16th IEEE Real-Time Systems Symposium
On-the-fly symbolic model checking for real-time systems
RTSS '97 Proceedings of the 18th IEEE Real-Time Systems Symposium
Specification and Analysis of Soft Real-Time Systems: Quantity and Quality
RTSS '99 Proceedings of the 20th IEEE Real-Time Systems Symposium
Automatic verification of probabilistic concurrent finite state programs
SFCS '85 Proceedings of the 26th Annual Symposium on Foundations of Computer Science
A theory of Stochastic systems. Part II: Process algebra
Information and Computation
Interactive Markov chains: and the quest for quantified quality
Interactive Markov chains: and the quest for quantified quality
Stochastic transition systems for continuous state spaces and non-determinism
FOSSACS'05 Proceedings of the 8th international conference on Foundations of Software Science and Computation Structures
A theory of stochastic systems: part II: process algebra
Information and Computation
Extending Timed Process Algebra with Discrete Stochastic Time
AMAST 2008 Proceedings of the 12th international conference on Algebraic Methodology and Software Technology
A theory of Stochastic systems. Part II: Process algebra
Information and Computation
MOTOR: the MODEST tool environment
TACAS'07 Proceedings of the 13th international conference on Tools and algorithms for the construction and analysis of systems
SPAMR: extending PAMR with stochastic time
EPEW'07 Proceedings of the 4th European performance engineering conference on Formal methods and stochastic models for performance evaluation
Stochastic modelling and simulation of mobile systems
Graph transformations and model-driven engineering
Fixed-delay events in generalized semi-Markov processes revisited
CONCUR'11 Proceedings of the 22nd international conference on Concurrency theory
Advances in model transformations by graph transformation: specification, execution and analysis
Rigorous software engineering for service-oriented systems
Embedding real time in stochastic process algebras
EPEW'06 Proceedings of the Third European conference on Formal Methods and Stochastic Models for Performance Evaluation
Implementation relations for stochastic finite state machines
EPEW'06 Proceedings of the Third European conference on Formal Methods and Stochastic Models for Performance Evaluation
Stochastic simulation of graph transformation systems
FASE'10 Proceedings of the 13th international conference on Fundamental Approaches to Software Engineering
Bisimulations for non-deterministic labelled markov processes
Mathematical Structures in Computer Science
Incremental pattern matching for the efficient computation of transitive closure
ICGT'12 Proceedings of the 6th international conference on Graph Transformations
| Hi-index | 0.00 |
This paper presents the theoretical underpinning of a model for symbolically representing probabilistic transition systems, an extension of labelled transition systems for the modelling of general (discrete as well as continuous or singular) probability spaces. These transition systems are particularly suited for modelling softly timed systems, real-time systems in which the time constraints are of random nature. For continuous probability spaces these transition systems are infinite by nature. Stochastic automata represent their behaviour in a finite way. This paper presents the model of stochastic automata, their semantics in terms of probabilistic transition systems, and studies several notions of bisimulation. Furthermore, the relationship of stochastic automata to generalised semi-Markov processes is established.