The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
A notation based on pipes in the unix TM operating system is proposed for combining functions in a linear order. Examples suggest that semantic rules using pipes (i.e. the notation) are easy to read and understand, even for readers with little knowledge of semantics. The readability is a consequence of the operational intuition associated with pipes. The operational view is that each function is handed...
The possibly non distributive event domains which arise from Winskel's event structures with binary conflict are known to coincide with the domains of configurations of Stark's trace automata. We prove that whenever the transitive reduction of the order on finite elements in an event domain is a context-free graph in the sense of Müller and Schupp, that event domain may also be generated from a finite...
Considering graphs as multisets of arcs, we define their rewritings as simple set-theoretic rewritings: applying a rule consists of removing the left-hand side and adding the right-hand side. This method can simulate categorical graph rewritings, provided that no two vertices are identified. On the other hand, rewriting is possible in cases where the double push-out method does not apply, and where...
we give an equational definition for relations over trees, show that they can be described by rational expressions and give sufficient restrictions on the generated relations to ensure the rationality of their domain and range, and their stability under inverse, composition and substitution. We get in this way “rational tree transductions” extending to the case of trees the well known rational transductions...
The possibly non-distributive event domains which arise from Winskel's event structures with binary conflict are known to coincide with the domains of configurations of Stark's trace automata. We prove that whenever the transitive reduction of the order on finite elements in an event domain is a context-free graph in the sense of Müller and Schupp, the event domain may also be generated from a finite...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.