Results 251 to 260 of about 435,235 (283)
Some of the next articles are maybe not open access.
2008 23rd Annual IEEE Symposium on Logic in Computer Science, 2008
We present an extension of the πI-calculus with formal sums of terms. A study of the properties of this sum reveals that its neutral element 0 can be used to make assumptions about the behaviour of the environment of a process. From this observation we derive an enriched calculus that enjoys a confluent reduction which preserves the testing semantics ...
openaire +2 more sources
We present an extension of the πI-calculus with formal sums of terms. A study of the properties of this sum reveals that its neutral element 0 can be used to make assumptions about the behaviour of the environment of a process. From this observation we derive an enriched calculus that enjoys a confluent reduction which preserves the testing semantics ...
openaire +2 more sources
First Joint IEEE/IFIP Symposium on Theoretical Aspects of Software Engineering (TASE '07), 2007
An original notion of symmetry for process algebra is defined, which is based on permutation groups. Given a process which is regarded as a structure and a permutation group on it, the quotient process (reduced process) is showed to be interleaving trace equivalent and interleaving bisimulation equivalent to the original process.
Jianmin Jiang, Jinzhao Wu, Hongping Shu
openaire +1 more source
An original notion of symmetry for process algebra is defined, which is based on permutation groups. Given a process which is regarded as a structure and a permutation group on it, the quotient process (reduced process) is showed to be interleaving trace equivalent and interleaving bisimulation equivalent to the original process.
Jianmin Jiang, Jinzhao Wu, Hongping Shu
openaire +1 more source
Process Algebras for Network Communication
Fundamenta Informaticae, 2001Critical issues that arise when process algebras are used for protocol specifications are discussed. To overcome some of these problems, a process algebra for protocol specifications is presented. It is based on Milner's Calculus of Communicating Systems, which is enriched by time and network reasoning.
Damas P. Gruska +1 more
openaire +4 more sources
Translating timed process algebra into prioritized process algebra
1991A process algebra with priority and time is presented, based on linear timed CCS. It is given a set of axioms and a transition system semantics. The axioms are then shown to be equivalent to strong bisimulation over the transitions. It is shown how to translate any timed process into the untimed algebra, by time-stamping each action, Thus, maximal ...
openaire +1 more source
Timing and causality in process algebra
Acta Informatica, 1996zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Aceto, Luca, Murphy, D.
openaire +3 more sources
Parallel Processing in Boolean Algebra
IEEE Transactions on Computers, 1972A processor called Boolean analyzer has been presented at the 1968 IFIP Congress to introduce parallel processing of Boolean expressions [1]. The present paper shows how to increase its speed many times by making its processing more parallel. The applications of the Boolean analyzer are limited to few but important problems.
openaire +1 more source
2011
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.
openaire +1 more source
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.
openaire +1 more source
A process algebra based on Linda
1996The problem of comparing and analyzing the relationships between distributed programs written in the same concurrent programming language is addressed. It arises each time one wants to establish program correctness with respect to a notion of “being an approximation of”.
De Nicola, Rocco, PUGLIESE, ROSARIO
openaire +2 more sources
Exception Handling in Process Algebra
1993Abstract in ...
Boer, de, F.S. +2 more
openaire +2 more sources
Process Algebra with Nonstandard Timing
Fundamenta Informaticae, 2002The possibility of two or more actions to be performed consecutively at the same point in time is not excluded in the process algebras from the framework of process algebras with timing presented by Baeten and Middelburg [Handbook of Process Algebra, Elsevier, 2001, Chapter 10].
openaire +3 more sources