Abstract
We present a model checking algorithm for L CSA , a temporal logic for communicating sequential agents (CSAs) introduced by Lodaya, Ramanujam, and Thiagarajan. L CSA contains temporal modalities indexed with a local point of view of one agent and allows to refer to properties of other agents according to the latest gossip which is related to local knowledge.
The model checking procedure relies on a modularisation of L CSA into temporal and gossip modalities. We introduce a hierarchy of formulae and a corresponding hierarchy of equivalences, which allows to compute for each formula and finite state distributed system a finite multi modal Kripke structure, on which the formula can be checked with standard techniques.
This work was partially supported by the DFG within SFB 342 (A3), and within the priority program “Design and design methodology of embedded systems”, and by the EEC program on Training and Mobility in Research (TMR). The work was done while the second author was affiliated with the Univ. of Hildesheim, Germany.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
A. Cheng, J. Esparza, and J. Palsberg, Complexity results for 1-safe nets, Theoretical Computer Science (1995), no. 147, 117–136.
E. M. Clarke, E. A. Emerson, and A. P. Sistla, Automatic verification of finite-state concurrent systems using temporal logic specifications, ACM Transactions on Programming Languages and Systems 8 (1986), no. 2, 244–263.
J. Engelfriet, Branching processes of Petri nets, Acta Informatica 28 (1991), 575–591.
J. Esparza, S. Römer, and W. Vogler, An Improvement of McMillan’s Unfolding Algorithm, Proc. of TACAS’ 96, LNCS, vol. 1055, Springer, 1996, 87–106.
J. Esparza, Model checking using net unfoldings, Science of Computer Programming 23 (1994), 151–195.
M. Huhn, P. Niebert, and F. Wallner, Model checking gossip modalities, Technical Report 21/98, Univ. Karlsruhe, Fakultät für Informatik, Aug. 1998.
M. Huhn, P. Niebert, and F. Wallner, Verification based on local states, Proc. of TACAS’ 98, LNCS, vol. 1384, Springer, 1998, 36–51.
K. Lodaya, R. Ramanujam, and P. S. Thiagarajan, Temporal logics for communicating sequential agents: I, Int. Journal of Foundations of Computer Science 3 (1992), no. 2, 117–159.
F. Laroussinie and P. Schnoebelen, A hierarchy of temporal logics with past, Theoretical Computer Science 148 (1995), 303–324.
K. Lodaya and P. S. Thiagarajan, A modal logic for a subclass of event structures, Automata, Languages and Programming, LNCS, vol. 267, Springer, 1987, 290–303.
K. L. McMillan, Using unfoldings to avoid the state explosion problem in the verification of asynchronous circuits, Proc. of CAV’ 92, LNCS, vol. 663, Springer, 1992, 164–174.
Peter Niebert, A temporal logic for the specification and verification of distributed behaviour, PhD thesis, Institut für Informatik, Universität Hildesheim, March 1998.
M. Nielsen, G. Plotkin, and G. Winskel, Petri nets, event structures and domains, Theoretical Computer Science 13 (1980), no. 1, 85–108.
M. Nielsen, G. Rozenberg, and P. S. Thiagarajan, Behavioural notions for elementary net systems, Distributed Computing 4 (1990), no. 1, 45–57.
W. Penczek, Model-Checking for a Subclass of Event Structures, Proc. of TACAS’ 97, LNCS, vol. 1217, 1997.
W. Penczek, Temporal logic of causal knowledge, Proc. of WoLLiC’ 98, 1998.
R. Ramanujam, A Local Presentation of Synchronizing Systems, Structures in Concurrency Theory, Workshops in Computing, 1995, 264–279.
P. S. Thiagarajan, A Trace Based Extension of PTL, Proc. of 9th LICS, 1994.
P. S. Thiagarajan, A Trace Consistent Subset of PTL, Proc. of CONCUR’ 95, LNCS, vol. 962, Springer, 1995, 438–452.
F. Wallner, Model checking LTL using net unfoldings, Proc. of CAV’ 98, LNCS, vol. 1427, Springer, 1998.
Glynn Winskel, Event structures, Advances in Petri Nets, LNCS, vol. 255, Springer, 1987.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Huhn, M., Niebert, P., Wallner, F. (1999). Model Checking Logics for Communicating Sequential Agents. In: Thomas, W. (eds) Foundations of Software Science and Computation Structures. FoSSaCS 1999. Lecture Notes in Computer Science, vol 1578. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-49019-1_16
Download citation
DOI: https://doi.org/10.1007/3-540-49019-1_16
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-65719-4
Online ISBN: 978-3-540-49019-7
eBook Packages: Springer Book Archive