Rajeev Alur & David L. Dill (1994):
A Theory of Timed Automata.
TCS 126,
pp. 183–235,
doi:10.1016/0304-3975(94)90010-8.
Rajeev Alur & Thomas A. Henzinger (1997):
Modularity for Timed and Hybrid Systems.
In: CONCUR,
LNCS 1243.
Springer,
pp. 74–88,
doi:10.1007/3-540-63141-0_6.
Joaquín Arias, Manuel Carro, Zhuo Chen & Gopal Gupta (2022):
Modeling and Reasoning in Event Calculus using Goal-Directed Constraint Answer Set Programming.
TPLP 22(1),
pp. 51–80,
doi:10.1017/S1471068421000156.
Joaquín Arias, Manuel Carro, Elmer Salazar, Kyle Marple & Gopal Gupta (2018):
Constraint Answer Set Programming without Grounding.
TPLP 18(3-4),
pp. 337–354,
doi:10.1017/S1471068418000285.
Michael Gelfond & Vladimir Lifschitz:
The Stable Model Semantics for Logic Programming.
In: ICLP,
pp. 1070–1080,
doi:10.2307/2275201.
Rodolfo Gómez & Howard Bowman (2007):
Efficient Detection of Zeno Runs in Timed Automata.
In: FORMATS,
LNCS 4763.
Springer,
pp. 195–210,
doi:10.1007/978-3-540-75454-1_15.
Thomas A. Henzinger (1996):
The Theory of Hybrid Automata.
In: LICS.
IEEE CS,
pp. 278–292,
doi:10.1109/LICS.1996.561342.
Frédéric Herbreteau & B Srivathsan (2013):
Coarse abstractions make Zeno behaviours difficult to detect.
Logical Methods in Computer Science Volume 9, Issue 1:6,
doi:10.2168/LMCS-9(1:6)2013.
Karl Henrik Johansson, Magnus Egerstedt, John Lygeros & Shankar Sastry (1999):
On the regularization of Zeno hybrid automata.
Systems & control letters 38(3),
pp. 141–150,
doi:10.1016/S0167-6911(99)00059-6.
Andrew G. Lamperski & Aaron D. Ames (2013):
Lyapunov Theory for Zeno Stability.
IEEE TAC 58,
pp. 100–112,
doi:10.1109/TAC.2012.2208292.
Erik T. Mueller (2008):
Chapter 17 Event Calculus.
In: Handbook of Knowledge Representation,
Foundations of Artificial Intelligence 3.
Elsevier,
pp. 671–708,
doi:10.1016/S1574-6526(07)03017-9.
Erik T. Mueller (2014):
Commonsense Reasoning: An Event Calculus Based Approach.
Morgan Kaufmann,
doi:10.1016/B978-0-12-801416-5.00002-4.
Anitha Murugesan, Isaac Hong Wong, Joaquín Arias & et. al. (2024):
Automating Semantic Analysis of System Assurance Cases Using Goal-Directed ASP.
TPLP 24(4),
pp. 805–824,
doi:10.1017/S1471068424000425.
Jonas Rinast & Sibylle Schupp (2012):
Static Detection of Zeno Runs in UPPAAL Networks Based on Synchronization Matrices and Two Data-Variable Heuristics.
In: FORMATS.
Springer,
Berlin, Heidelberg,
pp. 220–235,
doi:10.1007/978-3-642-33365-1_16.
Murray Shanahan (1996):
Robotics and the Common Sense Informatic Situation.
In: ECAI.
Wiley,
pp. 684–688.
Murray Shanahan (1997):
Solving the frame problem: a mathematical investigation of the common sense law of inertia.
MIT Press.
Sarat Chandra Varanasi, Joaquín Arias, Elmer Salazar & et. al. (2022):
Modeling and Verification of Real-Time Systems with the Event Calculus and s(CASP).
In: PADL.
Springer Iternational,
doi:10.1007/978-3-030-94479-7_12.
Ondrej Vasicek, Joaquin Arias, Jan Fiedor & et. al. (2024):
Early Validation of High-Level System Requirements with Event Calculus and Answer Set Programming.
TPLP 24(4),
pp. 844–862,
doi:10.1017/S1471068424000280.
eptcs@eptcs.org