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
20
views
9
references
Top references
cited by
7
Cite as...
0 reviews
Review
0
comments
Comment
0
recommends
+1
Recommend
0
collections
Add to
0
shares
Share
Twitter
Sina Weibo
Facebook
Email
1,668
similar
All similar
Record
: found
Abstract
: not found
Book Chapter
: not found
Automata, Languages and Programming
Realizability and Verification of MSC Graphs
other
Author(s):
Rajeev Alur
,
Kousha Etessami
,
Mihalis Yannakakis
Publication date
(Online):
July 4 2001
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
ScienceOpen Research
Most cited references
9
Record
: found
Abstract
: not found
Conference Proceedings
: not found
The complexity of satisfiability problems
Thomas Schaefer
(1978)
0
comments
Cited
235
times
– based on
0
reviews
Bookmark
Record
: found
Abstract
: not found
Book Chapter
: not found
Model Checking of Message Sequence Charts
Rajeev Alur
,
Mihalis Yannakakis
(1999)
0
comments
Cited
17
times
– based on
0
reviews
Bookmark
Record
: found
Abstract
: not found
Book Chapter
: not found
Syntactic detection of process divergence and non-local choice in message sequence charts
Hanene Ben-Abdallah
,
Stefan Leue
(1997)
0
comments
Cited
12
times
– based on
0
reviews
Bookmark
All references
Author and book information
Book Chapter
Publication date (Print):
2001
Publication date (Online):
July 4 2001
Pages
: 797-808
DOI:
10.1007/3-540-48224-5_65
SO-VID:
4f12f54c-9f44-4ff7-b91a-bbed394dd06f
History
Data availability:
Comments
Comment on this book
Sign in to comment
Book chapters
pp. 24
Languages, Rewriting Systems, and Verification of Infinite-State Systems
pp. 201
Approximation Hardness of TSP with Bounded Metrics
pp. 64
Theoretical Aspects of Evolutionary Algorithms
pp. 249
Quick k-Median, k-Center, and Facility Location for Sparse Graphs
pp. 261
Parameterized Complexity: Exponential Speed-Up for Planar Graph Problems
pp. 273
Subexponential Parameterized Algorithms Collapse the W-Hierarchy
pp. 370
Axiomatizations for Probabilistic Bisimulation
pp. 382
Noninterference for Concurrent Programs
pp. 396
Distributed Controller Synthesis for Local Specifications
pp. 421
Towards Quantitative Verification of Probabilistic Transition Systems
pp. 469
A New Method for Balancing Binary Search Trees
pp. 652
Model Checking of Unrestricted Hierarchical State Machines
pp. 667
Symbolic Trace Analysis of Cryptographic Protocols
pp. 694
Fair Simulation Relations, Parity Games, and State Space Reduction for Büchi Automata
pp. 708
Hypergraphs in Model Checking: Acyclicity and Hypertree-Width versus Clique-Width
pp. 757
Routing in Trees
pp. 797
Realizability and Verification of MSC Graphs
pp. 848
A PTAS for Minimizing Weighted Completion Time on Uniformly Related Machines
pp. 862
The Buffer Minimization Problem for Multiprocessor Scheduling with Conflicts
pp. 912
Information-Theoretic Private Information Retrieval: A Unified Construction
pp. 927
Secure Multiparty Computation of Approximations
pp. 1017
Time and Space Bounds for Reversible Simulation
Similar content
1,668
MSC-Derived Extracellular Vesicles to Heal Diabetic Wounds: a Systematic Review and Meta-Analysis of Preclinical Animal Studies
Authors:
Adrian J. M. Bailey
,
Heidi Lai-ling Li
,
Aidan M. Kirkham
…
Ethnobotanical study on medicine food homology plants of Taibai Mountain region. MSc thesis
Authors:
SJ Zhang
Documentation of ethno-veterinary practices in Baluchistan [MSc dissertation]
Authors:
K Ihsanullah
See all similar
Cited by
7
Specification of realizable service conversations using collaboration diagrams
Authors:
Tevfik Bultan
,
Xiang Fu
Infinite-State High-Level MSCs: Model-Checking and Realizability
Authors:
Blaise Genest
,
Anca Muscholl
,
Helmut Seidl
…
On Implementation of Global Concurrent Systems with Local Asynchronous Controllers
Authors:
Blaise Genest
See all cited by