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
29
views
9
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
3,943
similar
All similar
Record
: found
Abstract
: not found
Book Chapter
: not found
Bisimulation equivalence is decidable for basic parallel processes
other
Author(s):
Søren Christensen
,
Yoram Hirshfeld
,
Faron Moller
Publication date
(Online):
May 27 2005
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
9
Record
: found
Abstract
: not found
Book Chapter
: not found
The linear time - branching time spectrum
R. J. van Glabbeek
(1990)
0
comments
Cited
41
times
– based on
0
reviews
Bookmark
Record
: found
Abstract
: not found
Article
: not found
Two Complete Axiom Systems for the Algebra of Regular Events
Arto Salomaa
(1966)
0
comments
Cited
34
times
– based on
0
reviews
Review now
Bookmark
Record
: found
Abstract
: not found
Article
: not found
A complete inference system for a class of regular behaviours
Robin Milner
(1984)
0
comments
Cited
34
times
– based on
0
reviews
Review now
Bookmark
All references
Author and book information
Book Chapter
Publication date (Print):
1993
Publication date (Online):
May 27 2005
Pages
: 143-157
DOI:
10.1007/3-540-57208-2_11
SO-VID:
8bf43e68-394d-4991-bc74-b9e6d91f1ba3
History
Data availability:
Comments
Comment on this book
Sign in to comment
Book chapters
pp. 1
The lambda-calculus with multiplicities
pp. 7
A multiset semantics for the pi-calculus with replication
pp. 22
Model checking mobile processes
pp. 37
A practical technique for process abstraction
pp. 50
Modular completeness for Communication Closed Layers
pp. 82
A classification of models for concurrency
pp. 97
On the ill-timed but well-caused
pp. 112
On the reduction of chocs bisimulation to π-calculus bisimulation
pp. 127
A theory of bisimulation for the π-calculus
pp. 143
Bisimulation equivalence is decidable for basic parallel processes
pp. 158
A pi-calculus semantics for an object-based design notation
pp. 173
Programming with broadcasts
pp. 188
Interpreting broadcast communication in SCCS
pp. 202
Proof systems for message-passing process algebras
pp. 217
Refinement and decomposition of value-passing action systems
pp. 233
Partial-order methods for temporal verification
pp. 247
Model construction for implicit specifications in modal logic
pp. 262
Branching time temporal logic and amorphous tree automata
pp. 278
A generalized event structure for the Muller unfolding of a safe net
pp. 293
Domains of higher-dimensional automata
pp. 308
Non interleaving process algebra
pp. 324
Quiescence, fairness, testing, and the notion of implementation
pp. 339
Two fully abstract models for UNITY
pp. 353
Transformations preserving properties and properties preserved by transformations in fair transition systems (extended abstract)
pp. 368
Minimal memory schedules for dataflow networks
pp. 384
Networks of real-time processes
pp. 398
Loop parallelization in the polytope model
pp. 417
ACSR: An algebra of communicating shared resources with dense time and priorities
pp. 432
An Elimination Theorem for regular behaviours with integration
pp. 447
A linear local model checking algorithm for CTL
pp. 462
Local event structures and Petri nets
pp. 477
A congruence theorem for structured operational semantics with predicates
pp. 493
From CML to process algebras
pp. 524
Principal typing schemes in a polyadic π-calculus
pp. 539
Structured operational semantics for process algebras and equational axiom systems
Similar content
3,943
El IMPI no se decide a proteger los productos tradicionales en México
Authors:
Esteban BARRAGÁN
Criteria of quality requirements deciding on choice of the logistic operator from a perspective of his customer and the end recipient of goods
Authors:
Jacek Karcz
,
Beata Ślusarczyk
"How do people decide?": A Model for Software Library Selection
Authors:
Minaoar Hossain Tanzil
,
Gias Uddin
,
Ann Barcomb
See all similar
Cited by
17
Checking regular properties of Petri nets
Authors:
Petr Jancar
,
Faron Moller
Infinite results
Authors:
Faron Moller
Deciding properties of integral relational automata
Authors:
Karlis Cerans
See all cited by