Preview
Unable to display preview. Download preview PDF.
References
K. R. Abrahamson, Decidability and Expressiveness of Logics of Processes, Ph. D. Thesis, Technical Report 80-08-01, August 1980, University of Washington, Seattle.
R. Danecki, Multiple Propositional Dynamic Logic of Parallel Programs, Fundamenta Informaticae, to appear.
M. J. Fisher, R. E. Ladner, Propositional Dynamic Logic of Regular Programs, JCSS 18:2 (1979), pp. 194â211.
G. Mirkowska, A. Salwicki, Algorithmic Logic, PWN-Polish Scientific Publishers and D. Reidel Publishing Company 1987.
D. Peleg, Concurrent Dynamic Logic, Proc. STOC'85, pp. 232â239.
A. Salwicki, T. MĂŒldner, On the Algorithmic Properties of Concurrent Programs, in Logic of Programs, Proc., LNCS 125, pp. 169â197, Springer 1981.
R. S. Streett, Propositional Dynamic Logic of Looping and Converse is elementarily decidable, Information and Control 54 (1982) pp. 121â141.
M. O. Rabin, Weakly definable relations and special automata, in: Math. Logic and Found. of Set Theory (Y. Bar-Hillel ed.), pp. 1â23, North-Holland 1970.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1988 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Danecki, R. (1988). Multiple propositional dynamic logic of parallel programs. In: Chytil, M.P., Koubek, V., Janiga, L. (eds) Mathematical Foundations of Computer Science 1988. MFCS 1988. Lecture Notes in Computer Science, vol 324. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0017147
Download citation
DOI: https://doi.org/10.1007/BFb0017147
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-50110-7
Online ISBN: 978-3-540-45926-2
eBook Packages: Springer Book Archive