5.2 In Collections

[54]

Vladimir Valkanov et al. “AjTempura – First Software Prototype of C3A Model”. In: Intelligent Systems’2014: Proceedings of the 7th IEEE International Conference Intelligent Systems IS’2014, September 2426, 2014, Warsaw, Poland, Volume 1: Mathematical Foundations, Theory, Analyses. Ed. by P. Angelov et al. Cham: Springer International Publishing, 2015, pp. 427–435. isbn: 978-3-319-11313-5.
url: https://doi.org/10.1007/978-3-319-11313-5_38.

[55]

Hanna Klaudel, Maciej Koutny, and Zhenhua Duan. “Interval Temporal Logic Semantics of Box Algebra”. In: Language and Automata Theory and Applications. Ed. by Adrian-Horia Dediu, Carlos Martín-Vide, José-Luis Sierra-Rodríguez, and Bianca Truthe. Vol. 8370. Lecture Notes in Computer Science. Springer Verlag, 2014, pp. 441–452. isbn: 978-3-319-04920-5.
url: http://dx.doi.org/10.1007/978-3-319-04921-2_36.

[56]

Xu Lu, Zhenhua Duan, Cong Tian, and Hongjin Liu. “Integrating Separation Logic with PPTL”. In: Structured Object-Oriented Formal Language and Method. Ed. by Shaoying Liu and Zhenhua Duan. Lecture Notes in Computer Science. Springer Verlag, 2014, pp. 35–47. isbn: 978-3-319-04914-4.
url: http://dx.doi.org/10.1007/978-3-319-04915-1_3.

[57]

Ajesh Babu and Paritosh K. Pandya. “Chop Expressions and Discrete Duration Calculus”. In: Modern Applications of Automata Theory. World Scientific Publishing, 2012, pp. 229–256.
url: http://dx.doi.org/10.1142/9789814271059_0008.

[58]

Kamal Lodaya. “A Language-Theoretic View of Verification”. In: Modern Applications of Automata Theory. World Scientific Publishing, 2012, pp. 149–170.
url: http://dx.doi.org/10.1142/9789814271059_0005.

[59]

Markus Holzer and Sebastian Jakobi. “Chop Operations and Expressions: Descriptional Complexity Considerations”. In: Developments in Language Theory. Ed. by Giancarlo Mauri and Alberto Leporati. Vol. 6795. Lecture Notes in Computer Science. Springer Verlag, 2011, pp. 264–275.
url: http://dx.doi.org/10.1007/978-3-642-22321-1_23.

[60]

Monika Solanki, Antonio Cau, and Hussein Zedan. “Temporal Reasoning Of Reactive Web Services”. In: Semantic Web Services, Processes and Applications. Ed. by Jorge Cardoso and AmitP. Sheth. Vol. 3. Semantic Web and Beyond. Springer US, 2006, pp. 107–136. isbn: 978-0-387-30239-3.
url: http://dx.doi.org/10.1007/978-0-387-34685-4_5.

[61]

Ben Moszkowski. “A Hierarchical Analysis of Propositional Temporal Logic based on Intervals”. In: We Will Show Them: Essays in Honour of Dov Gabbay. Ed. by Sergei Artemov, Howard Barringer, Artur S. d’Avila Garcez, Luis C. Lamb, and John Woods. Vol. 2. King’s College, London: College Publications (formerly KCL Publications), 2005, pp. 371–440. isbn: 1-904987-12-5.

[62]

Howard Bowman, Helen Cameron, Peter King, and Simon Thompson. “Specification and Prototyping of Structured Multimedia Documents using Interval Temporal Logic”. In: Advances in Temporal Logic. Ed. by Howard Barringer, Michael Fisher, Dov Gabbay, and Graham Gough. Vol. 16. Applied Logic Series. Springer Verlag, 2000, pp. 435–453. isbn: 978-90-481-5389-3.
url: http://dx.doi.org/10.1007/978-94-015-9586-5_22.

[63]

Antonio Cau and Hussein Zedan. “The Systematic Construction of Information Systems”. In: Systems Engineering for Business Process Change. Ed. by Peter Henderson. Download pdf. Springer Verlag, 2000, pp. 264–278. isbn: 978-1-4471-1146-7.
url: http://dx.doi.org/10.1007/978-1-4471-0457-5_21.

[64]

Wolfgang Grieskamp and Markus Lepper. “Encoding Temporal Logics in Executable Z: A Case Study for the ZETA System”. In: Logic for Programming and Automated Reasoning. Ed. by Michel Parigot and Andrei Voronkov. Vol. 1955. Lecture Notes in Artificial Intelligence. Springer Verlag, 2000, pp. 43–53. isbn: 978-3-540-41285-4.
url: http://dx.doi.org/10.1007/3-540-44404-1_4.

[65]

Howard Bowman and Simon Thompson. “A Tableau Method for Interval Temporal Logic with Projection”. In: Automated Reasoning with Analytic Tableaux and Related Methods. Ed. by Harrie de Swart. Vol. 1397. Lecture Notes in Computer Science. Springer Verlag, 1998, pp. 108–123. isbn: 978-3-540-64406-4.
url: http://dx.doi.org/10.1007/3-540-69778-0_17.

[66]

Peter King, Helen Cameron, Howard Bowman, and Simon Thompson. “Synchronization in multimedia documents”. In: Electronic Publishing, Artistic Imaging, and Digital Typography. Ed. by Roger D. Hersch, Jacques André, and Heather Brown. Vol. 1375. Lecture Notes in Computer Science. Springer Verlag, 1998, pp. 355–369. isbn: 978-3-540-64298-5.
url: http://dx.doi.org/10.1007/BFb0053283.

[67]

Robert Büssow and Wolfgang Grieskamp. “Combining Z and temporal interval logics for the formalization of properties and behaviors of embedded systems”. In: Advances in Computing Science - ASIAN’97. Ed. by R.K. Shyamasundar and K. Ueda. Vol. 1345. Lecture Notes in Computer Science. Springer Verlag, 1997, pp. 46–56. isbn: 978-3-540-63875-9.
url: http://dx.doi.org/10.1007/3-540-63875-X_42.

[68]

Shinji Kono. “A combination of clausal and non clausal temporal logic programs”. In: Executable Modal and Temporal Logics. Ed. by Michael Fisher and Richard Owens. Vol. 897. Lecture Notes in Computer Science. Springer Verlag, 1995, pp. 40–57. isbn: 978-3-540-58976-1.
url: http://dx.doi.org/10.1007/3-540-58976-7_3.

[69]

Zhenhua Duan, Maciej Koutny, and Chris Holt. “Projection in temporal logic programming”. In: Logic Programming and Automated Reasoning. Ed. by Frank Pfenning. Vol. 822. Lecture Notes in Computer Science. Springer Verlag, 1994, pp. 333–344. isbn: 978-3-540-58216-8.
url: http://dx.doi.org/10.1007/3-540-58216-9_48.

[70]

Roger W.S. Hale. “Program Compilation”. In: Towards Verified Systems. Ed. by Jonathan Bowen. Vol. 2. Real-Time Safety Critical Systems. Elsevier, 1994. Chap. 7, pp. 131–146.
url: http://dx.doi.org/10.1016/B978-0-444-89901-9.50016-1.

[71]

Roger W.S. Hale and He Jifeng. “A Real-time Programming Language”. In: Towards Verified Systems. Ed. by Jonathan Bowen. Vol. 2. Real-Time Safety Critical Systems. Elsevier, 1994, pp. 115–130.
url: http://dx.doi.org/10.1016/B978-0-444-89901-9.50015-X.

[72]

Eric C. R. Hehner. “Abstractions of time”. In: A Classical Mind. Ed. by A. W. Roscoe. London: Prentice-Hall Int’l., 1994. Chap. 12.

[73]

Stephen M. Brien. “A time-interval calculus”. In: Mathematics of Program Construction. Ed. by R.S. Bird, C.C. Morgan, and J.C.P. Woodcock. Vol. 669. Lecture Notes in Computer Science. Springer Verlag, 1993, pp. 67–79. isbn: 978-3-540-56625-0.
url: http://dx.doi.org/10.1007/3-540-56625-2_8.

[74]

Thomas A. Henzinger, Zohar Manna, and Amir Pnueli. “Towards refining temporal specifications into hybrid systems”. In: Hybrid Systems I. Ed. by R. L. Grossman, A. Nerode, A. P. Ravn, and H. Rischel. Vol. 736. Lecture Notes in Computer Science. Springer Verlag, 1993, pp. 60–76.
url: http://dx.doi.org/10.1007/3-540-57318-6_24.

[75]

Roger Hale. “Temporal Logic Programming”. In: Temporal Logics and Their Applications. Ed. by Antony Galton. London: Academic Press, 1987, pp. 91–119. isbn: 0-12-274060-2.

[76]

Ben Moszkowski. “Executing temporal logic programs”. In: Seminar on Concurrency. Ed. by Stephen D. Brookes, Andrew William Roscoe, and Glynn Winskel. Vol. 197. Lecture Notes in Computer Science. Springer Verlag, 1985, pp. 111–130. isbn: 978-3-540-15670-3.
url: http://dx.doi.org/10.1007/3-540-15670-4_6.