An Efficient Algorithm for Minimizing Real-Time Transition Systems
Formal Methods in System Design - Special issue on computer aided verification (CAV 93)
Computing Accumulated Delays in Real-time Systems
Formal Methods in System Design - Special issue on computer aided verification (CAV 93)
Analysis of Timed Systems Using Time-Abstracting Bisimulations
Formal Methods in System Design
Timed Wp-Method: Testing Real-Time Systems
IEEE Transactions on Software Engineering
Model checking of systems with many identical timed processes
Theoretical Computer Science
Synthesizing distinguishing formulae for real time systems
Nordic Journal of Computing
Characterizing Timed Net Processes Categorically
PaCT '01 Proceedings of the 6th International Conference on Parallel Computing Technologies
Constraint Database Models Characterizing Timed Bisimilarity
PADL '01 Proceedings of the Third International Symposium on Practical Aspects of Declarative Languages
Decidability of Strong Bisimilarity for Timed BPP
CONCUR '02 Proceedings of the 13th International Conference on Concurrency Theory
The State Explosion Problem from Trace to Bisimulation Equivalence
FOSSACS '00 Proceedings of the Third International Conference on Foundations of Software Science and Computation Structures: Held as Part of the Joint European Conferences on Theory and Practice of Software,ETAPS 2000
A Proof System for Timed Automata
FOSSACS '00 Proceedings of the Third International Conference on Foundations of Software Science and Computation Structures: Held as Part of the Joint European Conferences on Theory and Practice of Software,ETAPS 2000
A Complete Axiomatisation for Timed Automata
FST TCS 2000 Proceedings of the 20th Conference on Foundations of Software Technology and Theoretical Computer Science
CAV '99 Proceedings of the 11th International Conference on Computer Aided Verification
Engineering of distributed control systems
Verification of duration systems using an approximation approach
Journal of Computer Science and Technology
General decidability theorems for infinite-state systems
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
The power of reachability testing for timed automata
Theoretical Computer Science
The coarsest congruence for timed automata with deadlines contained in bisimulation
CONCUR 2005 - Concurrency Theory
Decidability of performance equivalence for basic parallel processes
Theoretical Computer Science
Open Maps and Observational Equivalences for Timed Partial Order Models
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P 2003)
Observational Equivalences for Timed Stable Event Structures
Fundamenta Informaticae - SPECIAL ISSUE ON CONCURRENCY SPECIFICATION AND PROGRAMMING (CS&P 2005) Ruciane-Nide, Poland, 28-30 September 2005
Comparing the Expressiveness of Timed Automata and Timed Extensions of Petri Nets
FORMATS '08 Proceedings of the 6th international conference on Formal Modeling and Analysis of Timed Systems
Symbolic Branching Bisimulation-Checking of Dense-Time Systems in an Environment
HSCC '09 Proceedings of the 12th International Conference on Hybrid Systems: Computation and Control
Timed Delay Bisimulation is an Equivalence Relation for Timed Transition Systems
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)
Efficient on-the-fly Algorithm for Checking Alternating Timed Simulation
FORMATS '09 Proceedings of the 7th International Conference on Formal Modeling and Analysis of Timed Systems
A Classification of Time and/or Probability Dependent Security Properties
Electronic Notes in Theoretical Computer Science (ENTCS)
Symbolic simulation-checking of dense-time automata
FORMATS'07 Proceedings of the 5th international conference on Formal modeling and analysis of timed systems
Weak bisimulation for Probabilistic Timed Automata
Theoretical Computer Science
Simulation and bisimulation for probabilistic timed automata
FORMATS'10 Proceedings of the 8th international conference on Formal modeling and analysis of timed systems
Hardness of preorder checking for basic formalisms
LPAR'10 Proceedings of the 16th international conference on Logic for programming, artificial intelligence, and reasoning
Hardness of preorder checking for basic formalisms
Theoretical Computer Science
Quantifying similarities between timed systems
FORMATS'05 Proceedings of the Third international conference on Formal Modeling and Analysis of Timed Systems
Timed weak simulation verification and its application to stepwise refinement of real-time software
EUC'05 Proceedings of the 2005 international conference on Embedded and Ubiquitous Computing
Complexity bounds for the verification of real-time software
VMCAI'10 Proceedings of the 11th international conference on Verification, Model Checking, and Abstract Interpretation
Verification, performance analysis and controller synthesis for real-time systems
FSEN'09 Proceedings of the Third IPM international conference on Fundamentals of Software Engineering
Incremental verification of component-based timed systems
International Journal of Computer Applications in Technology
A categorical view of timed weak bisimulation
TAMC'10 Proceedings of the 7th annual conference on Theory and Applications of Models of Computation
Timed equivalences for timed event structures
PaCT'05 Proceedings of the 8th international conference on Parallel Computing Technologies
Test generation for duration systems
VECoS'07 Proceedings of the First international conference on Verification and Evaluation of Computer and Communication Systems
On decidability of prebisimulation for timed automata
CAV'12 Proceedings of the 24th international conference on Computer Aided Verification
Timed Delay Bisimulation is an Equivalence Relation for Timed Transition Systems
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)
Observational Equivalences for Timed Stable Event Structures
Fundamenta Informaticae - SPECIAL ISSUE ON CONCURRENCY SPECIFICATION AND PROGRAMMING (CS&P 2005) Ruciane-Nide, Poland, 28-30 September 2005
Open Maps and Observational Equivalences for Timed Partial Order Models
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P 2003)
Analysis of Timed Concurrent Models Based on Testing Equivalence
Fundamenta Informaticae
Bisimulation and Open Maps for Timed Transition Systems
Fundamenta Informaticae
A categorical observation of timed testing equivalence
PaCT'07 Proceedings of the 9th international conference on Parallel Computing Technologies
A test purpose-based approach for testing timed input output automata
Software Testing, Verification & Reliability
Hi-index | 0.00 |