Automatic verification of finite-state concurrent systems using temporal logic specifications
ACM Transactions on Programming Languages and Systems (TOPLAS)
Three partition refinement algorithms
SIAM Journal on Computing
An improved protocol reachability analysis technique
Software—Practice & Experience
Introduction to algorithms
CCS expressions finite state processes, and three problems of equivalence
Information and Computation
Design and validation of computer protocols
Design and validation of computer protocols
Online minimization of transition systems (extended abstract)
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Minimal state graph generation
Science of Computer Programming
Minimum and maximum delay problems in real-time systems
Formal Methods in System Design - Special issue on computer-aided verification: special methods I
Communication and Concurrency
Automata For Modeling Real-Time Systems
ICALP '90 Proceedings of the 17th International Colloquium on Automata, Languages and Programming
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
Memory Efficient Algorithms for the Verification of Temporal Properties
CAV '90 Proceedings of the 2nd International Workshop on Computer Aided Verification
CAV '90 Proceedings of the 2nd International Workshop on Computer Aided Verification
Decidability of Bisimulation Equivalences for Parallel Timer Processes
CAV '92 Proceedings of the Fourth International Workshop on Computer Aided Verification
An Internet multicast system for the stock market
ACM Transactions on Computer Systems (TOCS)
STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
Forward Analysis of Updatable Timed Automata
Formal Methods in System Design
Folk theorems on the determinization and minimization of timed automata
Information Processing Letters
Multi-valued model checking in dense-time
ECSQARU'05 Proceedings of the 8th European conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty
Better Abstractions for Timed Automata
LICS '12 Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer Science
A machine-independent characterization of timed languages
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part II
On decidability of prebisimulation for timed automata
CAV'12 Proceedings of the 24th international conference on Computer Aided Verification
| Hi-index | 0.00 |
We address the problem of performing simultaneously reachabilityanalysis and minimization of real-time transition systems representedby timed automata, i.e., automata extended with afinite set of clock variables. The transitions of the automaton maydepend on the values of the clocks and may reset some of the clocks.An efficient algorithm is presented for minimizing a system withrespect to a given initial partition that respects the enablingconditions of the transitions of the timed automaton. Our algorithmgenerates the portion of the minimized system that is reachable froma given initial configuration in time polynomial in the input and thesize of the minimal reachable system.