Abstract
Mobile processes involve not only in time but also in space. Traditionally model checking has mainly concerned with temporal properties of processes, but recently proposals have been put forwarded to check spatial properties as well. In this talk we shall first present a modal logic for describing temporal as well as spatial properties of mobile processes expressed in the asynchronous π-calculus. The logic is first-order and has quantifies including the fresh name quantifier for handling the name restriction construct in the π-calculus. The novelty of the logic is that fixpoint formulas are constructed as predicates which are functions from names to propositions. The semantics of the logic is developed and shown to be monotonic, thus guarantees the existence of fixpoints. We then propose an algorithm to automatically check if a process has properties described as formulas in the logic, and establish its correctness.
Supported by research grants from Natural Science Foundation of China and Chinese Academy of Sciences.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lin, H. (2005). A Predicate Spatial Logic and Model Checking for Mobile Processes. In: Liu, Z., Araki, K. (eds) Theoretical Aspects of Computing - ICTAC 2004. ICTAC 2004. Lecture Notes in Computer Science, vol 3407. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-31862-0_4
Download citation
DOI: https://doi.org/10.1007/978-3-540-31862-0_4
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-25304-4
Online ISBN: 978-3-540-31862-0
eBook Packages: Computer ScienceComputer Science (R0)