"Complexity of Checking Bisimilarity between Sequential and Parallel Processes."

Wojciech Czerwinski et al. (2013)

> Home

Details and statistics

DOI: 10.1007/978-3-642-40313-2_28

access: closed

type: Conference or Workshop Paper

metadata version: 2023-09-30

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/mfcs/CzerwinskiJKS13
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/mfcs/CzerwinskiJKS13
Wojciech Czerwinski, Petr Jancar, Martin Kot, Zdenek Sawa:
Complexity of Checking Bisimilarity between Sequential and Parallel Processes. MFCS 2013: 302-313

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.