×
Lodaya, Kamal; Mukund, Madhavan; Ramanujam, R.; Thiagarajan, P. S.

Models and logics for true concurrency. (English) Zbl 1075.68604

Sādhanā 17, No. 1, 131-165 (1992).

Cited in 3 Documents

MSC:

68Q10 Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.)
03B70 Logic in computer science
68T27 Logic in artificial intelligence
Cite Review PDF
Full Text: DOI

References:

[1] Apt, K. R.; Francez, N.; de Roever, W. P., A proof system for communicating sequential processes, acm Trans. Program. Lang. Syst., 2, 359-385 (1980) · Zbl 0468.68023 · doi:10.1145/357103.357110
[2] Bergstra, J. A.; Klop, J. W., Process algebra for synchronous communication, Inf. Control, 60, 1-3, 109-137 (1984) · Zbl 0597.68027 · doi:10.1016/S0019-9958(84)80025-X
[3] Boudol, G., Flow event structures and flow nets. Lecture Notes in Computer Science. Vol. 469, 62-95 (1990), Berlin: Springer India, Berlin
[4] Boudol, G.; Castellani, I., A non-interleaving semantics for ccs based on proved transitions, Fundam. Inf., 11, 433-452 (1988) · Zbl 0657.68066
[5] Brauer, W.; Reisig, W.; Rozenberg, G., Petri nets: central models and their properties. Lecture Notes in Computer Science. Vol. 254 (1987), Berlin: Springer India, Berlin · Zbl 0619.00023
[6] Burgess, J. P., Decidability for branching time, Stud. Logica, 39, 203-218 (1980) · Zbl 0467.03006 · doi:10.1007/BF00370320
[7] Burgess, J. P.; Gabbay, D.; Guenthner, F., Basic tense logic, Handbook of philosophical logic II, 89-133 (1984), Dordrecht: D Reidel, Dordrecht · Zbl 0875.03046
[8] Christiansen S 1989A logical characterization of linear n-agent event structures, M Sc thesis, Computer Science Department, Århus Univ. Århus
[9] Clarke, E. M.; Emerson, E. A.; Sistla, A. P., Automatic verification of finite-state concurrent programs using temporal logic specifications, acmTrans. Program. Lang. Syst., 8, 244-263 (1986) · Zbl 0591.68027 · doi:10.1145/5397.5399
[10] Degano, P.; Montanari, U., Concurrent histories: A basis for observing distributed systems, J. Comput. Syst. Sci., 34, 422-461 (1987) · Zbl 0619.68017 · doi:10.1016/0022-0000(87)90032-8
[11] Degano, P.; de Nicola, R.; Montanari, U., Partial ordering descriptions and observations of nondeterministic concurrent processes. Lecture Notes in Computer Science. Vol. 354, 438-466 (1989), Berlin: Springer India, Berlin · Zbl 0683.68067
[12] Gabbay, D.; Pnueli, A.; Shelah, S.; Stavi, J., On the temporal analysis of fairness, Proc. 7th acmSymp. Principles of Program. Lang, 163-173 (1980), New Delhi: acm Press, New Delhi
[13] van Glabbeek, R.; Vaandrager, F., Petri net models for algebraic theories of concurrency. Lecture Notes in Computer Science. Vol. 259, 224-242 (1987), Berlin: Springer India, Berlin · Zbl 0633.68054
[14] Harel, D.; Gabbay, D.; Guenthner, F., Dynamic logic, Handbook of philosophical logic II, 497-604 (1984), Dordrecht: D Reidel, Dordrecht · Zbl 0875.03076
[15] Harel, D., Recurring dominoes: making the highly undecidable highly understandable, Ann. Discrete Math., 24, 51-72 (1985) · Zbl 0531.68003
[16] Hennessy, M.; Milner, R., Algebraic laws for nondeterminism and concurrency, J. Assoc. Comput. Mach., 32, 137-161 (1985) · Zbl 0629.68021
[17] Hoare, C. A R., An axiomatic basis for computer programming, Commun. ACM, 12, 576-580 (1969) · Zbl 0179.23105 · doi:10.1145/363235.363259
[18] Hoare, C. A R., Communicating sequential process (1984), New Delhi: Prentice-Hall, New Delhi
[19] Katz, S.; Peled, D., An efficient verification method for parallel and distributed programs. Lecture Notes in Computer Science. Vol. 354, 489-507 (1989), Berlin: Springer India, Berlin · Zbl 0683.68015
[20] Lodaya K, Parikh R, Ramanujam R, Thiagarajan P S 1992 A logical study of distributed transition systems, Report imsc/92/07, Inst. Math. Sci., Madras · Zbl 0832.68075
[21] Lodaya, K.; Ramanujam, R.; Thiagarajan, P. S., A logic for distributed transition systems. Lecture Notes in Computer Science. Vol. 354, 508-522 (1989), Berlin: Springer India, Berlin · Zbl 0683.68053
[22] Lodaya K, Ramanujam R, Thiagarajan P S 1989b Temporal logics for communicating sequential agents:Int. J. Found. Comput. Sci. (to appear) · Zbl 0754.68085
[23] Lodaya, K.; Thiagarajan, P. S., A modal logic for a subclass of event structures. Lecture Notes in Computer Science. Vol. 267, 290-303 (1987), Berlin: Springer India, Berlin · Zbl 0643.68026
[24] Mazurkiewicz, A., Basic notions of trace theory. Lecture Notes in Computer Science. Vol. 354, 285-363 (1989), Berlin: Springer India, Berlin · Zbl 0683.68032
[25] Milner, R., Communication and concurrency (1989), New Delhi: Prentice-Hall, New Delhi · Zbl 0683.68008
[26] Moitra, A., acmTrans. Program. Lang. Syst., 5, 500-501 (1983) · doi:10.1145/2166.357222
[27] Mukund M 1990 Expressiveness and completeness of a logic for well branching prime event structures, Report tcs-90-1, School of Math., spic Science Foundation, Madras
[28] Mukund, M.; Thiagarajan, P. S., An axiomatization of event structures. Lecture Notes in Computer Science. Vol. 405, 143-160 (1989), Berlin: Springer India, Berlin · Zbl 0731.03021
[29] Mukund M, Thiagarajan P S 1991 A logical characterization of well branching event structures.Theor. Comput. Sci. (to appear) · Zbl 0761.68058
[30] Nielsen, M.; Plotkin, G.; Winskel, G., Petri nets, event structures and domains I, Theor. Comput. Sci., 13, 86-108 (1980) · Zbl 0452.68067
[31] Nielsen, M.; Rozenberg, G.; Thiagarajan, P. S., Behavioural notions for elementary net systems, Distrib. Comput., 4, 45-57 (1990) · doi:10.1007/BF01783665
[32] Ochmanski, E., Regular trace languages (1985), Warsaw: University of Warsaw, Warsaw
[33] Olderog, E-R, Operational Petri net semantics for csp. Lecture Notes in Computer Science. Vol. 266, 196-223 (1987), Berlin: Springer India, Berlin · Zbl 0636.68072
[34] Parikh, R.; Narasimhan, R., Decidability and undecidability in distributed transition systems, A perspective in theoretical computer science — commemorative volume for Gift Siromoney, 199-209 (1989), Singapore: World Scientific, Singapore · Zbl 0744.68026
[35] Peleg, D., Concurrent dynamic logic, J. Assoc. Comput. Mach., 34, 450-479 (1987) · Zbl 0645.03021
[36] Penczek, W., A temporal logic for event structures, Fundam. Inf., 11, 297-326 (1988) · Zbl 0677.03012
[37] Pinter, S.; Wolper, P., A temporal logic for reasoning about partially ordered computations, Proc. 3rd acmSymp. Principles of Distrib. Comput. (1984), New Delhi: acm Press, New Delhi
[38] Plotkin G 1981 A structural approach to operational semantics, Report daim ifn-19, Computer Science Dept, Århus Univ, Århus
[39] Pnueli, A., The temporal logic of programs, Proc. 18th ieee Conf. Foundations of Comput. Sci., 46-57 (1977), New Delhi: ieee, New Delhi
[40] Pratt, V., Modelling concurrency with partial orders, Int. J. Parallel Programming, 15, 33-71 (1986) · Zbl 0622.68034 · doi:10.1007/BF01379149
[41] Reisig, W., Towards a temporal logic for causality and choice in distributed systems. Lecture Notes in Computer Science. Vol. 354, 603-627 (1986), Berlin: Springer India, Berlin
[42] Stark, E. W., Concurrent transition systems, Theor. Comput. Sci., 64, 221-269 (1989) · Zbl 0671.68027 · doi:10.1016/0304-3975(89)90050-9
[43] Stirling, C., Modal logics for communicating systems, Theor. Comput. Sci., 49, 311-347 (1987) · Zbl 0624.68019 · doi:10.1016/0304-3975(87)90012-0
[44] Thiagarajan, P. S., Some behavioural aspects of net theory, Theor. Comput. Sci., 71, 133-153 (1990) · Zbl 0699.68083 · doi:10.1016/0304-3975(90)90193-L
[45] Wang, H., Proving theorems by pattern recognition II, Bell Syst. Tech. J., 40, 1-41 (1961)
[46] Winskel, G., Event structure semantics for CCS and related languages. Lecture Notes in Computer Science. Vol. 140, 561-577 (1982), Berlin: Springer India, Berlin · Zbl 0518.68045
[47] Winskel, G., Event structures. Lecture Notes in Computer Science. Vol. 255, 325-392 (1987), Berlin: Springer India, Berlin · Zbl 0626.68022
[48] Zielonka, W., Notes on finite asynchronous automata, RAIRO Inf. Theor. Appl., 21, 2, 99-135 (1987) · Zbl 0623.68055
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.