| Publication | Date of Publication | Type |
|---|
Synthesis in presence of dynamic links
Information and Computation | 2022-12-08 | Paper |
scientific article; zbMATH DE number 7561325 (Why is no real title available?)
| 2022-07-21 | Paper |
scientific article; zbMATH DE number 7533351 (Why is no real title available?)
| 2022-05-28 | Paper |
scientific article; zbMATH DE number 7455739 (Why is no real title available?)
| 2022-01-11 | Paper |
Revisiting reachability in polynomial interrupt timed automata
Information Processing Letters | 2021-12-14 | Paper |
Corrigendum to: ``Revisiting reachability in polynomial interrupt timed automata
Information Processing Letters | 2021-12-14 | Paper |
Polynomial interrupt timed automata: verification and expressiveness
Information and Computation | 2021-04-13 | Paper |
Proving convergence of self-stabilizing systems using first-order rewriting and regular languages
Distributed Computing | 2020-12-03 | Paper |
Probabilistic disclosure: maximisation vs. minimisation
| 2020-11-25 | Paper |
Parameterized synthesis for fragments of first-order logic over data words
| 2020-09-23 | Paper |
The complexity of diagnosability and opacity verification for Petri nets
Fundamenta Informaticae | 2018-10-02 | Paper |
The complexity of diagnosability and opacity verification for Petri nets
| 2018-08-20 | Paper |
Opacity for linear constraint Markov chains
Discrete Event Dynamic Systems | 2018-04-18 | Paper |
On the power of non-observable actions in timed automata
STACS 96 | 2017-11-16 | Paper |
Polynomial interrupt timed automata
| 2017-10-27 | Paper |
Formal verification of mobile robot protocols
Distributed Computing | 2017-06-22 | Paper |
Interrupt timed automata with auxiliary clocks and parameters
Fundamenta Informaticae | 2017-03-16 | Paper |
Quantifying opacity
Mathematical Structures in Computer Science | 2016-07-27 | Paper |
Channel synthesis for finite transducers
| 2016-07-26 | Paper |
Petri nets with time
Lecture Notes in Control and Information Sciences | 2015-01-29 | Paper |
An introduction to timed automata
Lecture Notes in Control and Information Sciences | 2015-01-29 | Paper |
Probabilistic opacity for Markov decision processes
Information Processing Letters | 2014-10-07 | Paper |
Parametric Interrupt Timed Automata
Lecture Notes in Computer Science | 2014-07-07 | Paper |
Channel synthesis revisited
Language and Automata Theory and Applications | 2014-03-31 | Paper |
Channel synthesis for finite transducers
International Journal of Foundations of Computer Science | 2013-06-06 | Paper |
The expressive power of time Petri nets
Theoretical Computer Science | 2013-03-27 | Paper |
Interrupt timed automata: verification and expressiveness
Formal Methods in System Design | 2012-09-27 | Paper |
Concurrent games on VASS with inhibition
Lecture Notes in Computer Science | 2012-09-25 | Paper |
Interrupt Timed Automata
Foundations of Software Science and Computational Structures | 2009-03-31 | Paper |
When are timed automata weakly timed bisimilar to time Petri nets?
Theoretical Computer Science | 2008-09-16 | Paper |
Timed Temporal Logics for Abstracting Transient States
Automated Technology for Verification and Analysis | 2008-09-04 | Paper |
Intersection of Regular Signal-Event (Timed) Languages
Lecture Notes in Computer Science | 2008-07-08 | Paper |
Refinements and Abstractions of Signal-Event (Timed) Languages
Lecture Notes in Computer Science | 2008-07-08 | Paper |
Timed substitutions for regular signal-event languages
Formal Methods in System Design | 2007-10-11 | Paper |
Formal Modeling and Analysis of Timed Systems
Lecture Notes in Computer Science | 2006-11-14 | Paper |
FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science
Lecture Notes in Computer Science | 2006-11-14 | Paper |
CONCUR 2005 – Concurrency Theory
Lecture Notes in Computer Science | 2006-11-01 | Paper |
Automated Technology for Verification and Analysis
Lecture Notes in Computer Science | 2006-10-10 | Paper |
scientific article; zbMATH DE number 2102698 (Why is no real title available?)
| 2004-09-24 | Paper |
A compared study of two correctness proofs for the standardized algorithm of ABR conformance
Formal Methods in System Design | 2003-07-01 | Paper |
scientific article; zbMATH DE number 1633145 (Why is no real title available?)
| 2001-08-12 | Paper |
scientific article; zbMATH DE number 1512608 (Why is no real title available?)
| 2001-01-17 | Paper |
Timed automata and additive clock constraints
Information Processing Letters | 2000-10-26 | Paper |
Accepting zeno words: A way toward timed refinements
Acta Informatica | 2000-10-10 | Paper |
scientific article; zbMATH DE number 1361123 (Why is no real title available?)
| 1999-12-20 | Paper |
scientific article; zbMATH DE number 1361474 (Why is no real title available?)
| 1999-11-10 | Paper |
scientific article; zbMATH DE number 1337733 (Why is no real title available?)
| 1999-09-16 | Paper |
Untiming timed languages
Information Processing Letters | 1997-02-27 | Paper |
Global serializability of concurrent programs
Theoretical Computer Science | 1994-04-05 | Paper |
scientific article; zbMATH DE number 4003546 (Why is no real title available?)
| 1987-01-01 | Paper |
Literal shuffle
Theoretical Computer Science | 1987-01-01 | Paper |
scientific article; zbMATH DE number 3974328 (Why is no real title available?)
| 1986-01-01 | Paper |
scientific article; zbMATH DE number 3978422 (Why is no real title available?)
| 1986-01-01 | Paper |
