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 flexible abstraction mechanism for models of concurrency, which allows systems which “look the same” to be considered equivalent, is proposed. Using three classes of atomic observations (sequences of actions, sequences of multisets of actions and partial orderings of actions) different information on the causal and temporal structure of Event Structures, a basic model of parallelism, is captured...
Operational and denotational semantic models are designed for languages with process creation, and the relationships between the two semantics are investigated. The presentation is organized in four sections dealing with a uniform and static, a uniform and dynamic, a nonuniform and static, and a nonuniform and dynamic language, respectively. Here uniform/nonuniform refers to a language with uninterpreted/interpreted...
An outline is presented of the SMoLCS methodology for the specification of concurrent systems and languages. Its main novelties lie in a high level of modularity and parameterization and in the fact that, within the same homogeneous framework, functions, data types and concurrency can be handled together. Indeed a concurrent system is algebraically specified as an abstract data type obtained by instantiating...
A number of distinct views of distributed systems and ways for their formal modelling are explained, discussed, and related. By this, in particular, an attempt is undertaken to unify and show the connection between distinct approaches to formalizing distributed systems and programs describing them.
A new class of Petri Nets, called Augmented Condition/Event Systems is defined, by slightly relaxing the condition for enabling events. One system, called ΣCCS, from this class is used to give a new operational semantics to Milner's Calculus of Communicating Systems. The set of CCS agents together with the traditional, interleaving based, derivation relation is proved isomorphic to the case graph...
the paper discusses the relevance of a new logic called linear logic (Girard 1986) to computer science, and in particular to parallel computations. These general remarks will be detailed in a paper in preparation with Gianfranco Mascari.
In the first part of the paper we show how to construct categorical models for Milner's CCS [Mil80], Hoare's CSP [Hoa78], and similarly defined calculi for synchronized and parallel computations. We consider a generic category C of processes with morphisms which are labelled by strings of actions belonging to a monoid A. We define the synchronization between two processes in C as a functor...
The thesis we present in this paper states that for every concurrent program π there exists a set of modal formulas, also called the axioms Ax(π), such that a) the structure of admissible parallel executions of the program π is a Kripke model of the set Ax(π) and, b) any Kripke model of the axioms Ax(π) is an extension of the structure of all admissible distributed (i.e. parallel) executions of the...
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.