A Labelled Transition System for - CalculusFranck
نویسنده
چکیده
A labelled transition system is presented for Milner's-calculus. This system is related to the reduction system for the calculus presented by Bellin and Scott. Also a reduction system and a labelled transition system for I-calculus are given and their correspondence is studied. This calculus is a subcalculus of-calculus in the way Sangiorgi's I-calculus is a subcalculus of ordinary-calculus.
منابع مشابه
Reportrapport Generalizing Finiteness Conditions of Labelled Transition Systems Generalizing Finiteness Conditions of Labelled Transition Systems
A labelled transition system is provided with some additional structure by endowing the conngurations and the labels with a complete metric. In this way, a so-called metric labelled transition system is obtained. The additional structure on a metric labelled transition system makes it possible to generalize the niteness conditions nitely branching and image nite to compactly branching and image...
متن کاملA Theory of Metric Labelled Transition Systems
Labelled transition systems are useful for giving semantics to programming languages. Kok and Rutten have developed some theory to prove semantic models deened by means of labelled transition systems to be equal to other semantic models. Metric labelled transition systems are labelled transition systems with the conngurations and actions endowed with metrics. The additional metric structure all...
متن کاملAn Epistemic Logic for Labelled Transition Systems
We define an epistemic logic for labelled transition systems by introducing equivalence relations for the agents on the states of the labelled transition system. The idea is that agents observe the dynamics of the system modulo their ability to distinguish states and in the process learn about the current state and past history of the execution. This is in the spirit of dynamic epistemic logic ...
متن کاملUsing maximality-based labelled transition system as a model for petri nets
This work deals with the specification and the verification of concurrent systems. Our goal is to exploit an implementable model, namely the maximality -based labelled transition system, which permits expressing true-concurrency in a natural way without splitting actions on their start and end events. To do this, we give an operational semantics to build maximality-based labelled transition sys...
متن کاملGeneralized Finiteness Conditions of Labelled Transition Systems
A labelled transition system is provided with some additional structure by endowing the con gurations and the labels with a complete metric In this way a so called metric labelled transition system is obtained The additional structure on a metric labelled transition systemmakes it possible to generalize the niteness conditions nitely branching and image nite to compactly branching and image com...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006