Supervisory control of a class of discrete event processes
SIAM Journal on Control and Optimization
Theoretical Computer Science
Symbolic model checking for real-time systems
Information and Computation
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
Time-abstracted bisimulation: implicit specifications and decidability
Information and Computation
Characterization of the expressive power of silent transitions in timed automata
Fundamenta Informaticae
Analysis of Timed Systems Using Time-Abstracting Bisimulations
Formal Methods in System Design
Theoretical Computer Science
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
Deciding Properties of Timed Transition Models
IEEE Transactions on Parallel and Distributed Systems
Timed Wp-Method: Testing Real-Time Systems
IEEE Transactions on Software Engineering
Minimization of Timed Transition Systems
CONCUR '92 Proceedings of the Third International Conference on Concurrency Theory
Timing Assumptions and Verification of Finite-State Concurrent Systems
Proceedings of the International Workshop on Automatic Verification Methods for Finite State Systems
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
CAV '97 Proceedings of the 9th International Conference on Computer Aided Verification
CAV '99 Proceedings of the 11th International Conference on Computer Aided Verification
An Efficient Algorithm for Minimizing Real-time Transition Systems
CAV '93 Proceedings of the 5th International Conference on Computer Aided Verification
Logics and Models of Real Time: A Survey
Proceedings of the Real-Time: Theory in Practice, REX Workshop
Reducing the number of clock variables of timed automata
RTSS '96 Proceedings of the 17th IEEE Real-Time Systems Symposium
Timed Test Cases Generation Based on State Characterization Technique
RTSS '98 Proceedings of the IEEE Real-Time Systems Symposium
A Supervisory Control Method for Ensuring the Conformance of Real-Time Discrete Event Systems
Discrete Event Dynamic Systems
A scalable method for testing real-time systems
Software Quality Control
Complete Test Graph Synthesis For Symbolic Real-time Systems
Electronic Notes in Theoretical Computer Science (ENTCS)
A New Method for Transforming Timed Automata
Electronic Notes in Theoretical Computer Science (ENTCS)
Grid automata and supervisory control of dense real-time discrete event systems
Mathematics and Computers in Simulation
Automatica (Journal of IFAC)
| Hi-index | 0.00 |
Real-time discrete event systems are discrete event systems with timing constraints, and can be modeled by timed automata. The latter are convenient for modeling real-time discrete event systems. However, due to their infinite state space, timed automata are not suitable for studying real-time discrete event systems. On the other hand, finite state automata, as the name suggests, are convenient for modeling and studying non-real time discrete event systems. To take into account the advantages of finite state automata, an approach for studying real-time discrete event systems is to transform, by abstraction, the timed automata modeling them into finite state automata which describe the same behaviors. Then, studies are performed on the finite state automata model by adapting methods designed for non real-time discrete event systems. In this paper, we present a method for transforming timed automata into special finite state automata called Set-Exp automata. The method, called SetExp, models the passing of time as real events in two types: Set events which correspond to resets with programming of clocks, and Exp events which correspond to the expiration of clocks. These events allow to express the timing constraints as events order constraints. SetExp limits the state space explosion problem in comparison to other transformation methods of timed automata, notably when the magnitude of the constants used to express the timing constraints are high. Moreover, SetExp is suitable, for example, in supervisory control and conformance testing of real-time discrete event systems.