Specifying real-time properties with metric temporal logic
Real-Time Systems
Predicting program execution times by analyzing static and dynamic program paths
Real-Time Systems - Special issue: Real-time languages and language-level timing tools and analysis
Theoretical Computer Science
Comparing different approaches for specifying and verifying real-time systems
RTOSS '93 Proceedings of the tenth IEEE workshop on Real-time operating systems and software
The algebra of timed processes, ATP: theory and application
Information and Computation
Communication and Concurrency
Dynamical Properties of Timed Automata
Discrete Event Dynamic Systems
Scheduler Modeling Based on the Controller Synthesis Paradigm
Real-Time Systems
Action versus State based Logics for Transition Systems
Proceedings of the LITP Spring School on Theoretical Computer Science: Semantics of Systems of Concurrent Processes
Hierarchical Modeling of Software Systems with Timed Petri Nets
International Workshop on Timed Petri Nets
HART '97 Proceedings of the International Workshop on Hybrid and Real-Time Systems
Proceedings of the Real-Time: Theory in Practice, REX Workshop
Performance modelling of a network processor using POOSL
Computer Networks: The International Journal of Computer and Telecommunications Networking - Network processors
Guided synthesis of control programs using UPPAAL
Nordic Journal of Computing
Code synthesis for timed automata
Nordic Journal of Computing
Real-time Property Preservation in Approximations of Timed Systems
MEMOCODE '03 Proceedings of the First ACM and IEEE International Conference on Formal Methods and Models for Co-Design
The formal semantics of SDL-2000: status and perspectives
Computer Networks: The International Journal of Computer and Telecommunications Networking - ITU-T system design languages (SDL)
Modeling a Network Processor Using Object Oriented Techniques
DSD '04 Proceedings of the Digital System Design, EUROMICRO Systems
Almost ASAP semantics: from timed models to timed implementations
Formal Aspects of Computing
Strengthening Property Preservation in Concurrent Real-Time Systems
RTCSA '06 Proceedings of the 12th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications
Quantifying similarities between timed systems
FORMATS'05 Proceedings of the Third international conference on Formal Modeling and Analysis of Timed Systems
HSCC'05 Proceedings of the 8th international conference on Hybrid Systems: computation and control
Branching-time property preservation between real-time systems
ATVA'06 Proceedings of the 4th international conference on Automated Technology for Verification and Analysis
Object-oriented modelling and specification using SHE
Computer Languages
Specification and analysis of timing constraints for embedded systems
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Verification of real-time DEVS models
SpringSim '09 Proceedings of the 2009 Spring Simulation Multiconference
Hi-index | 0.00 |
Formal theories for real-time systems (such as timed process algebra, timed automata and timed petri nets) have gained great success in the modeling of concurrent timing behavior and in the analysis of real-time properties. However, due to the ineliminable timing differences between a model and its realization, synthesizing a software realization from a model in a predictable way is still a challenging research topic. In this article, we tackle this problem by solving a set of sub-problems. The solution is based on the theoretical results for property prediction proposed in Huang et al. (2003, Real-time property preservation in approximations of timed systems. In: Proceedings of 1st ACM and IEEE international conference on formal methods and models for codesign. IEEE Computer Society, Los Alamitos, pp 163---171) and Huang (2005, Predictability in real-time system design. PhD thesis, Eindhoven University of Technology, The Netherlands), where quantitative property relations are established between two absolute/relative "close" real-time systems. This theory basically implies that if two systems are "close", they enjoy "similar" properties. These results cannot be directly applied in practice though, because a model and its realization typically have infinitely large absolute and relative timing differences. We show that this infinite time gap can be bridged through a sequence of carefully constructed intermediate time domains. Then the property-prediction results can be applied to any pair of adjacent time domains in the sequence. Consequently, real-time properties of the implementation can be predicted from the model. We propose two parameterized hypotheses to characterize the timing differences in the sequence and to guide a correctness-preserving design process. It is shown that these hypotheses can be incorporated in a concrete tool set. We demonstrate the feasibility of the predictable synthesis approach through the design of a railroad crossing system.