148 search results - page 7 / 30 » On the extender algebra being complete |
SEFM
2006
IEEE
14 years 1 months ago
2006
IEEE
We define a model of labelled product systems of automata and explore its connections with process calculi and trace languages. Bisimilarity of labelled product systems is defin...
ARTS
1999
Springer
13 years 12 months ago
1999
Springer
Published results show that various models may be obtained by combining parallel composition with probability and with or without non-determinism. In this paper we treat this probl...
BIRTHDAY
2000
Springer
13 years 12 months ago
2000
Springer
The axiom system ACP of [10] was extended to discrete time in [6]. Here, we proceed to define the silent step in this theory in branching bisimulation semantics [7, 15] rather th...
APN
1995
Springer
13 years 11 months ago
1995
Springer
The first part of this paper gives an algebraic semantics for Place/Transition nets in terms of an algebra which is based on the process algebra ACP. The algebraic semantics is s...
FSEN
2009
Springer
14 years 2 months ago
2009
Springer
We provide an equational theory for Restricted Broadcast Process Theory to reason about ad hoc networks. We exploit an extended algebra called Computed Network Theory to axiomatize...