The FDR refinement-checking tool1 [5] relies fundamentally upon the congruences between operational and denotational semantics for CSP, in order to determine a denotational property by exploring an operationally presented system. But the calculation of the standard structured operational semantics of complex systems proves a bottleneck in the performance of the tool, and so we compile a custom inference system for each case, optimised for facilitating execution of the relevant queries. Recent developments have revealed how these calculations can be re-used in restructuring systems to maximise the potential for hierarchical compression and for export to a related probabilistic formalism. © Springer-Verlag Berlin Heidelberg 2005.
CITATION STYLE
Goldsmith, M. (2005). Operational semantics for fun and profit. In Lecture Notes in Computer Science (Vol. 3525, pp. 265–274). Springer Verlag. https://doi.org/10.1007/11423348_16
Mendeley helps you to discover research relevant for your work.