## Enhanced Operational Semantics (1996)

Venue: | ACM Computing Surveys |

Citations: | 40 - 16 self |

### BibTeX

@ARTICLE{Degano96enhancedoperational,

author = {Pierpaolo Degano and Corrado Priami},

title = {Enhanced Operational Semantics},

journal = {ACM Computing Surveys},

year = {1996},

volume = {28},

pages = {59--91}

}

### Years of Citing Articles

### OpenURL

### Abstract

designers, implementors, users) must understand it. They can be roughly divided in two main groups. The first group is particularly interested in the behavioural aspects of systems, i.e. in what they do, regardless of how. The other group is concerned with the quantitative aspects of systems, i.e. how efficiently they perform. The considerations above call for a semantics as usable as possible, with an underlying theory accordingly simple. Operational semantics is such because it describes the essential features that any computing device has. Thus, also final users may grasp the meaning of a definition driven by their experience on their own machine. Moreover, it is sufficient to decorate transition systems with the relevant information to describe in detail complex systems. For example, one can enhance operational semantics to describe aspects of concurrent and distributed processes, that we discuss here more <F23.

### Citations

1310 | A structural approach to operational semantics
- Plotkin
- 1981
(Show Context)
Citation Context ...lled by the activity they represent, give rise to a transition system. A logical approach to operational semantics is due to Plotkin, and to his formal method, called structural operational semantics =-=[11, 10]-=-. It exploits the duality between languages and abstract machines, so one deduces transitions by inducing on the syntactic structure of the machine itself. We propose an enhancement to structural oper... |

1017 | A calculus of mobile processes
- Milner, Parrow, et al.
- 1992
(Show Context)
Citation Context ...stems in a single methodology. Proved transition systems are detailed enough to express these quantitative aspects; see [12]. In [6], we applied our proposal to some process calculi, like ��-calcu=-=lus [9]-=-, and to the real distributed language Facile [8], thus showing the scalability of our approach. Next, we discuss how proved transition systems can originate a hierarchy of semantic descriptions of th... |

468 | The chemical abstract machine
- Berry, Boudol
- 1990
(Show Context)
Citation Context ...ically, the truly concurrent evolution of recursive processes requires infinite transition systems when described by decomposing states into sets or multisets of their independent sub-processes (cfr. =-=[1, 7]-=-). Performance evaluation and other quantitative analysis should start already at the design level. Besides robustness and reliability of the design, these early measures may save efforts. Indeed, if ... |

205 |
The Concurrency Workbench: a semantics-based tool for the Verification of concurrent systems
- Cleaveland, Parrow, et al.
- 1993
(Show Context)
Citation Context ... handled locally. Our economic, parametric approach goes towards a long-run goal: the realization of (semi-) automatic verification tools to be integrated in a programming environment for concurrency =-=[4]-=-. Again parametricity saves efforts. In fact, the implementation of verification tools is complex and expensive. If the tool is highly specialized, its cost may not be justified. Instead, parametric t... |

162 |
Facile: A symmetric integration of concurrent and functional programming
- Giacalone, Mishra, et al.
- 1989
(Show Context)
Citation Context ...systems are detailed enough to express these quantitative aspects; see [12]. In [6], we applied our proposal to some process calculi, like ��-calculus [9], and to the real distributed language Fac=-=ile [8]-=-, thus showing the scalability of our approach. Next, we discuss how proved transition systems can originate a hierarchy of semantic descriptions of the same process that are closer and closer to actu... |

139 | Semantics with Applications: a formal introduction
- Nielson, Nielson
- 1992
(Show Context)
Citation Context ...lled by the activity they represent, give rise to a transition system. A logical approach to operational semantics is due to Plotkin, and to his formal method, called structural operational semantics =-=[11, 10]-=-. It exploits the duality between languages and abstract machines, so one deduces transitions by inducing on the syntactic structure of the machine itself. We propose an enhancement to structural oper... |

29 | Causality for mobile processes
- Degano, Priami
- 1995
(Show Context)
Citation Context ...s, implementing the motto TRANSITIONS AS PROOFS. Then, simple relabellings yield the main semantics presented in the literature, and their comparison is reduced to compare their relabelling functions =-=[6]-=-. One innovative aspect of our approach is that no auxiliary data structure is recorded in states as other parametric theories do [5]. As a consequence, we can re-use, without almost no modifications,... |

22 |
Stochastic �-calculus
- Priami
- 1995
(Show Context)
Citation Context ...d. This calls for the integration of behavioural and quantitative analysis of systems in a single methodology. Proved transition systems are detailed enough to express these quantitative aspects; see =-=[12]. In-=- [6], we applied our proposal to some process calculi, like ��-calculus [9], and to the real distributed language Facile [8], thus showing the scalability of our approach. Next, we discuss how pro... |

8 | An efficient verifier of truly concurrent properties
- Bianchi, Coluccini, et al.
- 1995
(Show Context)
Citation Context ...nctions. Indeed, the kernel of a parametric tool coincides with the construction of the proved transition system. It has the same shape and the same space and time complexity of the interleaving case =-=[2]-=-. Then, model checking and (bisimulation-based) equivalence verifications are completely standard. We sketched quite general and powerful an operational description of systems that could be used at an... |

7 | Mobile processes with a distributed environment
- Bodei, Degano, et al.
- 1996
(Show Context)
Citation Context ...rmation about the specific architecture on which the real implementation runs is crucial. For example, consider the problem of transforming global environments of mobile processes into local ones. In =-=[3]-=-, we derived from the proved transition system the parallel structure of processes and to build relative addresses. Once names are enriched with these addresses, they are handled locally. Our economic... |

7 |
Universal axioms for bisimulations
- Degano, Nicola, et al.
- 1993
(Show Context)
Citation Context ...their comparison is reduced to compare their relabelling functions [6]. One innovative aspect of our approach is that no auxiliary data structure is recorded in states as other parametric theories do =-=[5]-=-. As a consequence, we can re-use, without almost no modifications, in the truly concurrent setting the rich and appealing semantics and tools developed for the interleaving case where concurrency is ... |

7 |
An Extended Expansion Theorem
- Ferrad, Gorrieri, et al.
(Show Context)
Citation Context ...ically, the truly concurrent evolution of recursive processes requires infinite transition systems when described by decomposing states into sets or multisets of their independent sub-processes (cfr. =-=[1, 7]-=-). Performance evaluation and other quantitative analysis should start already at the design level. Besides robustness and reliability of the design, these early measures may save efforts. Indeed, if ... |