A Theory of Communicating Sequential Processes
Journal of the ACM (JACM)
Communicating sequential processes
Communicating sequential processes
Specification-oriented semantics for communicating processes
Acta Informatica
Theoretical Computer Science
Introduction to the ISO specification language LOTOS
Computer Networks and ISDN Systems - Special Issue: Protocol Specification and Testing
Process algebra
CCS + time = an interleaving model for real time systems
Proceedings of the 18th international colloquium on Automata, languages and programming
Stochastic Automata Network of Modeling Parallel Systems
IEEE Transactions on Software Engineering
Specification styles in distributed systems design and verification
TAPSOFT '89 2nd international joint conference on Theory and practice of software development
Dynamic congruence vs. progressing bisimulation for CCS
Fundamenta Informaticae - Special issue on mathematical foundations of computer science '91
Transition system specifications with negative premises
Theoretical Computer Science
A process algebra for timed systems
Information and Computation
Reactive, generative, and stratified models of probabilistic processes
Information and Computation
Branching time and abstraction in bisimulation semantics
Journal of the ACM (JACM)
A general conservative extension theorem in process algebras with inequalities
ACP '95 Proceedings from the international workshop on Algebra of communicating processes
Stochastic process algebras—between LOTOS and Markov chains
Computer Networks and ISDN Systems - Special issue: trends in formal description techniques
Automated compositional Markov chain generation for a plain-old telephone system
Science of Computer Programming
Process algebra for performance evaluation
Theoretical Computer Science
Communication and Concurrency
Handbook of Process Algebra
A Testing Theory for LOTOS using Deadlock Detection
Proceedings of the IFIP WG6.1 Ninth International Symposium on Protocol Specification, Testing and Verification IX
ICALP '95 Proceedings of the 22nd International Colloquium on Automata, Languages and Programming
The Complete Axiomatization of Cs-congruence
STACS '94 Proceedings of the 11th Annual Symposium on Theoretical Aspects of Computer Science
An Algebraic Theory of Multiple Clocks
CONCUR '97 Proceedings of the 8th International Conference on Concurrency Theory
The Linear Time - Branching Time Spectrum II
CONCUR '93 Proceedings of the 4th International Conference on Concurrency Theory
CONCUR '95 Proceedings of the 6th International Conference on Concurrency Theory
Extended Markovian Process Algebra
CONCUR '96 Proceedings of the 7th International Conference on Concurrency Theory
On Asynchronous Communication Semantics
ECOOP '91 Proceedings of the Workshop on Object-Based Concurrent Computing
Concurrency and Automata on Infinite Sequences
Proceedings of the 5th GI-Conference on Theoretical Computer Science
Performance Evaluation of Computer and Communication Systems, Joint Tutorial Papers of Performance '93 and Sigmetrics '93
An enlarged definition and complete axiomatization of observational congruence of finite processes
Proceedings of the 5th Colloquium on International Symposium on Programming
Superposed Generalized Stochastic Petri Nets: Definition and Efficient Solution
Proceedings of the 15th International Conference on Application and Theory of Petri Nets
An Overview and Synthesis on Timed Process Algebras
Proceedings of the Real-Time: Theory in Practice, REX Workshop
Performance Evaluation: = (Process Algebra + Model Checking) × Markov Chains
CONCUR '01 Proceedings of the 12th International Conference on Concurrency Theory
A theory of stochastic systems: part II: process algebra
Information and Computation
Stochastic Graph Transformation Systems
Fundamenta Informaticae - SPECIAL ISSUE ON ICGT 2004
Simulation of Generalised Semi-Markov Processes based on Graph Transformation Systems
Electronic Notes in Theoretical Computer Science (ENTCS)
A framework for performance evaluation and functional verification in stochastic process algebras
Proceedings of the 2008 ACM symposium on Applied computing
Rate-Based Transition Systems for Stochastic Process Calculi
ICALP '09 Proceedings of the 36th Internatilonal Collogquium on Automata, Languages and Programming: Part II
MarCaSPiS: a Markovian Extension of a Calculus for Services
Electronic Notes in Theoretical Computer Science (ENTCS)
A Framework for Stochastic System Modelling and Analysis
Electronic Notes in Theoretical Computer Science (ENTCS)
A theory of Stochastic systems. Part II: Process algebra
Information and Computation
Compositional theories of qualitative and quantitative behaviour
ICATPN'03 Proceedings of the 24th international conference on Applications and theory of Petri nets
The how and why of interactive Markov chains
FMCO'09 Proceedings of the 8th international conference on Formal methods for components and objects
SoSL: a service-oriented stochastic logic
Rigorous software engineering for service-oriented systems
Reachability for finite-state process algebras using static analysis
RP'11 Proceedings of the 5th international conference on Reachability problems
Stochastic analysis of graph transformation systems: a case study in P2P networks
ICTAC'05 Proceedings of the Second international conference on Theoretical Aspects of Computing
ESOA'05 Proceedings of the Third international conference on Engineering Self-Organising Systems
Stochastic Graph Transformation Systems
Fundamenta Informaticae - SPECIAL ISSUE ON ICGT 2004
A uniform definition of stochastic process calculi
ACM Computing Surveys (CSUR)
| Hi-index | 0.00 |
This paper surveys and relates the basic concepts of process algebra and the modelling of continuous time Markov chains. It provides basic introductions to both fields, where we also study the Markov chains from an algebraic perspective, viz. that of Markov chain algebra. We then proceed to study the interrelation of reactive processes and Markov chains in this setting, and introduce the algebra of Interactive Markov Chains as an orthogonal extension of both process and Markov chain algebra. We conclude with comparing this approach to related (Markovian) stochastic process algebras by analysing the algebraic principles that they support.