On the operational semantics of timed rewrite systems
Tóm tắt
We propose an efficient operational semantics for a new class of rewrite systems, namely timed rewrite systems. This class constitute a conservative extension of first-order conditional term rewrite systems together with time features such as clocks, signals, timed terms, timed atoms and timed rules. We define first timed rewrite systems and illustrate them through some examples. A naive approach to the operational semantics is very costly in space. We propose, for a large class of programs, an improved calculus with a linear space complexity. Finally, we show how our framework compares to related work.
Từ khóa
#Clocks #Proposals #Calculus #Logic devices #Logic programming #Computer languages #Natural languages #Shape #Equations #TailTài liệu tham khảo
10.1007/BFb0014004
10.1007/3-540-45578-7_21
saraswat, 1994, Constraint Pro-gramming volume 131 of the NATO Advanced Science Institute Series Series F Computer and System Sciences chapter Programming in Timed Concurrent Constraint Lan-guages
10.1006/jsco.1996.0064
zhang, 1994, Parallel execution of temporal logic programs using dataflow computation, Int'l Conf Computing and Information, 812
10.1016/S1571-0661(04)80348-7
blanc, 2001, Synchronous functional logic programming, Technical Report
gabbay, 1987, Modal and Temporal Logic Programming, 197
10.1007/3-540-44404-1_12
halbwachs, 1998, Synchronous programming of reactive sys-tems, Computer-Aided Verification (CAV'98), 1
guernic, 1991, Programming real time applications with signal, Proceedings of the IEEE, 79
berry, 1992, The Esterel programming language Design semantics and implementation Science of Computer Programming, 19
10.1016/S0747-7171(89)80070-7
10.1006/jsco.1996.0072