Results 261 to 270 of about 11,242,864 (292)
An Algebra of Quantum Processes [PDF]
ACM Transactions on Computational Logic, 2009 We introduce an algebra qCCS of pure quantum processes in which communications by moving quantum states physically are allowed and computations are modeled by super-operators, but no classical data is explicitly involved. An operational semantics of qCCS is presented in terms of (nonprobabilistic) labeled transition systems. Strong bisimulation between
Yuan Feng, Zhengfeng Ji, Mingsheng Ying
exaly +3 more sources
The Journal of Logic and Algebraic Programming, 2005 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
M A Reniers, P J L Cuijpers
exaly +5 more sources
A Complete Finite Prefix for Process Algebra
Lecture Notes in Computer Science, 1999 In this paper we show how to use McMillan’s complete finite prefix approach for process algebra. We present the model of component event structures as a semantics for process algebra, and show how to construct a complete finite prefix for this model.
Rom Langerak, Ed Brinksma
exaly +2 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
‘Closed Interval Process Algebra’ versus ‘Interval Process Algebra’
Acta Informatica, 2001zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Flavio Corradini, Marco Pistore
openaire +6 more sources
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
2002
This book is concerned with a number of theories that can be used for describ ing and analyzing systems of interacting components in case it is desirable or necessary to regard their time-dependent behavior. Society is becoming increasingly more dependent on complex computer based systems that are composed of several components that act concurrently ...
Jos C. M. Baeten, Cornelis A. Middelburg
openaire +2 more sources
This book is concerned with a number of theories that can be used for describ ing and analyzing systems of interacting components in case it is desirable or necessary to regard their time-dependent behavior. Society is becoming increasingly more dependent on complex computer based systems that are composed of several components that act concurrently ...
Jos C. M. Baeten, Cornelis A. Middelburg
openaire +2 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 +2 more sources
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
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