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 7

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

Verification on Infinite Structures

Olaf Burkart, Didier Caucal, Faron Moller … (2001)

0 comments Cited 19 times – based on 0 reviews

Bookmark

Record: found
Abstract: not found
Article: not found

A polynomial algorithm for deciding bisimilarity of normed context-free processes

Yoram Hirshfeld, Mark Jerrum, Faron Moller (1996)

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

Bookmark

Record: found
Abstract: not found
Article: not found

Bisimulation Equivalence Is Decidable for All Context-Free Processes

S. Christensen, C. Stirling, H. Huttel (1995)

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

Bookmark

All references

Author and book information

Book Chapter

Publication date (Print): 2009

Pages: 259-273

DOI: 10.1007/978-3-642-04081-8_18

SO-VID: 00d5376f-a90a-4952-b935-8ebb347f6e2d

History

Data availability:

Comments

Comment on this book

Book chapters

Cited by 1

Reachability Problem for Weak Multi-Pushdown Automata
Authors: Wojciech Czerwiński, Sławomir Lasota, Piotr Hofman

See all cited by

Partially-Commutative Context-Free Processes

Read this book at

Related collections

Sex and gender-sensitive medicine

Most cited references 7

Verification on Infinite Structures

A polynomial algorithm for deciding bisimilarity of normed context-free processes

Bisimulation Equivalence Is Decidable for All Context-Free Processes

Author and book information

Book Chapter

History

Comments

Comment on this book

Book chapters

Similar content 3,865

Cited by 1