On the consistency of Koomen's fair abstraction rule
Theoretical Computer Science
Process Algebra with Timing
General distributions in process algebra
Lectures on formal methods and performance analysis
An Overview and Synthesis on Timed Process Algebras
Proceedings of the Real-Time: Theory in Practice, REX Workshop
Model checking stochastic automata
ACM Transactions on Computational Logic (TOCL)
MODEST: A Compositional Modeling Formalism for Hard and Softly Timed Systems
IEEE Transactions on Software Engineering
Real-Time Process Algebra with Stochastic Delays
ACSD '07 Proceedings of the Seventh International Conference on Application of Concurrency to System Design
A theory of stochastic systems part I: Stochastic automata
Information and Computation
A theory of Stochastic systems. Part II: Process algebra
Information and Computation
Embedding real time in stochastic process algebras
EPEW'06 Proceedings of the Third European conference on Formal Methods and Stochastic Models for Performance Evaluation
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
Weak stochastic bisimulation for non-markovian processes
ICTAC'05 Proceedings of the Second international conference on Theoretical Aspects of Computing
Fundamenta Informaticae - Application of Concurrency to System Design
Hi-index | 0.00 |
When extending timed process algebra with discrete stochastic time, typical standard notions like time additivity are hard to preserve in the presence of the race condition. We propose context-sensitive interpolation as a restricted form of time additivity to accommodate the extension with stochastic time. We also present a stochastic process algebra featuring an explicit account of two types of race conditions in terms of conditional random variables. The approach enables compositional modeling, a non-trivial expansion law, and explicit manipulation of maximal progress.