Home
Journals
Archaeology International
Architecture_MPS
Europe and the World: A law review
Film Education Journal
History Education Research Journal
International Journal of Development Education and Global Learning
International Journal of Social Pedagogy
Jewish Historical Studies: A Journal of English-Speaking Jewry
Journal of Bentham Studies
London Review of Education
Radical Americas
Research for All
The Journal of the Sylvia Townsend Warner Society
The London Journal of Canadian Studies
About
About UCL Press
Who we are
Contact us
My ScienceOpen
Sign in
Register
Dashboard
Search
Home
Journals
Archaeology International
Architecture_MPS
Europe and the World: A law review
Film Education Journal
History Education Research Journal
International Journal of Development Education and Global Learning
International Journal of Social Pedagogy
Jewish Historical Studies: A Journal of English-Speaking Jewry
Journal of Bentham Studies
London Review of Education
Radical Americas
Research for All
The Journal of the Sylvia Townsend Warner Society
The London Journal of Canadian Studies
About
About UCL Press
Who we are
Contact us
My ScienceOpen
Sign in
Register
Dashboard
Search
21
views
27
references
Top references
cited by
3
Cite as...
0 reviews
Review
0
comments
Comment
0
recommends
+1
Recommend
0
collections
Add to
0
shares
Share
Twitter
Sina Weibo
Facebook
Email
2,337
similar
All similar
Record
: found
Abstract
: not found
Book Chapter
: not found
Automata, Languages and Programming
On the Complexity of Bisimulation Problems for Basic Parallel Processes
other
Author(s):
Richard Mayr
Publication date
(Online):
February 18 2002
Publisher:
Springer Berlin Heidelberg
Read this book at
Publisher
Buy book
Review
Review book
Invite someone to review
Bookmark
Cite as...
There is no author summary for this book yet. Authors can add summaries to their books on ScienceOpen to make them more accessible to a non-specialist audience.
Related collections
Karger: Cardiovascular System
Most cited references
27
Record
: found
Abstract
: not found
Book
: not found
Process Algebra
J. Baeten
,
W. Weijland
(2010)
0
comments
Cited
45
times
– based on
0
reviews
Bookmark
Record
: found
Abstract
: not found
Article
: not found
Three Partition Refinement Algorithms
Robert Paige
,
Robert Tarjan
(1987)
0
comments
Cited
36
times
– based on
0
reviews
Review now
Bookmark
Record
: found
Abstract
: not found
Article
: not found
Process Rewrite Systems
Richard Mayr
(2000)
0
comments
Cited
18
times
– based on
0
reviews
Review now
Bookmark
All references
Author and book information
Book Chapter
Publication date (Print):
2000
Publication date (Online):
February 18 2002
Pages
: 329-341
DOI:
10.1007/3-540-45022-X_29
SO-VID:
55b9dce7-9865-4187-a3b8-0c3d0fdf11f6
History
Data availability:
Comments
Comment on this book
Sign in to comment
Book chapters
pp. 283
An Optimal Online Algorithm for Bounded Space Variable-Sized Bin Packing
pp. 663
On Deciding if Deterministic Rabin Language Is in Büchi Class
pp. 61
Improved Shortest Paths on the Word RAM
pp. 744
A Complete Axiomatization for Observational Congruence of Prioritized Finite-State Behaviors
pp. 73
Improved Algorithms for Finding Level Ancestors in Dynamic Trees
pp. 103
Reasoning about Idealized ALGOL Using Regular Languages
pp. 329
On the Complexity of Bisimulation Problems for Basic Parallel Processes
pp. 499
Extended Notions of Security for Multicast Public Key Cryptosystems
pp. 576
Scalable Secure Storage when Half the System Is Faulty
pp. 624
Hardness of Set Cover with Intersection 1
pp. 717
Deterministic Radio Broadcasting
pp. 729
An ω-Complete Equational Specification of Interleaving
pp. 780
On the Logical Characterisation of Performability Properties
pp. 902
Gales and the Constructive Dimension of Individual Sequences
Similar content
2,337
Normal Form Bisimulations for Delimited-Control Operators
Authors:
Dariusz Biernacki
,
Sergueï Lenglet
Relators and Metric Bisimulations
Authors:
J.J.M.M. RUTTEN
,
J.J.M.M. Rutten
Bisimulations and bisimulation quotients of generalized Veltman models
Authors:
D. Vrgoc
,
M Vukovic
See all similar
Cited by
3
Undecidable problems in unreliable computations
Authors:
Richard Mayr
Strong Bisimilarity and Regularity of Basic Process Algebra Is PSPACE-Hard
Authors:
Jiří Srba
Undecidability of Weak Bisimilarity for PA-Processes
Authors:
Jiří Srba
See all cited by