The behaviour of a computational device is often naturally defined by means of reduction semantics: a set representing the possible states of the device, and an unlabelled relation among them, usually inductively defined, representing the possible evolutions of the device. Despite the advantage of conveying the semantics with few compact rewriting rules, freely instantiated and contextualized, the main drawback of reduction-based solutions is that the dynamic behaviour of a system is described in a monolithic way, and so it can be interpreted only by inserting the system in appropriate contexts, where a reduction may take place. © 2010 Springer-Verlag.
CITATION STYLE
Monreale, G. V. (2010). LTS semantics for process calculi from their graphical encodings. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6372 LNCS, pp. 403–406). https://doi.org/10.1007/978-3-642-15928-2_33
Mendeley helps you to discover research relevant for your work.