A logical characterization of data languages
Information Processing Letters
Expressiveness of Updatable Timed Automata
MFCS '00 Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science
Compilation and Synthesis for Real-Time Embedded Controllers
Correct System Design, Recent Insight and Advances, (to Hans Langmaack on the occasion of his retirement from his professorship at the University of Kiel)
A Framework for Decidable Metrical Logics
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
Decomposition and Composition of Timed Automata
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
An Algebraic Characterization of Data and Timed Languages
CONCUR '01 Proceedings of the 12th 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
A Logical Characterisation of Event Recording Automata
FTRTFT '00 Proceedings of the 6th International Symposium on Formal Techniques in Real-Time and Fault-Tolerant Systems
Product Interval Automata: A Subclass of Timed Automata
Proceedings of the 19th Conference on Foundations of Software Technology and Theoretical Computer Science
CIAA '01 Revised Papers from the 6th International Conference on Implementation and Application of Automata
CAV '99 Proceedings of the 11th International Conference on Computer Aided Verification
Binary Reachability Analysis of Pushdown Timed Automata with Dense Clocks
CAV '01 Proceedings of the 13th International Conference on Computer Aided Verification
CSL '99 Proceedings of the 13th International Workshop and 8th Annual Conference of the EACSL on Computer Science Logic
Generalized discrete timed automata: decidable approximations for safety verification
Theoretical Computer Science - Computing and combinatorics
A Kleene/Büchi-like theorem for clock languages
Journal of Automata, Languages and Combinatorics - Selected papers of the workshop on logic and algebra for concurrency
An algebraic approach to data languages and timed languages
Information and Computation
Presburger liveness verification of discrete timed automata
Theoretical Computer Science
Pushdown timed automata: a binary reachability characterization and safety verification
Theoretical Computer Science
Forward Analysis of Updatable Timed Automata
Formal Methods in System Design
Theoretical Computer Science
Timer formulas and decidable metric temporal logic
Information and Computation
A Scenario-Matching Approach to the Description and Model Checking of Real-Time Properties
IEEE Transactions on Software Engineering
Logics for Real Time: Decidability and Complexity
Fundamenta Informaticae - Continuous Time Paradigms in Logic and Automata
Synchronous Circuits over Continuous Time: Feedback Reliability and mpleteness
Fundamenta Informaticae - Continuous Time Paradigms in Logic and Automata
Temporal logics with incommensurable distances are undecidable
Information and Computation
Automated Verification of Dense-Time MTL Specifications Via Discrete-Time Approximation
FM '08 Proceedings of the 15th international symposium on Formal Methods
Some Recent Results in Metric Temporal Logic
FORMATS '08 Proceedings of the 6th international conference on Formal Modeling and Analysis of Timed Systems
Complexity of Metric Temporal Logics with Counting and the Pnueli Modalities
FORMATS '08 Proceedings of the 6th international conference on Formal Modeling and Analysis of Timed Systems
MTL with Bounded Variability: Decidability and Complexity
FORMATS '08 Proceedings of the 6th international conference on Formal Modeling and Analysis of Timed Systems
Information and Computation
Undecidability Results for Timed Automata with Silent Transitions
Fundamenta Informaticae
On Equivalences for a Class of Timed Regular Expressions
Electronic Notes in Theoretical Computer Science (ENTCS)
Inference of Timed Transition Systems
Electronic Notes in Theoretical Computer Science (ENTCS)
Timer formulas and decidable metric temporal logic
Information and Computation
Complexity of metric temporal logics with counting and the Pnueli modalities
Theoretical Computer Science
A Kleene-Schützenberger theorem for weighted timed automata
FOSSACS'08/ETAPS'08 Proceedings of the Theory and practice of software, 11th international conference on Foundations of software science and computational structures
Learning of event-recording automata
Theoretical Computer Science
Towards a theory of time-bounded verification
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming: Part II
From MTL to deterministic timed automata
FORMATS'10 Proceedings of the 8th international conference on Formal modeling and analysis of timed systems
MSO logics for weighted timed automata
Formal Methods in System Design
A succinct canonical register automaton model
ATVA'11 Proceedings of the 9th international conference on Automated technology for verification and analysis
Expressiveness of metric modalities for continuous time
CSR'06 Proceedings of the First international computer science conference on Theory and Applications
On metric temporal logic and faulty turing machines
FOSSACS'06 Proceedings of the 9th European joint conference on Foundations of Software Science and Computation Structures
A dose of timed logic, in guarded measure
FORMATS'06 Proceedings of the 4th international conference on Formal Modeling and Analysis of Timed Systems
On timed automata with discrete time – structural and language theoretical characterization
DLT'05 Proceedings of the 9th international conference on Developments in Language Theory
An expressive temporal logic for real time
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
Inference of event-recording automata using timed decision trees
CONCUR'06 Proceedings of the 17th international conference on Concurrency Theory
Continuous time temporal logic with counting
Information and Computation
Safety metric temporal logic is fully decidable
TACAS'06 Proceedings of the 12th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Undecidability Results for Timed Automata with Silent Transitions
Fundamenta Informaticae
Logics for Real Time: Decidability and Complexity
Fundamenta Informaticae - Continuous Time Paradigms in Logic and Automata
Synchronous Circuits over Continuous Time: Feedback Reliability and mpleteness
Fundamenta Informaticae - Continuous Time Paradigms in Logic and Automata
Characterization of the Expressive Power of Silent Transitions in Timed Automata
Fundamenta Informaticae
A succinct canonical register automaton model for data domains with binary relations
ATVA'12 Proceedings of the 10th international conference on Automated Technology for Verification and Analysis
Hi-index | 0.00 |