{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T09:20:48Z","timestamp":1649064048099},"reference-count":21,"publisher":"EDP Sciences","issue":"2","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["RAIRO-Theor. Inf. Appl."],"published-print":{"date-parts":[[1992]]},"DOI":"10.1051\/ita\/1992260201151","type":"journal-article","created":{"date-parts":[[2017,2,2]],"date-time":"2017-02-02T10:02:46Z","timestamp":1486029766000},"page":"115-149","source":"Crossref","is-referenced-by-count":2,"title":["TTL : a formalism to describe local and global properties of distributed systems"],"prefix":"10.1051","volume":"26","author":[{"given":"A.","family":"Masini","sequence":"first","affiliation":[]},{"given":"A.","family":"Maggiolo-Schettini","sequence":"additional","affiliation":[]}],"member":"250","published-online":{"date-parts":[[2011,1,8]]},"reference":[{"key":"R1","unstructured":"1. VAN BENTHEM J., Modal Logic and Classical Logic, Bibliopolis, Napoli, 1985.8324320639.03014"},{"key":"R2","doi-asserted-by":"crossref","unstructured":"2. BEN-ARI M., PNUELI A. and MANNA Z., The Temporal Logic of Branching Time, Acta Inform., 1983, 20, pp. 207-226.7336760533.68036","DOI":"10.1007\/BF01257083"},{"key":"R3","doi-asserted-by":"crossref","unstructured":"3. CLARKE E. M., EMERSON E. A. and SISTLA A. P., Automatic Verification of Finite-State Concurrent Systems Using Temporal Logic Specifications, A.C.M. Trans. Prog. Lang. Syst., 1986, 8, pp. 244-263.0591.68027","DOI":"10.1145\/5397.5399"},{"key":"R4","doi-asserted-by":"crossref","unstructured":"4. CLARKE E. M., GRUMBERG O. and KURSHAN R. P., A Synthesis of Two Approaches for Verifying Finite State Concurrent Systems, \"Logic at Botik '89\", Lect. Notes in Comput. Sci., 1989, 363, Springer, Berlin, pp. 81-90.10305680688.68019","DOI":"10.1007\/3-540-51237-3_7"},{"key":"R5","doi-asserted-by":"crossref","unstructured":"5. CLARKE E. M., LONG D. E. and MCMILLAN K. L., Compositional Model Checking, \"Fourth Annual Symposium on Logic in Computer Science\", I.E.E.E. Computer Society Press, Washington, D.C., 1989, pp. 353-362.0716.68035","DOI":"10.1109\/LICS.1989.39190"},{"key":"R6","doi-asserted-by":"crossref","unstructured":"6. DANELUTTO M. and MASINI A., A Temporal Logic Approach to Specify and to Prove Properties of Finite State Concurrent Systems, \"CSL'88\", Lecture Notes in Comput. Sci, 1989, 385, Springer, Berlin, pp. 63-79.10355620746.68030","DOI":"10.1007\/BFb0026295"},{"key":"R7","doi-asserted-by":"crossref","unstructured":"7. DEGANO P., DE NICOLA R. and MONTANARI U., A Distributed Operational Semantics for CCS Based on Condition\/Event Systems, Acta Inform., 1987, 26, pp. 59-91.9698700656.68061","DOI":"10.1007\/BF02915446"},{"key":"R8","doi-asserted-by":"crossref","unstructured":"8. EMERSON E. A., Alternative Semantics for Temporal Logics, Theoret. Comput. Sci., 1983, 26, pp. 121-130.7269150559.68050","DOI":"10.1016\/0304-3975(83)90082-8"},{"key":"R9","doi-asserted-by":"crossref","unstructured":"9. EMERSON E. A. and CLARKE E. M., Using Branching Time Temporal Logic to Synthesize Synchronization Skeletons, Sci. Comput. Programming, 1982, 2, pp. 241-266.0514.68032","DOI":"10.1016\/0167-6423(83)90017-5"},{"key":"R10","doi-asserted-by":"crossref","unstructured":"10. EMERSON E. A. and HALPERN J. Y., D\u00e9cision Procedures and Expressiveness in the Temporal Logic of Branching Time, J. Comput. System Sci., 1985, 30, pp. 1-24.7888280559.68051","DOI":"10.1016\/0022-0000(85)90001-7"},{"key":"R11","doi-asserted-by":"crossref","unstructured":"11. EMERSON E. A. and HALPERN J. Y., \"Sometimes\" and \"Not Never\" Revisited: On Branching Versus Linear Time Temporal Logic, J. A.C.M., 1986, 33, pp. 151-178.8201030629.68020","DOI":"10.1145\/4904.4999"},{"key":"R12","doi-asserted-by":"crossref","unstructured":"12. EMERSON E. A. and LEI C. L., Modalities for Model Checking: Branching Time Strikes Back, 12th A.C.M. Symposium on Principles of Programming Languages, 1985, pp. 84-96.0615.68019","DOI":"10.1145\/318593.318620"},{"key":"R13","doi-asserted-by":"crossref","unstructured":"13. EMERSON E. A. and SISTLA A. P., Deciding Full Branching Time Logic, Inform. and Control, 1984, 61, pp. 175-201.7734040593.03007","DOI":"10.1016\/S0019-9958(84)80047-9"},{"key":"R14","doi-asserted-by":"crossref","unstructured":"14. ENJALBERT P. and MICHEL M., Many-Sorted Temporal Logic for Multi-Process Systems, \"Mathematical Foundations of Computer Science, 1984\", Lecture Notes in Comput. Sci., 176, Springer, Berlin, 1984, pp. 273-281.7834560558.68026","DOI":"10.1007\/BFb0030308"},{"key":"R15","doi-asserted-by":"crossref","unstructured":"15. KR\u00d6GER F., Temporal Logic of Programs, Springer, Berlin, 1987.8894580609.03007","DOI":"10.1007\/978-3-642-71549-5"},{"key":"R16","doi-asserted-by":"crossref","unstructured":"16. LAMPORT L., \"Sometimes\" is Sometimes \"Not Never\": On the Temporal Logic of Programs, 7th A.C.M. Symposium on Principles of Programming Languages, 1980, pp. 174-185.","DOI":"10.1145\/567446.567463"},{"key":"R17","doi-asserted-by":"crossref","unstructured":"17. LODAYA K. and THIAGARAJAN P. S., A Modal Logic for a Subclass of Event Structures, Automata Languages and Programming '87, Lecture Notes in Comput. Sci., 1987. 267, Springer, Berlin, pp. 290-303.9127170643.68026","DOI":"10.1007\/3-540-18088-5_24"},{"key":"R18","doi-asserted-by":"crossref","unstructured":"18. MANNA Z. and WOLPER P., Synthesis of Communicating Process from Temporal Logic Specifications, A.C.M. Trans. Prog. Lang. Syst., 1984, 6, pp. 68-93.0522.68030","DOI":"10.1145\/357233.357237"},{"key":"R19","unstructured":"19. MASINI A., I Sistemi di Interazione: una proposta di formalizzazione logico-temporale e di realizzazione semanticamente corretta, Tesi di Laurea in Scienze dell'Informazione,Universit\u00e0 di Pisa, 1986."},{"key":"R20","doi-asserted-by":"crossref","unstructured":"20. NGUYEN V., DEMERS A., GRIES D. and OWICKI S., A Model and Temporal Proof System for Networks of Processes, Distributed Computing, 1986, 1, pp. 7-25.0598.68025","DOI":"10.1007\/BF01843567"},{"key":"R21","doi-asserted-by":"crossref","unstructured":"21. WEDDE H. F., An Iterative and Starvation-Free Solution for a General Class of Distributed Control Problems Based on Interaction Primitives, Theoret. Comput. Sci., 1983, 24, pp. 1-20.7076450511.68013","DOI":"10.1016\/0304-3975(83)90127-5"}],"container-title":["RAIRO - Theoretical Informatics and Applications"],"original-title":[],"link":[{"URL":"http:\/\/www.rairo-ita.org\/10.1051\/ita\/1992260201151\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,18]],"date-time":"2019-09-18T01:57:58Z","timestamp":1568771878000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.rairo-ita.org\/10.1051\/ita\/1992260201151"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992]]},"references-count":21,"journal-issue":{"issue":"2"},"alternative-id":["ita1992260201151"],"URL":"https:\/\/doi.org\/10.1051\/ita\/1992260201151","relation":{},"ISSN":["0988-3754","1290-385X"],"issn-type":[{"value":"0988-3754","type":"print"},{"value":"1290-385X","type":"electronic"}],"subject":[],"published":{"date-parts":[[1992]]}}}