×

Decidability of a partial order based temporal logic. (English) Zbl 1422.03027

Lingas, Andrzej (ed.) et al., Automata, languages and programming. 20th international colloquium, ICALP 93, Lund, Sweden, July 5–9, 1993. Proceedings. Berlin: Springer-Verlag. Lect. Notes Comput. Sci. 700, 582-592 (1993).
For the entire collection see [Zbl 0814.00020].

MSC:

03B44 Temporal logic
03B25 Decidability of theories and sets of sentences
03B35 Mechanization of proofs and logical operations

Software:

UNITY
Full Text: DOI

References:

[1] K.R. Apt: Ten years of Hoare logic: a survey — Part I, \(ACM Trans. Prog. Lang. Syst.\)3, 4 (1981) 431-483. · Zbl 0471.68006
[2] J.P. Burgess: Decidability for branching time, \(Studia Logica\) XXXIX (1980) 203-218. · Zbl 0467.03006
[3] K.M. Chandy, J. Misra: \(Parallel program design: a foundation\) (Addison-Wesley, 1988). · Zbl 0717.68034
[4] E.A. Emerson: Temporal and modal logic, in J. van Leeuwen (ed.): \(Handbook of theoretical computer science\) B (Elsevier, 1990) 995-1072. · Zbl 0900.03030
[5] G.E. Hughes, M.J. Creswell: \(A companion to modal logic\) (Methuen, 1982).
[6] D. Harel: Dynamic logic, in D. Gabbay, F. Guenthner (eds.): \(Handbook of philosophical logic\) II (Reidel, 1984) 497-604. · Zbl 0875.03076
[7] L. Lamport: Time, clocks and the ordering of events in a distributed system, \(Commun. ACM21, 7\) (Jul 1978) 558-565. · Zbl 0378.68027
[8] K. Lodaya, M. Mukund, R. Ramanujam, P.S. Thiagarajan: Models and logics for true concurrency, \(Sādhanā 17\), Part 1 (Indian Academy of Sciences, Mar 1992) 131-165. · Zbl 1075.68604
[9] K. Lodaya, R. Ramanujam: Tense logics for local reasoning in distributed systems, \(Proc. 11th FST \& TCS, LNCS560 (1991) 71-88\).
[10] K. Lodaya, R. Ramanujam, P.S. Thiagarajan: Temporal logics for communicating sequential agents: I, \(Int. J. Found. Comput. Sci.\)3, 2 (1992) 117-159. · Zbl 0754.68085
[11] M. Mukund, P.S. Thiagarajan: A Petri net model of asynchronously communicating sequential processes, in R. Narasimhan (ed.): \(A perspective in theoretical computer science — commemorative volume for Gift Siromoney\) (World Scientific, 1989) 165-198. · Zbl 0744.68026
[12] M. Nielsen, G. Plotkin, G. Winskel: Petri nets, event structures and domains I, \(Theoret. Comput. Sci.\)13 (1980) 86-108.
[13] W. Penczek: A temporal logic for event structures, \(Fund. Inform.\) XI (1988) 297-326. · Zbl 0677.03012
[14] S. Pinter, P. Wolper: A temporal logic lor reasoning about partially ordered computations, \(Proc. 3rd ACM PODC (1984) 28-37\).
[15] M.O. Rabin: Decidability of second order theories and automata on infinite trees, \(Trans. Amer. Math. Soc.\)141 (1969) 1-35. · Zbl 0221.02031
[16] C. Stirling: Temporal logics for CCS, \(Proc. REX 88, LNCS354 (1989) 660-672\). · Zbl 0683.68016
[17] M. Vardi, P. Wolper: Automata theoretic techniques for modal logics of programs, \(J. Comput. Syst. Sci.\)32, 2 (1986) 183-221. · Zbl 0622.03017
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.