Communication and concurrency
Compiling Real-Time Specifications into Extended Automata
IEEE Transactions on Software Engineering - Special issue: specification and analysis of real-time systems
Communicating Real-Time State Machines
IEEE Transactions on Software Engineering - Special issue: specification and analysis of real-time systems
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
Real-time system analysis based on state-space exploration
Real-time system analysis based on state-space exploration
Deciding Properties of Timed Transition Models
IEEE Transactions on Parallel and Distributed Systems
Minimization of Timed Transition Systems
CONCUR '92 Proceedings of the Third International Conference on Concurrency Theory
An Efficient Algorithm for Minimizing Real-time Transition Systems
CAV '93 Proceedings of the 5th International Conference on Computer Aided Verification
A User Guide to HyTech
Distributed web-based simulation optimization
Proceedings of the 32nd conference on Winter simulation
Scheduler Modeling Based on the Controller Synthesis Paradigm
Real-Time Systems
Model and Algorithm for Efficient Verification of High-Assurance Properties of Real-Time Systems
IEEE Transactions on Knowledge and Data Engineering
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
From the Specification to the Scheduling of Time-Dependent 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
Towards Bounded Model Checking for the Universal Fragment of TCTL
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
Duration Properties over Real Time System Designs
IWSSD '00 Proceedings of the 10th International Workshop on Software Specification and Design
Reachability analysis for timed automata using partitioning algorithms
Fundamenta Informaticae - Concurrency specification and programming
Checking reachability properties for timed automata via SAT
Fundamenta Informaticae - Concurrency specification and programming
Bounded model checking for knowledge and real time
Proceedings of the fourth international joint conference on Autonomous agents and multiagent systems
Improvements in SAT-based Reachability Analysis for Timed Automata
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P 2003)
Bounded model checking for knowledge and real time
Artificial Intelligence
Symbolic model checking for temporal-epistemic logics
ACM SIGACT News
A New Method for Transforming Timed Automata
Electronic Notes in Theoretical Computer Science (ENTCS)
A logic for knowledge, correctness, and real time
CLIMA'04 Proceedings of the 5th international conference on Computational Logic in Multi-Agent Systems
Symbolic model checking for temporal-epistemic logic
Logic Programs, Norms and Action
Improvements in SAT-based Reachability Analysis for Timed Automata
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P 2003)
Reachability Analysis for Timed Automata Using Partitioning Algorithms
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P'2002), Part 2
Checking Reachability Properties for Timed Automata via SAT
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P'2002), Part 2
Hi-index | 0.00 |
State explosion is a well-known problem that impedes analysis and testing based on state-space exploration. This problem is particularly serious in real-time systems because unbounded time values cause the state space to be infinite. In this paper, we present an algorithm that produces a compact representation of reachable state space of a real-time system. The algorithm yields a small state space, but still retains enough timing information for analysis. To avoid the state explosion which can be caused by simply adding time values to states, our algorithm first uses history equivalence and transition bisimulation to collapse states into equivalent classes. In this approach, equivalent states have identical observable events although transitions into the states may happen at different times. The algorithm then augments the resultant state space with timing relations that describe time distances between transition executions. For example, the relation @(tr1) + 3 ≤ @(tr2) ≤ @(tr1) + 5 means that transition tr2 is taken 3 to 5 time units before transition tr2 is taken. This is used to analyze timing properties such as minimum and maximum time distances between events. To show the effectiveness of our algorithm, we have implemented the algorithm and are currently comparing it to other existing techniques which generate state space for real-time systems.