Results 221 to 230 of about 17,836 (258)
Non-commutative L p spaces and Grassmann stochastic analysis. [PDF]
Probab Theory Relat FieldsDe Vecchi F +3 more
europepmc +1 more source
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 +4 more sources
Process algebra for hybrid systems
Theoretical Computer Science, 2005 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
J A Bergstra, C A Middelburg
exaly +10 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 +5 more sources
Process algebra with combinators
, 2006 We introduce typed combinatory process algebra, a system combining process algebra with types and combinators. We describe its syntax and semantics, and by way of example, verify within this frame-work the Simple Alternating Bit Protocol.
Alban Ponse +2 more
exaly +3 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
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