article

A Kleene theorem and model checking algorithms for existentially bounded communicating automata

Authors:

Dietrich Kuske,

Anca MuschollAuthors Info & Claims

Information and Computation, Volume 204, Issue 6

Pages 920 - 956

Published: 01 June 2006 Publication History

Abstract

The behavior of a network of communicating automata is called existentially bounded if communication events can be scheduled in such a way that the number of messages in transit is always bounded by a value that depends only on the machine, not the run itself. We show a Kleene theorem for existentially bounded communicating automata, namely the equivalence between communicating automata, globally cooperative compositional message sequence graphs, and monadic second order logic. Our characterization extends results for universally bounded models, where for each and every possible scheduling of communication events, the number of messages in transit is uniformly bounded. As a consequence, we give solutions in spirit of Madhusudan (2001) for various model checking problems on networks of communicating automata that satisfy our optimistic restriction.

References

[1]

Abdulla, P. and Jonsson, B., Verifying programs with unreliable channels. Inf. Comput. v12 i2. 91-101.

[2]

R. Alur, M. Yannakakis. Model checking of message sequence charts, in: CONCUR'99, Lecture Notes in Computer Science, vol. 1664, 1999, pp. 114--129.

[3]

Berstel, J., Transductions and context-free languages. 1979. Teubner Studienbücher, Stuttgart.

[4]

Bouajjani, A. and Habermehl, P., Symbolic reachability analysis of FIFO-channel systems with nonregular sets of configurations. Theor. Comput. Sci. v22 i1--2. 211-250.

[5]

B. Boigelot, P. Godefroid, B. Willems, P. Wolper, The Power of QDDs, in: SAS'97, Lecture Notes in Computer Science, vol. 1302, 1997, pp. 172--186.

[6]

Boigelot, B. and Godefroid, P., Symbolic verification of communication protocols with infinite state spaces using QDDs. Formal Methods Syst. Des. v1 i3. 237-255.

[7]

B. Bollig, M. Leucker, Message-passing automata are expressively equivalent to EMSO Logic, Theor. Comput. Sci. 2006 (in press). (An extended abstract appeared under the same title in CONCUR'04, Lecture Notes in Computer Science, vol. 3170, 2004, pp. 146--160).

[8]

Brand, D. and Zafiropulo, P., On communicating finite-state machines. J. ACM. v3 i2. 323-342.

[9]

In: Diekert, V., Rozenberg, G. (Eds.), The Book of Traces, World Scientific, Singapore.

[10]

Ebinger, W. and Muscholl, A., Logical definability on infinite traces. Theor. Comput. Sci. v154. 67-84.

Digital Library

[11]

Finkel, A. and Schnoebelen, Ph., Well-structured transition systems everywhere!. Theor. Comput. Sci. v256 i1,2. 63-92.

[12]

Gunter, E., Muscholl, A. and Peled, D., Compositional message sequence charts. International Journal on Software Tools for Technology Transfer (STTT). i1. 78-89.

[13]

B. Genest, A. Muscholl, H. Seidl, M. Zeitoun, Infinite-state High-level MSCs: model checking and realizability, in: ICALP'02, Lecture Notes in Computer Science, vol. 2380, 2002, pp. 657--668. Journal version in Journal of Computer and System Sciences (2006), in press.

[14]

Henriksen, J.G., Mukund, M., Narayan Kumar, K., Sohoni, M. and Thiagarajan, P., A theory of regular MSC languages. Inf. Comput. v20 i1. 1-38.

[15]

ITU-TS recommendation Z.120, Message Sequence Charts, Geneva, 1999.

[16]

Kuske, D., Regular sets of infinite message sequence charts. Inf. Comput. v187. 80-109.

Digital Library

[17]

Lohrey, M. and Muscholl, A., Bounded MSC communication. Inf. Comput. v189. 135-263.

[18]

S. Leue, R. Mayr, W. Wei, A scalable incomplete test for the boundedness of UML RT models, in: TACAS'04, Lecture Notes in Computer Science, vol. 2988, 2004, pp. 327--341.

[19]

Meyer, A.R., Weak monadic second order theory of one successor is not elementary recursive. In: Lecture Notes in Mathematics, vol. 453. Springer. pp. 132-154.

[20]

R. Morin, Recognizable sets of message sequence charts, in: STACS'02, Lecture Notes in Computer Science, vol. 2285, 2002, pp. 523--534.

[21]

P. Madhusudan, Reasoning about sequential and branching behaviours of message sequence graphs, in: ICALP'01, Lecture Notes in Computer Science, vol. 2076, 2001, pp. 809--820.

[22]

P. Madhusudan, B. Meenakshi, Beyond message sequence graphs, in: FSTTCS'01, Lecture Notes in Computer Science, vol. 2245, 2001, pp. 256--267.

[23]

A. Mazurkiewicz, Concurrent program schemes and their interpretation, Technical report, DAIMI Report PB-78, Aarhus University, 1977.

[24]

A. Muscholl, D. Peled, Message sequence graphs and decision problems on Mazurkiewicz traces, in: MFCS'99, Lecture Notes in Computer Science, vol. 1672, 1999, pp. 81--91.

[25]

E. Ochmański, Regular behaviour of concurrent systems, in: Bulletin of the EATCS 27, 1985, pp. 56--67.

[26]

Schnoebelen, Ph., Verifying lossy channel systems has nonprimitive recursive complexity. Inf. Process. Lett. v8 i5. 251-261.

[27]

USB 1.1 specification. <http://www.usb.org/developers/docs/usbspec.zip/>.

[28]

W. Thomas, On logical definability of trace languages, in: V. Diekert (Ed.), Proceedings of a workshop of the ESPRIT BRA No. 3166: Algebraic and Syntactic Methods in Computer Science (ASMICS) 1989, Report TUM-I9002, Technical University of Munich, 1990, pp. 172--182.

[29]

Zielonka, W., Notes on finite asynchronous automata. R.A.I.R.O.---Inf. Théor. Appl. v21. 99-135.

Cited By

Amrane ABazille HFahrenberg UFortin M(2024)Logic and Languages of Higher-Dimensional AutomataDevelopments in Language Theory10.1007/978-3-031-66159-4_5(51-67)Online publication date: 12-Aug-2024
https://dl.acm.org/doi/10.1007/978-3-031-66159-4_5
Bollig BGrindei MHabermehl P(2018)Realizability of concurrent recursive programsFormal Methods in System Design10.1007/s10703-017-0282-y53:3(339-362)Online publication date: 1-Dec-2018
https://dl.acm.org/doi/10.1007/s10703-017-0282-y
Muscholl A(2015)Automated Synthesis of Distributed ControllersProceedings, Part II, of the 42nd International Colloquium on Automata, Languages, and Programming - Volume 913510.1007/978-3-662-47666-6_2(11-27)Online publication date: 6-Jul-2015
https://dl.acm.org/doi/10.1007/978-3-662-47666-6_2
Show More Cited By

Index Terms

A Kleene theorem and model checking algorithms for existentially bounded communicating automata
1. Mathematics of computing
  1. Mathematical analysis
    1. Numerical analysis
      1. Computations in finite fields
2. Theory of computation

Recommendations

A Kleene theorem for timed automata
LICS '97: Proceedings of the 12th Annual IEEE Symposium on Logic in Computer Science

In this paper we define timed regular expressions, and extension of regular expressions for specifying sets of dense-time discrete-valued signals. We show that this formalism is equivalent in expressive power to the timed automata of Alur and Dill by ...
A Kleene-Schützenberger theorem for weighted timed automata

During the last years, weighted timed automata have received much interest in the real-time community. Weighted timed automata form an extension of timed automata and allow us to assign weights (costs) to both locations and edges. This model, introduced ...
Interrupt Timed Automata: verification and expressiveness

We introduce the class of Interrupt Timed Automata (ITA), a subclass of hybrid automata well suited to the description of timed multi-task systems with interruptions in a single processor environment.

While the reachability problem is undecidable for ...

Comments

Information & Contributors

Information

Published In

cover image Information and Computation

Information and Computation Volume 204, Issue 6

June 2006

161 pages

ISSN:0890-5401

Issue’s Table of Contents

Copyright © Elsevier B.V. © 2006.

Publisher

Academic Press, Inc.

United States

Publication History

Published: 01 June 2006

Author Tags

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

23
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 14 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

Amrane ABazille HFahrenberg UFortin M(2024)Logic and Languages of Higher-Dimensional AutomataDevelopments in Language Theory10.1007/978-3-031-66159-4_5(51-67)Online publication date: 12-Aug-2024
https://dl.acm.org/doi/10.1007/978-3-031-66159-4_5
Bollig BGrindei MHabermehl P(2018)Realizability of concurrent recursive programsFormal Methods in System Design10.1007/s10703-017-0282-y53:3(339-362)Online publication date: 1-Dec-2018
https://dl.acm.org/doi/10.1007/s10703-017-0282-y
Muscholl A(2015)Automated Synthesis of Distributed ControllersProceedings, Part II, of the 42nd International Colloquium on Automata, Languages, and Programming - Volume 913510.1007/978-3-662-47666-6_2(11-27)Online publication date: 6-Jul-2015
https://dl.acm.org/doi/10.1007/978-3-662-47666-6_2
Bollig BHenzinger TMiller D(2014)Logic for communicating automata with parameterized topologyProceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)10.1145/2603088.2603093(1-10)Online publication date: 14-Jul-2014
https://dl.acm.org/doi/10.1145/2603088.2603093
Krishna SMuscholl A(2013)A quadratic construction for Zielonka automata with acyclic communication structureTheoretical Computer Science10.5555/2846457.2846506503:C(109-114)Online publication date: 9-Sep-2013
https://dl.acm.org/doi/10.5555/2846457.2846506
Akshay SBollig BGastin P(2013)Event clock message passing automataFormal Methods in System Design10.1007/s10703-012-0179-842:3(262-300)Online publication date: 1-Jun-2013
https://dl.acm.org/doi/10.1007/s10703-012-0179-8
Yaqub EYahyapour RWieder PLu K(2012)A protocol development framework for SLA negotiations in cloud and service computingProceedings of the 9th international conference on Economics of Grids, Clouds, Systems, and Services10.1007/978-3-642-35194-5_1(1-15)Online publication date: 27-Nov-2012
https://dl.acm.org/doi/10.1007/978-3-642-35194-5_1
Mennicke R(2012)Propositional dynamic logic with converse and repeat for message-passing systemsProceedings of the 23rd international conference on Concurrency Theory10.1007/978-3-642-32940-1_37(531-546)Online publication date: 4-Sep-2012
https://dl.acm.org/doi/10.1007/978-3-642-32940-1_37
Muscholl A(2010)Taming distributed asynchronous systemsProceedings of the 21st international conference on Concurrency theory10.5555/1887654.1887658(40-47)Online publication date: 31-Aug-2010
https://dl.acm.org/doi/10.5555/1887654.1887658
Genest BGimbert HMuscholl AWalukiewicz I(2010)Optimal Zielonka-type construction of deterministic asynchronous automataProceedings of the 37th international colloquium conference on Automata, languages and programming: Part II10.5555/1880999.1881006(52-63)Online publication date: 6-Jul-2010
https://dl.acm.org/doi/10.5555/1880999.1881006
Show More Cited By

View Options

View options

Media

Figures

Other

Tables

View Issue’s Table of Contents