Theoretical Computer Science
An efficient state space generation for analysis of real-time systems
ISSTA '96 Proceedings of the 1996 ACM SIGSOFT international symposium on Software testing and analysis
Minimization of Timed Transition Systems
CONCUR '92 Proceedings of the Third International Conference on Concurrency Theory
A Method for Testing the Conformance of Real Time Systems
FTRTFT '02 Proceedings of the 7th International Symposium on Formal Techniques in Real-Time and Fault-Tolerant Systems: Co-sponsored by IFIP WG 2.2
An Efficient Algorithm for Minimizing Real-time Transition Systems
CAV '93 Proceedings of the 5th International Conference on Computer Aided Verification
Analysis of Timed Systems Based on Time-Abstracting Bisimulation
CAV '96 Proceedings of the 8th International Conference on Computer Aided Verification
Supervisory Control of Dense Real-Time Discrete-Event Systems with Partial Observation
WODES '02 Proceedings of the Sixth International Workshop on Discrete Event Systems (WODES'02)
| Hi-index | 0.00 |
Discrete events systems (DES) are defined by the sequences of events they can execute. For example, communication protocols and computer networks can be seen as DES. Finite state automata (FSA) are convenient for studying (i.e., analyzing, designing) DES, and timed automata (TA) are convenient for describing real-time DES. An approach for studying a real-time DES, has been to transform a TA describing the real-time DES into an equivalent FSA, and then to study the latter. We propose here a new transformation method of TA into FSA. The method is well suited for conformance testing and supervisory control of real-time DES.