Automata and logics for message sequence charts

A message-passing automaton is an abstract model for the implementation of a distributed system whose components communicate via message exchange and thereby define a collection of communication scenarios called message sequence charts. In this thesis, we study several variants of message-passing automata in a unifying framework. We classify their expressiveness in terms of state-space properties, synchronization behavior, and acceptance mode and also compare them to algebraic characterizations of sets of message sequence charts, among them the classes of recognizable and rational languages. We then focus on finite-state devices with global acceptance condition that communicate via a priori unbounded channels. We show them to be exactly as expressive as the existential fragment of monadic second-order logic over message sequence charts and to be strictly weaker than full monadic second-order logic. It turns out that message-passing automata cannot be complemented and that they cannot be determinized in general. Those results rely on a new proof technique, which allows to apply graph acceptors as introduced by Thomas to the framework of message sequence charts.

[1]  Wolfgang Thomas,et al.  Languages, Automata, and Logic , 1997, Handbook of Formal Languages.

[2]  Ramaswamy Ramanujam,et al.  Reasoning about layered message passing systems , 2004, Comput. Lang. Syst. Struct..

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

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

[5]  Dietrich Kuske,et al.  A Further Step towards a Theory of Regular MSC Languages , 2002, STACS.

[6]  Stefan Richter,et al.  Parameterized power domination complexity , 2006, Inf. Process. Lett..

[7]  Rajeev Alur,et al.  Realizability and verification of MSC graphs , 2005, Theor. Comput. Sci..

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

[9]  Matthias Jarke,et al.  Exploring the Semantic Structure of Technical Document Collections: A Cooperative Systems Approach , 2000, CoopIS.

[10]  Wojciech Zielonka,et al.  The Book of Traces , 1995 .

[11]  Andreas Podelski,et al.  LISA: A Specification Language Based on WS2S , 1997, CSL.

[12]  Jürgen Giesl,et al.  Termination of term rewriting using dependency pairs , 2000, Theor. Comput. Sci..

[13]  Johan Anthory Willem Kamp,et al.  Tense logic and the theory of linear order , 1968 .

[14]  Rémi Morin,et al.  The Pros and Cons of Netcharts , 2004, CONCUR.

[15]  Wolfgang Thomas,et al.  Elements of an automata theory over partial orders , 1997, Partial Order Methods in Verification.

[16]  Markus Lohrey,et al.  Realizability of high-level message sequence charts: closing the gaps , 2003, Theor. Comput. Sci..

[17]  Rajeev Alur,et al.  Model Checking of Message Sequence Charts , 1999, CONCUR.

[18]  Jürgen Giesl,et al.  Transformation techniques for context-sensitive rewrite systems , 2004, J. Funct. Program..

[19]  Christof Löding,et al.  Solving the Sabotage Game Is PSPACE-Hard , 2003, MFCS.

[20]  Dexter Kozen,et al.  RESULTS ON THE PROPOSITIONAL’p-CALCULUS , 2001 .

[21]  Felix C. Freiling,et al.  Byzantine Fault Tolerance on General Hybrid Adversary Structures , 2005 .

[22]  Felix C. Freiling,et al.  Secure Multi-Party Computation with Security Modules , 2005, Sicherheit.

[23]  Pär J. Ågerfalk,et al.  The Language Action Perspective on Communication Modelling , 1999 .

[24]  Ramaswamy Ramanujam,et al.  Reasoning about Message Passing in Finite State Environments , 2000, ICALP.

[25]  Jürgen Giesl,et al.  Size-Change Termination for Term Rewriting , 2003, RTA.

[26]  Jürgen Giesl,et al.  Innermost Termination of Context-Sensitive Rewriting , 2002, Developments in Language Theory.

[27]  Benedikt Bollig,et al.  Local Parallel Model Checking for the Alternation-Free µ-Calculus , 2002, SPIN.

[28]  Martin Leucker,et al.  Logics for Mazurkiewicz traces , 2002 .

[29]  Henry N. Adorna.  3-Party Message Complexity is Better than 2-Party Ones for Proving Lower Bounds on the Size of Minimal Nondeterministic Finite Automata , 2001, DCFS.

[30]  Edward Ochmanski.  Recognizable Trace Languages , 1995, The Book of Traces.

[31]  Wolfgang Thomas,et al.  Automata Theory on Trees and Partial Orders , 1997, TAPSOFT.

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

[33]  Markus Mohnen,et al.  An open framework for data-flow analysis in Java: extended abstract , 2002, PPPJ/IRE.

[34]  Madhavan Mukund,et al.  Synthesizing Distributed Finite-State Systems from MSCs , 2000, CONCUR.

[35]  Wolfgang Thomas.  On Logics, Tilings, and Automata , 1991, ICALP.

[36]  Felix C. Freiling,et al.  An offensive approach to teaching information security : 'Aachen summer school applied IT security , 2005 .

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

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

[39]  Jörg Dahmen,et al.  Invariant image object recognition using Gaussian mixture densities , 2001 .

[40]  Paul Gastin,et al.  LTL Is Expressively Complete for Mazurkiewicz Traces , 2000, J. Comput. Syst. Sci..

[41]  Anca Muscholl,et al.  Deciding Properties of Message Sequence Charts , 2003, Scenarios: Models, Transformations and Tools.

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

[43]  Rémi Morin,et al.  Safe Implementability of Regular Message Sequence Chart Specifications , 2003, SNPD.

[44]  Stefan Richter,et al.  A Faster Algorithm for the Steiner Tree Problem , 2006, STACS.

[45]  Markus Mohnen.  Interfaces with default implementations in Java , 2002, PPPJ/IRE.

[46]  Berthold Vöcking,et al.  Adaptive routing with stale information , 2005, PODC '05.

[47]  Peter B. Ladkin,et al.  Interpreting Message Flow Graphs , 1995, Formal Aspects of Computing.

[48]  Felix C. Freiling,et al.  Botnet Tracking: Exploring a Root-Cause Methodology to Prevent Distributed Denial-of-Service Attacks , 2005, ESORICS.

[49]  Hanêne Ben-Abdallah,et al.  Syntactic Detection of Process Divergence and Non-local Choice inMessage Sequence Charts , 1997, TACAS.

[50]  C. C. Elgot.  Decision problems of finite automata design and related arithmetics , 1961 .

[51]  Nicole Schweikardt,et al.  The Monadic Quantifier Alternation Hierarchy over Grids and Graphs , 2002, Inf. Comput..

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

[53]  Daniel Brand,et al.  On Communicating Finite-State Machines , 1983, JACM.

[54]  Edmund M. Clarke,et al.  Model Checking , 1999, Handbook of Automated Reasoning.

[55]  Ludwig Staiger,et al.  Ω-languages , 1997 .

[56]  Benedikt Bollig,et al.  Extending Compositional Message Sequence Graphs , 2002, LPAR.

[57]  Thomas Noll,et al.  Algebraic Correctness Proofs for Compiling Recursive Function Definitions with Strictness Information , 2006, Acta Informatica.

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

[59]  Jaikumar Radhakrishnan,et al.  Towards a Characterisation of Finite-State Message-Passing Systems , 1998, ASIAN.

[60]  Anca Muscholl,et al.  Infinite-state high-level MSCs: Model-checking and realizability , 2002, J. Comput. Syst. Sci..

[61]  Joost-Pieter Katoen,et al.  Pomsets for message sequence charts , 1998 .

[62]  Rémi Morin,et al.  On Regular Message Sequence Chart Languages and Relationships to Mazurkiewicz Trace Theory , 2001, FoSSaCS.

[63]  Fred Kröger,et al.  Temporal Logic of Programs , 1987, EATCS Monographs on Theoretical Computer Science.

[64]  Bruno Courcelle,et al.  The Monadic Second-Order Logic of Graphs. I. Recognizable Sets of Finite Graphs , 1990, Inf. Comput..

[65]  Jürgen Giesl,et al.  Proving and Disproving Termination of Higher-Order Functions , 2005, FroCoS.

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

[67]  Benedikt Bollig,et al.  Generalised Regular MSC Languages , 2002, FoSSaCS.

[68]  Paul Gastin,et al.  Asynchronous cellular automata for pomsets , 2000, Theor. Comput. Sci..

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

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

[71]  B. Bollig,et al.  Modelling, specifying, and verifying message passing systems , 2001, Proceedings Eighth International Symposium on Temporal Representation and Reasoning. TIME 2001.

[72]  P. S. Thiagarajan,et al.  A Trace Consistent Subset of PTL , 1995, CONCUR.

[73]  Franz Josef Och,et al.  Statistical machine translation: from single word models to alignment templates , 2002 .

[74]  J. Klop,et al.  WST ’ 04 7 th International Workshop on Termination , 2004 .

[75]  Marcin Jurdzinski,et al.  A Discrete Strategy Improvement Algorithm for Solving Parity Games , 2000, CAV.

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

[77]  Supratik Mukhopadhyay,et al.  Dynamic Message Sequence Charts , 2002, FSTTCS.

[78]  Thomas Arts,et al.  Verifying Generic Erlang Client-Server Implementations , 2000, IFL.

[79]  Thomas Wilke,et al.  Automata Logics, and Infinite Games , 2002, Lecture Notes in Computer Science.

[80]  Jürgen Giesl,et al.  Deciding Inductive Validity of Equations , 2003, CADE.

[81]  Rémi Morin,et al.  Recognizable Sets of Message Sequence Charts , 2002, STACS.

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

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

[84]  Martin Grohe,et al.  An existential locality theorem , 2004, Ann. Pure Appl. Log..

[85]  Blaise Genest,et al.  L'odyssée des graphes de diagrammes de séquences ( MSC-Graphes) , 2004 .

[86]  Nachum Dershowitz,et al.  In handbook of automated reasoning , 2001 .

[87]  Thierry Cachat.  The Power of One-Letter Rational Languages , 2001, Developments in Language Theory.

[88]  Perdita Stevens,et al.  Using UML - software engineering with objects and components, Second Edition , 2006, Addison Wesley object technology series.

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

[90]  P. Rossmanith,et al.  A New Satisabilit y Algorithm With Applications To Max-Cut , 2005 .

[91]  Thorsten Holz,et al.  A Pointillist Approach for Comparing Honeypots , 2005, DIMVA.

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

[93]  Yoshihito Toyama,et al.  4th International Workshop on Reduction Strategies in Rewriting and Programming , 2004 .

[94]  Wolfgang Thomas,et al.  The monadic quantifier alternation hierarchy over graphs is infinite , 1997, Proceedings of Twelfth Annual IEEE Symposium on Logic in Computer Science.

[95]  David Harel,et al.  LSCs: Breathing Life into Message Sequence Charts , 1999, Formal Methods Syst. Des..

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

[97]  Rajeev Alur,et al.  Inference of message sequence charts , 2000, Proceedings of the 2000 International Conference on Software Engineering. ICSE 2000 the New Millennium.

[98]  Tommaso Bolognesi,et al.  Tableau methods to describe strong bisimilarity on LOTOS processes involving pure interleaving and enabling , 1994, FORTE.

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

[100]  Robin Milner,et al.  Communication and concurrency , 1989, PHI Series in computer science.

[101]  Chris Verhoef,et al.  Concrete process algebra , 1995, LICS 1995.

[102]  Madhavan Mukund,et al.  Towards a Theory of Regular MSC Languages , 1999 .

[103]  Benedikt Bollig,et al.  Message-passing automata are expressively equivalent to EMSO logic , 2006, Theor. Comput. Sci..

[104]  Antonio Restivo,et al.  Monadic Second-Order Logic Over Rectangular Pictures and Recognizability by Tiling Systems , 1996, Inf. Comput..

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