Logic Based Abstractions of Real-Time Systems
Formal Methods in System Design
Characterizing Timed Net Processes Categorically
PaCT '01 Proceedings of the 6th International Conference on Parallel Computing Technologies
Is Your Model Checker on Time? On the Complexity of Model Checking for Timed Modal Logics
MFCS '99 Proceedings of the 24th International Symposium on Mathematical Foundations of Computer Science
On Presburger Liveness of Discrete Timed Automata
STACS '01 Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science
Timed Automata and the Theory of Real Numbers
CONCUR '99 Proceedings of the 10th International Conference on Concurrency Theory
A Decidable Fixpoint Logic for Time-Outs
CONCUR '02 Proceedings of the 13th International Conference on Concurrency Theory
Decidable Approximations on Generalized and Parameterized Discrete Timed Automata
COCOON '01 Proceedings of the 7th Annual International Conference on Computing and Combinatorics
Testing Hennessy-Milner Logic with Recursion
FoSSaCS '99 Proceedings of the Second International Conference on Foundations of Software Science and Computation Structure, Held as Part of the European Joint Conferences on the Theory and Practice of Software, ETAPS'99
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
CIAA '01 Revised Papers from the 6th International Conference on Implementation and Application of Automata
Formula Based Abstractions of Transition Systems for Real-Time Model Checking
FM '99 Proceedings of the Wold Congress on Formal Methods in the Development of Computing Systems-Volume I - Volume I
Binary Reachability Analysis of Pushdown Timed Automata with Dense Clocks
CAV '01 Proceedings of the 13th International Conference on Computer Aided Verification
On the Category of Event Structures with Dense Time
FCT '01 Proceedings of the 13th International Symposium on Fundamentals of Computation Theory
Generalized discrete timed automata: decidable approximations for safety verification
Theoretical Computer Science - Computing and combinatorics
Presburger liveness verification of discrete timed automata
Theoretical Computer Science
The power of reachability testing for timed automata
Theoretical Computer Science
Pushdown timed automata: a binary reachability characterization and safety verification
Theoretical Computer Science
Journal of Computer and System Sciences
Modal logics for timed control
CONCUR 2005 - Concurrency Theory
A new modality for almost everywhere properties in timed automata
CONCUR 2005 - Concurrency Theory
Open Maps and Observational Equivalences for Timed Partial Order Models
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P 2003)
Non-Interference Control Synthesis for Security Timed Automata
Electronic Notes in Theoretical Computer Science (ENTCS)
Electronic Notes in Theoretical Computer Science (ENTCS)
Teaching Concurrency: Theory in Practice
TFM '09 Proceedings of the 2nd International Conference on Teaching Formal Methods
A Classification of Time and/or Probability Dependent Security Properties
Electronic Notes in Theoretical Computer Science (ENTCS)
Timed control with observation based and stuttering invariant strategies
ATVA'07 Proceedings of the 5th international conference on Automated technology for verification and analysis
Efficient on-the-fly algorithms for partially observable timed games
FORMATS'07 Proceedings of the 5th international conference on Formal modeling and analysis of timed systems
Symbolic and compositional reachability for timed automata
RP'10 Proceedings of the 4th international conference on Reachability problems
Simulation and bisimulation for probabilistic timed automata
FORMATS'10 Proceedings of the 8th international conference on Formal modeling and analysis of timed systems
Timed Modal Logics for Real-Time Systems
Journal of Logic, Language and Information
Fault diagnosis using timed automata
FOSSACS'05 Proceedings of the 8th international conference on Foundations of Software Science and Computation Structures
Controller synthesis for MTL specifications
CONCUR'06 Proceedings of the 17th international conference on Concurrency Theory
Compositional and quantitative model checking (extended abstract)
PSI'09 Proceedings of the 7th international Andrei Ershov Memorial conference on Perspectives of Systems Informatics
Open Maps and Observational Equivalences for Timed Partial Order Models
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P 2003)
Bisimulation and Open Maps for Timed Transition Systems
Fundamenta Informaticae
| Hi-index | 0.00 |