ScienceOpen:
research and publishing network
For Publishers
Discovery
Metadata
Peer review
Hosting
Publishing
For Researchers
Join
Publish
Review
Collect
My ScienceOpen
Sign in
Register
Dashboard
Blog
About
Search
Advanced search
My ScienceOpen
Sign in
Register
Dashboard
Search
Search
Advanced search
For Publishers
Discovery
Metadata
Peer review
Hosting
Publishing
For Researchers
Join
Publish
Review
Collect
Blog
About
30
views
15
references
Top references
cited by
17
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,211
similar
All similar
Record
: found
Abstract
: not found
Book Chapter
: not found
CONCUR'98 Concurrency Theory
Automata and coinduction (an exercise in coalgebra)
other
Author(s):
J. J. M. M. Rutten
Publication date
(Online):
May 28 2006
Publisher:
Springer Berlin Heidelberg
Read this book at
Publisher
Further versions
oa repository (via OAI-PMH title and first author match)
oa repository (via OAI-PMH title and first author match)
Powered by
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
ScienceOpen Research
Most cited references
15
Record
: found
Abstract
: not found
Article
: not found
Finite Automata and Their Decision Problems
M. Rabin
,
Richard D Scott
(1959)
0
comments
Cited
221
times
– based on
0
reviews
Review now
Bookmark
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
Derivatives of Regular Expressions
Janusz A. Brzozowski
(1964)
0
comments
Cited
92
times
– based on
0
reviews
Review now
Bookmark
All references
Author and book information
Book Chapter
Publication date (Print):
1998
Publication date (Online):
May 28 2006
Pages
: 194-218
DOI:
10.1007/BFb0055624
SO-VID:
3eee6e99-7162-430a-b3ba-6c6c0a8b304b
History
Data availability:
Comments
Comment on this book
Sign in to comment
Book chapters
pp. 131
Minimality and separation results on asynchronous mobile processes
pp. 237
Priority and maximal progress are completely axiomatisable (extended abstract)
pp. 50
The regular viewpoint on PA-processes
pp. 194
Automata and coinduction (an exercise in coalgebra)
pp. 332
Detecting deadlocks in concurrent systems
pp. 423
Stochastic transition systems
pp. 439
It's about time: Real-time logics reviewed
pp. 470
On discretization of delays in timed automata and digital circuits
pp. 485
Partial order reductions for timed systems
pp. 533
Deriving unbounded Petri nets from formal languages
Similar content
2,211
Generalised Coinduction
Authors:
F. Bartels
Adapting Big-Step Semantics to Small-Step Style: Coinductive Interpretations and “Higher-Order” Derivations
Authors:
Husain Ibraheem
,
David Schmidt
A Portable and Efficient Implementation of Coinductive Logic Programming
Authors:
Paulo Moura
See all similar
Cited by
17
Behavioural differential equations: a coinductive calculus of streams, automata, and power series
Authors:
J.J.M.M. Rutten
Checking NFA equivalence with bisimulations up to congruence
Authors:
Filippo Bonchi
,
Damien Pous
A Bialgebraic Review of Deterministic Automata, Regular Expressions and Languages
Authors:
Bart Jacobs
See all cited by