Full information is available .
Executable temporal logics have been proposed in order to provide system developers with access to these, more powerful, logical techniques. Just as the development of sophisticated, and relatively efficient, theorem-proving techniques for first-order logic led to executable forms, such as Prolog, so the development of executable methods for temporal logics has often been based on temporal theorem-proving techniques. However, each particular executable temporal logic combines not only a logical perspective, but also an operational model, drawn from its intended application areas. Thus a wide range of languages have appeared, exhibiting a variety of characteristics and execution mechanisms. Consequently, such languages have a variety of application areas, such as temporal databases, temporal planning, animation of temporal specifications, hardware simulation, and distributed AI.
The Journal of Symbolic Computation is planning a special issue on Executable Temporal Logics, scheduled to appear in 1996. High quality original research papers are solicited on all aspects relating to the foundations, implementation techniques and applications of languages based upon temporal logic.
Topics: theoretical issues in executable temporal logics;design of executable temporal logics; relationship between execution and temporal theorem-proving; operational models and implementation techniques; programming support and environments; comparative studies of languages; relationship of executable temporal logics to (temporal) databases; applications and case studies.
Electronic submission is strongly encouraged (either as self-contained LaTeX, or postscript). Submissions, either electronic or a paper copy of the full paper, should arrive no later than October 15th 1995, Michael Fisher; Department of Computing; Manchester Metropolitan University; Manchester M1 5GD; United Kingdom; Tel: +44 161 247 1488; Fax: +44 161 247 1483; Email: M.Fisher@doc.mmu.ac.uk