Communicating sequential processes
Communicating sequential processes
Specification and proof in real-time CSP
Specification and proof in real-time CSP
Theoretical Computer Science
Synthesising controllers from real-time specifications
ISSS '97 Proceedings of the 10th international symposium on System synthesis
Formal Methods for Real-Time Computing
Formal Methods for Real-Time Computing
Formal Techniques in Real-Time and Fault-Tolerant Systems: Third International Symposium Organized Jointly with the Working Group Provably Correct Systems, ProCoS, Lubeck, Germany, September 19-23, 1994 Proceedings
Specifying and Verifying Requirements of Real-Time Systems
IEEE Transactions on Software Engineering
Formal Development of Reactive Systems - Case Study Production Cell
Formal Development of Reactive Systems - Case Study Production Cell
Hybrid Systems
ProCoS Proceedings of the Third International Symposium Organized Jointly with the Working Group Provably Correct Systems on Formal Techniques in Real-Time and Fault-Tolerant Systems
The Production Cell: A Verified Real-Time System
FTRTFT '96 Proceedings of the 4th International Symposium on Formal Techniques in Real-Time and Fault-Tolerant Systems
PLC-Automata: A New Class of Implementable Real-Time Automata
ARTS '97 Proceedings of the 4th International AMAST Workshop on Real-Time Systems and Concurrent and Distributed Software: Transformation-Based Reactive Systems Development
Automata and Their Interaction: Definitional Suggestions
FCT '99 Proceedings of the 12th International Symposium on Fundamentals of Computation Theory
Safety-critical Java in Circus
Proceedings of the 9th International Workshop on Java Technologies for Real-Time and Embedded Systems
Visual temporal logic as a rapid prototyping tool
Computer Languages
Understanding Basic Automata Theory in the Continuous Time Setting
Fundamenta Informaticae - Continuous Time Paradigms in Logic and Automata
| Hi-index | 0.00 |
In this paper we show that every real-time system specified in a certain subset of Duration Calculus [24] can be decomposed into an untimed system communicating with suitable timers. Both asynchronous and synchronous communication are considered.