Trace Refinement of Action Systems
CONCUR '94 Proceedings of the Concurrency Theory
A Compositional Trace-Based Semantics for Probabilistic Automata
CONCUR '95 Proceedings of the 6th International Conference on Concurrency Theory
From Kleene Algebra to Refinement Algebra
MPC '02 Proceedings of the 6th International Conference on Mathematics of Program Construction
Reliability assessment through probabilistic refinement
Nordic Journal of Computing
Cost Analysis of Games, Using Program Logic
APSEC '01 Proceedings of the Eighth Asia-Pacific on Software Engineering Conference
Science of Computer Programming - Special issue on mathematics of program construction (MPC 2002)
Reasoning algebraically about probabilistic loops
ICFEM'06 Proceedings of the 8th international conference on Formal Methods and Software Engineering
Using probabilistic kleene algebra for protocol verification
RelMiCS'06/AKA'06 Proceedings of the 9th international conference on Relational Methods in Computer Science, and 4th international conference on Applications of Kleene Algebra
On two dually nondeterministic refinement algebras
RelMiCS'06/AKA'06 Proceedings of the 9th international conference on Relational Methods in Computer Science, and 4th international conference on Applications of Kleene Algebra
RelMiCS'06/AKA'06 Proceedings of the 9th international conference on Relational Methods in Computer Science, and 4th international conference on Applications of Kleene Algebra
Refinement algebra with operators for enabledness and termination
MPC'06 Proceedings of the 8th international conference on Mathematics of Program Construction
Probabilistic Choice in Refinement Algebra
MPC '08 Proceedings of the 9th international conference on Mathematics of Program Construction
| Hi-index | 0.00 |
A trace semantics is given for a probabilistic reactive language which is capable of modelling probabilistic action systems. It is shown that reactive probabilistic programs with the trace semantics form a general refinement algebra. The abstract-algebraic characterisation means that the proofs of earlier-established transformation rules can be reused for probabilistic action systems with trace semantics.