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

Most cited references 11

Record: found
Abstract: not found
Book Chapter: not found

Concurrency and automata on infinite sequences

David Park (1981)

0 comments Cited 119 times – based on 0 reviews

Bookmark

Record: found
Abstract: not found
Article: not found

Algebra of communicating processes with abstraction

J.A. Bergstra, J.W. Klop (1985)

0 comments Cited 51 times – based on 0 reviews      Review now

Bookmark

Record: found
Abstract: not found
Book Chapter: not found

Bisimulation equivalence is decidable for basic parallel processes

Søren Thromsholdt Christensen, Yoram Hirshfeld, Faron Moller (1993)

0 comments Cited 17 times – based on 0 reviews

Bookmark

All references

Author and book information

Book Chapter

Publication date (Print): 1999

Publication date (Online): January 18 2002

Pages: 412-421

DOI: 10.1007/3-540-48523-6_38

SO-VID: 2caf9a2f-5238-4aed-ae76-df2f6e27f9fc

History

Data availability:

Comments

Comment on this book

Book chapters

Cited by 7

See all cited by

Bisimulation Equivalence Is Decidable for Normed Process Algebra (Extended abstract)

Read this book at

Related collections

Numerical Algebra, Matrix Theory, Differential-Algebraic Equations, and Control Theory

Most cited references 11

Concurrency and automata on infinite sequences

Algebra of communicating processes with abstraction

Bisimulation equivalence is decidable for basic parallel processes

Author and book information

Book Chapter

History

Comments

Comment on this book

Book chapters

Similar content 2,759

Cited by 7