Markus Lohrey  Home/Search
Context Related
| inf.informatik.unistutt...02CONCUR.ps 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: informatik.unistut...veroeff.sh? (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We study the notion of safe realizability for high-level message sequence charts (HMSCs), which was introduced in [2]. We prove that safe realizability is EXPSPACE-complete for bounded HMSCs but undecidable for the class of all HMSCs. This solves two open problems from [2]. Moreover we prove that safe realizability is also EXPSPACEcomplete for the larger class of transition-connected HMSCs. (Update)
Context of citations to this paper: More
...ways, each of which would eliminate the possibility of deadlock. Safe realizability is not entirely captured by closure condition CC3 [18]. This is illustrated by the example scenarios in Figure 7. If we just consider the two MSCs MSC1 and MSC2, the set satisfies CC3. This...
Cited by: More
Inference of Message Sequence Charts - Alur, Etessami, Yannakakis (2003) (Correct)
Active bibliography (related documents): More All
1.6: Infinite-State High-Level MSCs: Model-Checking and.. - Genest, Muscholl.. (2002) (Correct)
0.4: Pattern Matching and Membership for Hierarchical Message.. - Genest, Muscholl (2002) (Correct)
0.4: From Finite State Communication Protocols to High-Level.. - Muscholl, Peled (2001) (Correct)
Similar documents based on text: More All
1.2: High-level Message Sequence Charts - Mauw, Reniers (1997) (Correct)
1.2: Realizability and Verification of MSC-Graphs - Alur, Etessami, Yannakakis (2002) (Correct)
1.1: Realizability and Verification of MSC Graphs - Alur, Etessami, Yannakakis (2001) (Correct)
Related documents from co-citation: More All
2: the Complexity of Testing Implications of Functional and Join Dependencies (context) - Maier, Sagiv et al. - 1981
2: Automated support for OO software (context) - Koskimies, Mannisto et al. - 1998
2: LSCs: Breathing Life into Message Sequence Charts - Damm, Harel - 1998
BibTeX entry: (Update)
M. Lohrey. Safe realizability of high-level message sequence charts. In Proc. of Concur'2002. http://citeseer.ist.psu.edu/lohrey02safe.html More
@inproceedings{ lohrey-safe,
author = "Markus Lohrey",
title = "Safe realizability of high-level message sequence charts",
booktitle="CONCUR 2002, Concurrency Theory, 13th International Conference",
pages="177--192",
year=2002,
url = "citeseer.ist.psu.edu/lohrey02safe.html" }
Citations (may not include all citations):951 Computational Complexity (context) - Papadimitriou - 1994 ACM
166 Message Sequence Charts (context) - Recommendation - 1996 ACM
48 Model checking of message sequence charts - Alur, Yannakakis - 1999 ACM DBLP
38 World Scienti c (context) - Diekert, Rozenberg et al. - 1995
30 Inference of message sequence charts - Alur, Etessami et al. - 2000 ACM DBLP
19 Message sequence graphs and decision problems on Mazurkiewic.. - Muscholl, Peled - 1999
18 Regular collections of message sequence charts - Henriksen, Mukund et al. - 2000
13 Syntactic detection of process divergence and nonlocal choic.. (context) - Ben-Abdallah, Leue - 1997
13 Compositional message sequence charts - Gunter, Muscholl et al. - 2001 ACM DBLP
11 Notes on nite asynchronous automata (context) - Zielonka - 1985
9 On communicating nite-state machines (context) - Brand, ropulo - 1983
9 Speci cation and Description Language (context) - Recommendation - 1994
9 Recognizable sets of message sequence charts (context) - Morin - 2002 ACM DBLP
8 Dicult con gurations { on the complexity of LTrL (context) - Walukiewicz - 1998
4 Decomposition of message sequence charts (context) - elou, Le Maigat - 2000
4 Finite state description of communication protocols (context) - von Bochmann - 1978 ACM DBLP
4 Realizability and veri cation of MSC graphs (context) - Alur, Etessami et al. - 2001
3 Conditions for synthesis of communicating automata from HMSC.. (context) - elou, Jard - 2000
2 HMSCs as partial speci cations (context) - Caillaud, Darondeau et al. - 2000
Documents on the same site (http://www.informatik.uni-stuttgart.de/tibin/veroeff.sh?): More
Matching Specifications for Message Sequence Charts - Muscholl (1999) (Correct)
Trace Rewriting: Computing normal forms in time O(n log n) - Bertol, Diekert (1996) (Correct)
Deterministic Asynchronous Automata for Infinite Traces - Diekert, Muscholl (1993) (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