L'odyssée des graphes de diagrammes de séquences ( MSC-Graphes)

[1]  Markus Lohrey.  Safe Realizability of High-Level Message Sequence Charts , 2002, CONCUR.

[2]  Anca Muscholl,et al.  Specifying and Verifying Partial Order Properties Using Template MSCs , 2004, FoSSaCS.

[3]  Alain J. Mayer,et al.  The Complexity of Word Problems - This Time with Interleaving , 1994, Inf. Comput..

[4]  David Harel,et al.  Synthesizing State-Based Object Systems from LSC Specifications , 2000, Int. J. Found. Comput. Sci..

[5]  David Harel,et al.  On the Complexity of Verifying Concurrent Transition Systems , 1997, Inf. Comput..

[6]  S Leue,et al.  Deciding properties of message sequence charts , 2005 .

[7]  Doron A. Peled,et al.  Specification and Verification of Message Sequence Charts , 2000, FORTE.

[8]  Michel A. Reniers,et al.  High-level message sequence charts , 1997, SDL Forum.

[9]  Anca Muscholl,et al.  Bounded MSC communication , 2002, Inf. Comput..

[10]  P. Madhusudan,et al.  Beyond Message Sequence Graphs , 2001, FSTTCS.

[11]  Thomas J. Schaefer,et al.  The complexity of satisfiability problems , 1978, STOC.

[12]  Madhavan Mukund,et al.  On Message Sequence Graphs and Finitely Generated Regular MSC Languages , 2000, ICALP.

[13]  Zohar Manna,et al.  The Temporal Logic of Reactive and Concurrent Systems , 1991, Springer New York.

[14]  A. Mazurkiewicz.  Concurrent Program Schemes and their Interpretations , 1977 .

[15]  Amir Pnueli,et al.  The temporal logic of programs , 1977, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977).

[16]  Dietrich Kuske,et al.  Regular sets of infinite message sequence charts , 2003, Inf. Comput..

[17]  Anca Muscholl,et al.  Compositional message sequence charts , 2001, International Journal on Software Tools for Technology Transfer.

[18]  Doron A. Peled,et al.  Ten Years of Partial Order Reduction , 1998, CAV.

[19]  S. Purushothaman Iyer,et al.  Analysis of a class of communicating finite state machines , 1992, Acta Informatica.

[20]  Anca Muscholl,et al.  A Kleene Theorem for a Class of Communicating Automata with Effective Algorithms , 2004, Developments in Language Theory.

[21]  Anca Muscholl,et al.  From Finite State Communication Protocols to High-Level Message Sequence Charts , 2001, ICALP.

[22]  Anca Muscholl,et al.  Message Sequence Graphs and Decision Problems on Mazurkiewicz Traces , 1999, MFCS.

[23]  Igor Walukiewicz,et al.  An Expressively Complete Linear Time Temporal Logic for Mazurkiewicz Traces , 1997, Inf. Comput..

[24]  Wieslaw Zielonka,et al.  Notes on Finite Asynchronous Automata , 1987, RAIRO Theor. Informatics Appl..

[25]  Doron A. Peled,et al.  All from One, One for All: on Model Checking Using Representatives , 1993, CAV.

[26]  Peter B. Ladkin,et al.  Correspondence Comments on a Proposed Semantics for Basic Message Sequence Charts , 1994 .

[27]  Madhavan Mukund,et al.  Netcharts: Bridging the gap between HMSCs and executable specifications , 2003, CONCUR.

[28]  Kenneth Zeger,et al.  Efficient Solution to Some Problems in Free Partially Commutative Monoids , 1990, Inf. Comput..

[29]  P. Madhusudan,et al.  Reasoning about Sequential and Branching Behaviours of Message Sequence Graphs , 2001, ICALP.

[30]  Ernst W. Mayr.  An Algorithm for the General Petri Net Reachability Problem , 1984, SIAM J. Comput..

[31]  Igor Walukiewicz,et al.  Difficult Configurations—On the Complexity of LTrL , 1998, Formal Methods Syst. Des..

[32]  Sjouke Mauw,et al.  The Formalization of Message Sequence Charts , 1996, Comput. Networks ISDN Syst..

[33]  David E. Muller,et al.  Infinite sequences and finite machines , 1963, SWCT.

[34]  Nancy A. Lynch,et al.  Distributed Computing: Models and Methods , 1990, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics.

[35]  Loïc Hélouët,et al.  Covert channels detection in protocols using scenarios , 2003 .

[36]  Loïc Hélouët,et al.  Decomposition of Message Sequence Charts , 2000, SAM.

[37]  Wojciech Plandowski,et al.  Testing Equivalence of Morphisms on Context-Free Languages , 1994, ESA.

[38]  Anca Muscholl,et al.  Infinite-State High-Level MSCs: Model-Checking and Realizability , 2002, ICALP.

[39]  Emil L. Post.  A variant of a recursively unsolvable problem , 1946 .

[40]  Wei Wei,et al.  A Scalable Incomplete Test for the Boundedness of UML RT Models , 2004, TACAS.

[41]  S C Kleene,et al.  Representation of Events in Nerve Nets and Finite Automata , 1951 .

[42]  Rance Cleaveland,et al.  Triggered Message Sequence Charts , 2006, IEEE Trans. Software Eng..

[43]  Wojciech Rytter.  Algorithms on Compressed Strings and Arrays , 1999, SOFSEM.

[44]  Madhavan Mukund,et al.  Regular Collections of Message Sequence Charts , 2000, MFCS.

[45]  Edward Ochmanski,et al.  Regular behaviour of concurrent systems , 1985, Bull. EATCS.

[46]  Philippe Schnoebelen,et al.  Verifying lossy channel systems has nonprimitive recursive complexity , 2002, Inf. Process. Lett..

[47]  Madhavan Mukund,et al.  A theory of regular MSC languages , 2005, Inf. Comput..

[48]  Anca Muscholl,et al.  Pattern Matching and Membership for Hierarchical Message Sequence Charts , 2002, LATIN.