5 votes
Accepted

Problem with definition of bisimilarity

You seem to be confusing the definition of bisimilarity with an algorithm for finding a bisimulation. In your examples, the states are indeed bisimilar, and the relation is the set $$\{(A,A)\}$$ It ...
user avatar
  • 16.2k
5 votes
Accepted

How does lack of deadlock relate to computability in process calculi?

I think you are asking about expressivity of concurrent programming languages. This is a deep and not well-understood field. For example you say that "the $\pi$-calculus [...] has the power to ...
user avatar
5 votes
Accepted

Terminologies of "Process calculus" and "Process algebra"

To my knowledge the two terms do not have a formal established definition and are often used interchangeably. There are different characteristics associated to each however, as @Dave already pointed ...
user avatar
4 votes

Terminologies of "Process calculus" and "Process algebra"

The distinction is not so clear. Nevertheless, here is an attempt to provide an alternative answer to your question. A calculus involves calculation. Thus a process calculus will involve a notion of ...
user avatar
2 votes
Accepted

Restriction and re-labeling on CCS

I am not completely sure about what is causing your confusion, but perhaps this can help: $a.\bar{b}.0$ can only perform $a$. $(a.\bar{b}.0)\setminus\{b\}$ can only perform $a$. $((a.\bar{b}.0)\...
user avatar
  • 14.2k
2 votes
Accepted

Weak bisimulation up-to $\approx$

(partial answer) For the relation $\mathcal{R} = \{(\tau.a, 0)\}$, $\mathcal{R} \nsubseteq \approx$ but $\mathcal{R} \subseteq \, \approx \! \mathcal{R} \approx$. Why is $\mathcal{R} \subseteq \,...
user avatar
  • 14.2k
2 votes

Are there (highly) restricted process calculi? Perhaps similar to formal grammar?

I wondered if there were much more restrictive formalisms for describing concurrent processes? Petri nets are IMO more restrictive than the process calculus and such. They are state-transition ...
user avatar
  • 1,911
1 vote

Benefit of Petri Net Transition as Separate Object

In my experience, the duality of Petri nets is a great strength. It forces us to specify the potential events or actions in a system (the transitions), as they may happen to individual items (the ...
user avatar
  • 4,696
1 vote

Benefit of Petri Net Transition as Separate Object

The state transition graph underlying a Petri Net model is called the Reachability Graph. Yes, it exists, and it is the foundation of Petri Net semantics. However, it is possible to define simple, ...
user avatar

Only top scored, non community-wiki answers of a minimum length are eligible