Communication and concurrency
Artificial intelligence and mathematical theory of computation
Reasoning about nondeterministic and concurrent actions: a process algebra approach
Artificial Intelligence
Topology in process calculus: approximate correctness and infinite evolution of concurrent programs
Topology in process calculus: approximate correctness and infinite evolution of concurrent programs
Hi-index | 0.00 |
A reasonable transition rule is proposod for synchronized actions and some equational properties of bisimilarity and weak bisimilarity in the process algebra for reasoning about concurrent, actions are presented.