P. Madhusudan  Home/Search
Context Related
Links: ACM DBLP | imsc.ernet.in/~madhu/icalp01b.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: imsc.ernet.in/~madhu/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We study the model-checking problem of message-sequence graphs (MSGs). In the sequential setting, we consider the set of message-sequence charts (MSCs) represented by an MSG and tackle specifications given in monadic second-order logic. We show that this problem, without any restrictions on the MSGs, is decidable. We then turn to branching behaviours of MSGs, define a notion of an unfolding of an MSG, and show that the model-checking problem on unfoldings is also decidable. Our results are... (Update)
Cited by: More
Dynamic Message Sequence Charts - Martin Leucker Madhusudan (2002) (Correct)
Message-Passing Automata Are Expressively Equivalent to EMSO.. - Bollig, Leucker (2004) (Correct)
A Theory of Regular MSC Languages - Henriksen, Mukund, Kumar, Sohoni.. (2003) (Correct)
Active bibliography (related documents): More All
0.8: Beyond Message Sequence Graphs - Madhusudan, Meenakshi (2001) (Correct)
0.5: Hyperalgebraic Trees, First-Order Substitution and Monadic.. - Courcelle, Knapik (Correct)
0.5: Information Societies Technology - Ist Programme Future (Correct)
Similar documents based on text: More All
0.6: On Message Sequence Graphs and Finitely Generated.. - Henriksen.. (2000) (Correct)
0.5: Regular Collections of Message Sequence Charts - Henriksen, Mukund, Kumar.. (2000) (Correct)
0.4: A Comparative Study Of Structural Most Specific Generalizations.. - Kietz (1997) (Correct)
Related documents from co-citation: More All
10: Model checking of message sequence charts - Alur, Yannakakis - 1999
6: Beyond message sequence graphs - Madhusudan, Meenakshi - 2001
6: Regular collections of message sequence charts - Henriksen, Mukund et al. - 2000
BibTeX entry: (Update)
P. Madhusudan. Reasoning about sequential and branching behaviours of message sequence graphs. In Proc. ICALP '01, vol. http://citeseer.ist.psu.edu/466015.html More
@article{ madhusudan01reasoning,
author = "P. Madhusudan",
title = "Reasoning about Sequential and Branching Behaviours of Message Sequence Graphs",
journal = "Lecture Notes in Computer Science",
volume = "2076",
pages = "809+",
year = "2001",
url = "citeseer.ist.psu.edu/466015.html" }
Citations (may not include all citations):176 a decision method in restricted second order arithmetic (context) - uchi
166 Message sequence chart (context) - Recommendation - 1997
81 Handbook of Theoretical Computer Science (context) - Thomas, innite - 1990 ACM
72 An analyzer for message sequence charts (context) - Alur, Holzmann et al. - 1996
48 Model checking of message sequence charts - Alur, Yannakakis - 1999 ACM DBLP
40 Weak second-order arithmetic and nite automata (context) - uchi - 1960
36 Tutorial on message sequence charts - Rudolph, Graubmann et al. - 1996 ACM DBLP
35 An expressively complete linear time temporal logic for Mazu.. - Thiagarajan, Walukiewicz - 1997 ACM DBLP
32 Deciding properties of message sequence charts - Muscholl, Peled et al. - 1998
30 Monadic second order logic on tree-like structures - Walukiewicz - 1996 ACM DBLP
18 Regular collections of Message Sequence Charts - Henriksen, Mukund et al. - 2000 ACM DBLP
10 Handbook of Formal Language Theory (context) - Thomas, automata - 1997
7 On message sequence graphs and nitely generated regular MSC .. (context) - Henriksen, Mukund et al. - 2000
6 Reasoning about message passing in nite state environments (context) - Meenakshi, Ramanujam - 2000
4 Towards a theory of regular MSC languages - Henriksen, Mukund et al. - 1999
3 Decision problems of nite automata and related arithmetics (context) - Elgot - 1961
2 Message sequence charts and decision problems on Mazurkiewic.. (context) - Muscholl, Peled - 1999
2 On innite transition graphs having a decidable monadic theor.. (context) - Caucal - 1996
1 Reasoning about Sequential and Branching properties of Messa.. (context) - Madhusudan
1 Verication of message sequence charts via template matching (context) - Levin, Peled - 1997
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.imsc.ernet.in/~madhu/): More
Controllers for Discrete Event Systems via Morphisms - Madhusudan, Thiagarajan (1998) (Correct)
On-the-fly Verification for Product-LTL - D'Souza, Madhusudan (1997) (Correct)
Beyond Message Sequence Graphs - Madhusudan, Meenakshi (2001) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC