نتایج جستجو برای: process algebra

تعداد نتایج: 1375182  

Journal: :J. Log. Algebr. Program. 2005
Pieter J. L. Cuijpers Michel A. Reniers

• A submitted manuscript is the author's version of the article upon submission and before peer-review. There can be important differences between the submitted version and the official published version of record. People interested in the research are advised to contact the author for the final version of the publication, or visit the DOI to the publisher's website. • The final author version ...

Journal: :J. Log. Algebr. Program. 2007
Insup Lee Anna Philippou Oleg Sokolsky

The Algebra of Communicating Shared Resources (ACSR) is a timed process algebra which extends classical process algebras with the notion of a resource. It takes the view that the timing behavior of a real-time system depends not only on delays due to process synchronization, but also on the availability of shared resources. Thus, ACSR employs resources as a basic primitive and it represents a r...

1999
Gerald Lüttgen Michael von der Beeck Rance Cleaveland

Statecharts is a visual language for specifying the behavior of reactive systems. The language extends nite-state machines with concepts of hierarchy, concurrency, and priority. Despite its popularity as a design notation for embedded systems, precisely de ning its semantics has proved extremely challenging. In this paper, a simple process algebra, called Statecharts Process Language (SPL), is ...

2011
Vaughan R. Pratt

A linear process is a system of events and states related by an inner product, on which are defined the behaviorally motivated operations of tensor product or orthocurrence, sum or concurrence, sequence, and choice. Linear process algebra or LPA is the theory of this framework. LPA resembles Girard’s linear logic with the differences attributable to its focus on behavior instead of proof. As wi...

2007
Oliver Wendt Wolfgang König

Micro-economic theory defines productions as the process of transforming inputs (production factors) into outputs (products). In order to explain efficient production and to provide means to select the best alternative from a set of possible production processes, two fundamental theories have been developed: The so called activity analysis [KOOPMANS 51] and the theory of production corresponden...

2014
Anastasis Georgoulas Jane Hillston Dimitrios Milios Guido Sanguinetti

Formal modelling languages such as process algebras are widespread and effective tools in computational modelling. However, handling data and uncertainty in a statistically meaningful way is an open problem in formal modelling, severely hampering the usefulness of these elegant tools in many real world applications. Here we introduce ProPPA, a process algebra which incorporates uncertainty in t...

1999
T. Basten

To date, many different formalisms exist for describing and analyzing the behavior of concurrent systems. Petri nets and process algebras are two well-known classes of such formalisms. Petri-net theory is well suited for reasoning about concurrent systems in a partial-order framework; it handles causal relationships between actions of concurrent systems in an explicit way. Process algebras, on ...

1996
Marco Bernardo Roberto Gorrieri

EMPA enhances the expressiveness of classical process algebras by integrating functional and performance descriptions of concurrent systems. This is achieved by ooering, besides passive actions (useful for pure nondeterminism), actions whose duration is exponentially distributed as well as immediate actions (useful for performance abstraction), parametrized by priority levels (hence prioritized...

2012
Suzana Andova

• A submitted manuscript is the author's version of the article upon submission and before peer-review. There can be important differences between the submitted version and the official published version of record. People interested in the research are advised to contact the author for the final version of the publication, or visit the DOI to the publisher's website. • The final author version ...

1993
Jan A. Bergstra Alban Ponse Jos van Wamel

An extension of process algebra for modelling processes with backtracking is introduced. This extension is semantically based on processes that transform data because, in our view, backtracking is the undoing of the eeects caused by a process in some initial data-state if this process fails. The data-states are given by a data environment, which is a structure that also deenes in which data-sta...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید