A time abstraction method for efficient verification of communicating systems
DAC '94 Proceedings of the 31st annual Design Automation Conference
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
An Efficient Algorithm for Minimizing Real-Time Transition Systems
Formal Methods in System Design - Special issue on computer aided verification (CAV 93)
An Efficient State Space Generation for the Analysis of Real-Time Systems
IEEE Transactions on Software Engineering
Analysis of Timed Systems Using Time-Abstracting Bisimulations
Formal Methods in System Design
Specification and analysis of real-time systems with PARAGON
Annals of Software Engineering
Reduction of Timed Hybrid Systems
Discrete Event Dynamic Systems
Verification of timed automata based on similarity
Fundamenta Informaticae
Reduction and Refinement Strategies for Probabilistic Analysis
PAPM-PROBMIV '02 Proceedings of the Second Joint International Workshop on Process Algebra and Probabilistic Methods, Performance Modeling and Verification
Reachability Analysis of Probabilistic Systems by Successive Refinements
PAPM-PROBMIV '01 Proceedings of the Joint International Workshop on Process Algebra and Probabilistic Methods, Performance Modeling and Verification
Reduction and Refinement Strategies for Probabilistic Analysis
PAPM-PROBMIV '02 Proceedings of the Second Joint International Workshop on Process Algebra and Probabilistic Methods, Performance Modeling and Verification
Decomposition and Composition of Timed Automata
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
UPPAAL - Now, Next, and Future
MOVEP '00 Proceedings of the 4th Summer School on Modeling and Verification of Parallel Processes
STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
Accurate Widenings and Boundedness Properties of Timed Systems
PSI '02 Revised Papers from the 4th International Andrei Ershov Memorial Conference on Perspectives of System Informatics: Akademgorodok, Novosibirsk, Russia
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
Extending Timed Automaton and Real-Time Logic to Many-Valued Reasoning
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
CAV '99 Proceedings of the 11th International Conference on Computer Aided Verification
Automated Verification of Infinite State Concurrent Systems
PPAM '01 Proceedings of the th International Conference on Parallel Processing and Applied Mathematics-Revised Papers
Modeling and verification of parallel processes
Parametric real-time model checking using splitting trees
Nordic Journal of Computing
Formal Methods in System Design
Reachability analysis for timed automata using partitioning algorithms
Fundamenta Informaticae - Concurrency specification and programming
A technique to generate feasible tests for communications systems with multiple timers
IEEE/ACM Transactions on Networking (TON)
Parametric Analysis of Real-Time Embedded Systems with Abstract Approximation Interpretation
Proceedings of the 26th International Conference on Software Engineering
Checking Timed Büchi Automata Emptiness Efficiently
Formal Methods in System Design
Folk theorems on the determinization and minimization of timed automata
Information Processing Letters
Timed Automata with non-Instantaneous Actions
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P'2000)
Symbolic model checking for probabilistic timed automata
Information and Computation
Inclusion dynamics hybrid automata
Information and Computation
A New Method for Transforming Timed Automata
Electronic Notes in Theoretical Computer Science (ENTCS)
Automated incremental synthesis of timed automata
FMICS'06/PDMC'06 Proceedings of the 11th international workshop, FMICS 2006 and 5th international workshop, PDMC conference on Formal methods: Applications and technology
Static guard analysis in timed automata verification
TACAS'03 Proceedings of the 9th international conference on Tools and algorithms for the construction and analysis of systems
State class constructions for branching analysis of time Petri nets
TACAS'03 Proceedings of the 9th international conference on Tools and algorithms for the construction and analysis of systems
Model checking bounded prioritized time Petri nets
ATVA'07 Proceedings of the 5th international conference on Automated technology for verification and analysis
Automated model repair for distributed programs
ACM SIGACT News
Experience with RT-LOTOS, a temporal extension of the LOTOS formal description technique
Computer Communications
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
Reachability Analysis for Timed Automata Using Partitioning Algorithms
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P'2002), Part 2
Verification of Timed Automata Based on Similarity
Fundamenta Informaticae - Concurrency Specification and Programming Workshop (CS&P'2001)
Timed Automata with non-Instantaneous Actions
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P'2000)
Characterization of the Expressive Power of Silent Transitions in Timed Automata
Fundamenta Informaticae
Composition methods for constructing characteristic formulas for dense-time models
Programming and Computing Software
Model checking for probabilistic timed automata
Formal Methods in System Design
An introduction to Timed Sequential Machines
Simulation
| Hi-index | 0.00 |