Automatic Real-Time Analysis of Reactive Systems with the PARTS Toolset
Automated Software Engineering
A logical characterization of data languages
Information Processing Letters
A notion of non-interference for timed automata
Fundamenta Informaticae
Theoretical Computer Science
Efficient Real-Time Model Checking Using Tabled Logic Programming and Constraints
ICLP '02 Proceedings of the 18th International Conference on Logic Programming
A New Numerical Abstract Domain Based on Difference-Bound Matrices
PADO '01 Proceedings of the Second Symposium on Programs as Data Objects
STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
Linear Parametric Model Checking of Timed Automata
TACAS 2001 Proceedings of the 7th International Conference on Tools and Algorithms for the Construction and Analysis of Systems
Improving the Verification of Timed Systems Using Influence Information
TACAS '02 Proceedings of the 8th International Conference on Tools and Algorithms for the Construction and Analysis of Systems
On Presburger Liveness of Discrete Timed Automata
STACS '01 Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science
Timed Verification of Asynchronous Circuits
Concurrency and Hardware Design, Advances in Petri Nets
Binary Reachability Analysis of Pushdown Timed Automata with Dense Clocks
CAV '01 Proceedings of the 13th International Conference on Computer Aided Verification
Automatic Verification of Real-Time Systems with Discrete Probability Distributions
ARTS '99 Proceedings of the 5th International AMAST Workshop on Formal Methods for Real-Time and Probabilistic Systems
Parametric real-time model checking using splitting trees
Nordic Journal of Computing
Handbook of automated reasoning
Verification in loosely synchronous queue-connected discrete timed automata
Theoretical Computer Science
Presburger liveness verification of discrete timed automata
Theoretical Computer Science
Pushdown timed automata: a binary reachability characterization and safety verification
Theoretical Computer Science
A decidable notion of timed non-interference
Fundamenta Informaticae - Concurrency specification and programming
Checking reachability properties for timed automata via SAT
Fundamenta Informaticae - Concurrency specification and programming
Forward Analysis of Updatable Timed Automata
Formal Methods in System Design
Model-based run-time monitoring of end-to-end deadlines
Proceedings of the 5th ACM international conference on Embedded software
The coarsest congruence for timed automata with deadlines contained in bisimulation
CONCUR 2005 - Concurrency Theory
A control synthesis approach for time discrete event systems
Mathematics and Computers in Simulation - Special issue: Computational engineering in systems applications (CESA 2003)
Logic and stochastic modeling with SMART
Performance Evaluation - Modelling techniques and tools for computer performance evaluation
Higher-Order and Symbolic Computation
Timed Automata with non-Instantaneous Actions
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P'2000)
Improvements in SAT-based Reachability Analysis for Timed Automata
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P 2003)
Automatic generation of path conditions for concurrent timed systems
Theoretical Computer Science
Robust safety of timed automata
Formal Methods in System Design
QoSA '09 Proceedings of the 5th International Conference on the Quality of Software Architectures: Architectures for Adaptive Software Systems
Formal Verification of the Quasi-Static Behavior of Mixed-Signal Circuits by Property Checking
Electronic Notes in Theoretical Computer Science (ENTCS)
A control synthesis approach for time discrete event systems
Mathematics and Computers in Simulation
Distributed time-asynchronous automata
ICTAC'07 Proceedings of the 4th international conference on Theoretical aspects of computing
Hypervolume approximation in timed automata model checking
FORMATS'07 Proceedings of the 5th international conference on Formal modeling and analysis of timed systems
Dynamical properties of timed automata revisited
FORMATS'07 Proceedings of the 5th international conference on Formal modeling and analysis of timed systems
Formal verification of a group membership protocol using model checking
OTM'07 Proceedings of the 2007 OTM Confederated international conference on On the move to meaningful internet systems: CoopIS, DOA, ODBASE, GADA, and IS - Volume Part I
Learning of event-recording automata
Theoretical Computer Science
Towards validated real-time software
Euromicro-RTS'00 Proceedings of the 12th Euromicro conference on Real-time systems
SAT-based (parametric) reachability for a class of distributed time Petri nets
Transactions on Petri nets and other models of concurrency IV
Enabling parametric feasibility analysis in real-time calculus driven performance evaluation
CASES '11 Proceedings of the 14th international conference on Compilers, architectures and synthesis for embedded systems
Segmented state space traversal for conformance testing of cyber-physical systems
FORMATS'11 Proceedings of the 9th international conference on Formal modeling and analysis of timed systems
Model checking for timed statecharts
FORTE'05 Proceedings of the 25th IFIP WG 6.1 international conference on Formal Techniques for Networked and Distributed Systems
FATES'05 Proceedings of the 5th international conference on Formal Approaches to Software Testing
Generating path conditions for timed systems
IFM'05 Proceedings of the 5th international conference on Integrated Formal Methods
Flexible Plan Verification: Feasibility Results
Fundamenta Informaticae - RCRA 2009 Experimental Evaluation of Algorithms for Solving Problems with Combinatorial Explosion
Revising and extending the uppaal communication mechanism
SC'12 Proceedings of the 11th international conference on Software Composition
Improvements in SAT-based Reachability Analysis for Timed Automata
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P 2003)
A Decidable Notion of Timed Non-Interference
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P'2002), Part 1
Checking Reachability Properties for Timed Automata via SAT
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P'2002), Part 2
A Notion of Non-Interference for Timed Automata
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)
Proceedings of the tenth ACM international conference on Embedded software
ACM Computing Surveys (CSUR)
| Hi-index | 0.01 |