Abstract
Higher dimensional automata (\(\mathit{HDAs}\)) are a model of concurrency that can express most of the traditional partial order models like Mazurkiewicz traces, pomsets, event structures, or Petri nets. Modal logics, interpreted over Kripke structures, are the logics for reasoning about sequential behavior and interleaved concurrency. Modal logic is a well behaved subset of first-order logic; many variants of modal logic are decidable. However, there are no modal-like logics for the more expressive \(\mathit{HDA}\) models. In this paper we introduce and investigate a modal logic over \(\mathit{HDAs}\) which incorporates two modalities for reasoning about “during” and “after”. We prove that this general higher dimensional modal logic (\(\mathit{HDML}\)) is decidable and we define a complete axiomatic system for it. We also show how, when the \(\mathit{HDA}\) model is restricted to Kripke structures, a syntactic restriction of \(\mathit{HDML}\) becomes the standard modal logic. Then we isolate the class of \(\mathit{HDAs}\) that encode Mazurkiewicz traces and show how \(\mathit{HDML}\) can be restricted to LTrL (the linear time temporal logic over Mazurkiewicz traces).
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Alur, R., McMillan, K.L., Peled, D.: Deciding Global Partial-Order Properties. Formal Methods in System Design 26(1), 7–25 (2005)
Alur, R., Peled, D.: Undecidability of partial order logics. Inf. Process. Lett. 69(3), 137–143 (1999)
Blackburn, P., de Rijke, M., Venema, Y.: Modal Logic. Cambridge Tracts in Theor. Comput. Sci., vol. 53. Cambridge Univ. Press, Cambridge (2001)
Diekert, V., Gastin, P.: LTL Is Expressively Complete for Mazurkiewicz Traces. In: Welzl, E., Montanari, U., Rolim, J.D.P. (eds.) ICALP 2000. LNCS, vol. 1853, pp. 211–222. Springer, Heidelberg (2000)
Diekert, V., Gastin, P.: From local to global temporal logics over Mazurkiewicz traces. Theor. Comput. Sci. 356(1-2), 126–135 (2006)
Lodaya, K., Mukund, M., Ramanujam, R., Thiagarajan, P.S.: Models and Logics for True Concurrency. Technical Report IMSc-90-12, Inst. Mathematical Science, Madras, India (1990)
Lodaya, K., Parikh, R., Ramanujam, R., Thiagarajan, P.S.: A Logical Study of Distributed Transition Systems. Inf. Comput. 119(1), 91–118 (1995)
Mazurkiewicz, A.W.: Basic notions of trace theory. In: de Bakker, J.W., de Roever, W.-P., Rozenberg, G. (eds.) REX Workshop. LNCS, vol. 354, pp. 285–363. Springer, Heidelberg (1989)
Mukund, M., Thiagarajan, P.S.: Linear Time Temporal Logics over Mazurkiewicz Traces. In: Penczek, W., Szałas, A. (eds.) MFCS 1996. LNCS, vol. 1113, pp. 62–92. Springer, Heidelberg (1996)
Nielsen, M., Plotkin, G.D., Winskel, G.: Petri nets, event structures and domains. In: Kahn, G. (ed.) Semantics of Concurrent Computation. LNCS, vol. 70, pp. 266–284. Springer, Heidelberg (1979)
Pnueli, A.: The temporal logic of programs. In: FOCS 1977, pp. 46–57. IEEE Computer Society Press, Los Alamitos (1977)
Pratt, V.R.: A Practical Decision Method for Propositional Dynamic Logic: Preliminary Report. In: STOC 1978, pp. 326–337. ACM Press, New York (1978)
Pratt, V.R.: Modeling Concurrency with Partial Orders. J. Parallel Programming 15(1), 33–71 (1986)
Pratt, V.R.: Modeling concurrency with geometry. In: POPL 1991, pp. 311–322 (1991)
Pratt, V.R.: Chu spaces and their interpretation as concurrent objects. In: van Leeuwen, J. (ed.) Computer Science Today. LNCS, vol. 1000, pp. 392–405. Springer, Heidelberg (1995)
Pratt, V.R.: Higher dimensional automata revisited. Math. Struct. Comput. Sci. 10(4), 525–548 (2000)
Pratt, V.R.: Transition and Cancellation in Concurrency and Branching Time. Math. Struct. Comput. Sci. 13(4), 485–529 (2003)
Prisacariu, C.: Modal Logic over Higher Dimensional Automata – technicalities. Technical Report 393, Univ. Oslo (January 2010)
Rozoy, B., Thiagarajan, P.S.: Event structures and trace monoids. Theor. Comput. Sci. 91(2), 285–313 (1991)
Thiagarajan, P.S., Walukiewicz, I.: An Expressively Complete Linear Time Temporal Logic for Mazurkiewicz Traces. Information and Computation 179(2), 230–249 (2002)
van Glabbeek, R.J.: On the Expressiveness of Higher Dimensional Automata. Theor. Comput. Sci. 356(3), 265–290 (2006)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Prisacariu, C. (2010). Modal Logic over Higher Dimensional Automata. In: Gastin, P., Laroussinie, F. (eds) CONCUR 2010 - Concurrency Theory. CONCUR 2010. Lecture Notes in Computer Science, vol 6269. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-15375-4_34
Download citation
DOI: https://doi.org/10.1007/978-3-642-15375-4_34
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-15374-7
Online ISBN: 978-3-642-15375-4
eBook Packages: Computer ScienceComputer Science (R0)