Communicating sequential processes
Communicating sequential processes
Considerations on the insularity of performance evaluation
IEEE Transactions on Software Engineering
Petri net models for algebraic theories of concurrency
Volume II: Parallel Languages on PARLE: Parallel Architectures and Languages Europe
A temporal calculus of communicating systems
CONCUR '90 Proceedings on Theories of concurrency : unification and extension: unification and extension
Real-time behaviour of asynchronous agents
CONCUR '90 Proceedings on Theories of concurrency : unification and extension: unification and extension
Bisimulation through probabilistic testing
Information and Computation
Branching processes of Petri nets
Acta Informatica
Applications of process algebra
Applications of process algebra
Aggregation and disaggregation through insensitivity in stochastic Petri nets
Performance Evaluation
Theoretical Computer Science
Converging towards a timed LOTOS standard
Computer Standards & Interfaces
A LOTOS extension for the performance analysis of distributed systems
IEEE/ACM Transactions on Networking (TON)
Probabilistic and prioritized models of timed CSP
MFPS '92 Selected papers of the meeting on Mathematical foundations of programming semantics
An operational semantics for timed CSP
Information and Computation
Axiomatizing probabilistic processes: ACP with generative probabilities
Information and Computation
A compositional approach to performance modelling
A compositional approach to performance modelling
Strategic directions in concurrency research
ACM Computing Surveys (CSUR) - Special ACM 50th-anniversary issue: strategic directions in computing research
An introduction to ET-LOTOS for the description of time-sensitive systems
Computer Networks and ISDN Systems
IEEE Transactions on Software Engineering - Special issue on formal methods in software practice
Theoretical Computer Science
A denotational semantics for a process-based simulation language
ACM Transactions on Modeling and Computer Simulation (TOMACS)
Automated compositional Markov chain generation for a plain-old telephone system
Science of Computer Programming
Verification of a Leader Election Protocol: Formal Methods Applied to IEEE 1394
Formal Methods in System Design
Stochastically enhanced timed automata
Fourth International Conference on Formal methods for open object-based distributed systems IV
Process algebra for performance evaluation
Theoretical Computer Science
Communication and Concurrency
Introduction to Process Algebra
Introduction to Process Algebra
The theory of interactive generalized semi-Markov processes
Theoretical Computer Science
Finite State Markovian Decision Processes
Finite State Markovian Decision Processes
Probabilistic simulations for probabilistic processes
Nordic Journal of Computing
Linear Parametric Model Checking of Timed Automata
TACAS 2001 Proceedings of the 7th International Conference on Tools and Algorithms for the Construction and Analysis of Systems
First Passage Time Analysis of Stochastic Process Algebra Using Partial Orders
TACAS 2001 Proceedings of the 7th International Conference on Tools and Algorithms for the Construction and Analysis of Systems
Towards Performance Evaluation with General Distributions in Process Algebras
CONCUR '98 Proceedings of the 9th International Conference on Concurrency Theory
A Congruence Theorem for Structured Operational Semantics with Predicates
CONCUR '93 Proceedings of the 4th International Conference on Concurrency Theory
FTRTFT '96 Proceedings of the 4th International Symposium on Formal Techniques in Real-Time and Fault-Tolerant Systems
Performance Evaluation of Computer and Communication Systems, Joint Tutorial Papers of Performance '93 and Sigmetrics '93
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
Integrating Behavioural and Simulation Modelling
MMB '95 Proceedings of the 8th International Conference on Modelling Techniques and Tools for Computer Performance Evaluation: Quantitative Evaluation of Computing and Communication Systems
An Overview and Synthesis on Timed Process Algebras
Proceedings of the Real-Time: Theory in Practice, REX Workshop
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
Using timed CSP for specification verification and simulation of multimedia synchronization
IEEE Journal on Selected Areas in Communications
Extending Timed Process Algebra with Discrete Stochastic Time
AMAST 2008 Proceedings of the 12th international conference on Algebraic Methodology and Software Technology
Fundamenta Informaticae - Application of Concurrency to System Design
A Generic Cost Model for Concurrent and Data-parallel Meta-computing
Electronic Notes in Theoretical Computer Science (ENTCS)
Compositional theories of qualitative and quantitative behaviour
ICATPN'03 Proceedings of the 24th international conference on Applications and theory of Petri nets
A formal calculus for informal equality with binding
WoLLIC'07 Proceedings of the 14th international conference on Logic, language, information and computation
Predicting the performance of component-based software architectures with different usage profiles
QoSA'07 Proceedings of the Quality of software architectures 3rd international conference on Software architectures, components, and applications
Embedding real time in stochastic process algebras
EPEW'06 Proceedings of the Third European conference on Formal Methods and Stochastic Models for Performance Evaluation
Calculating probabilities of real-time test cases
FATES'05 Proceedings of the 5th international conference on Formal Approaches to Software Testing
Fundamenta Informaticae - Application of Concurrency to System Design
| Hi-index | 0.00 |
This paper is an informal tutorial on stochastic process algebras, i.e., process calculi where action occurrences may be subject to a delay that is governed by a (mostly continuous) random variable. Whereas most stochastic process algebras consider delays determined by negative exponential distributions, this tutorial is concerned with the integration of general, non-exponential distributions into a process algebraic setting. We discuss the issue of incorporating such distributions in an interleaving semantics, and present some existing solutions to this problem. In particular, we present a process algebra for the specification of stochastic discrete-event systems modeled as generalized semi-Markov chains (GSMCs). Using this language stochastic discrete-event systems can be described in an abstract and modular way. The operational semantics of this process algebra is given in terms of stochastic automata, a novel mixture of timed automata and GSMCs. We show that GSMCs are a proper subset of stochastic automata, discuss various notions of equivalence, present congruence results, treat equational reasoning, and argue how an expansion law in the process algebra can be obtained. As a case study, we specify the root contention phase within the standardized IEEE 1394 serial bus protocol and study the delay until root contention resolution. An overview of related work on general distributions in process algebra and a discussion of trends and future work complete this tutorial.