default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID3. FORMATS 2005: Uppsala, Sweden
- Paul Pettersson
, Wang Yi:
Formal Modeling and Analysis of Timed Systems, Third International Conference, FORMATS 2005, Uppsala, Sweden, September 26-28, 2005, Proceedings. Lecture Notes in Computer Science 3829, Springer 2005, ISBN 3-540-30946-2
Invited Talk
- Lothar Thiele:
Modular Performance Analysis of Distributed Embedded Systems. 1
Logic and Specification
- Oded Maler, Dejan Nickovic, Amir Pnueli:
Real Time Temporal Logic: Past, Present, Future. 2-16 - Hongping Lim, Dilsun Kirli Kaynar, Nancy A. Lynch, Sayan Mitra:
Translating Timed I/O Automata Specifications for Theorem Proving in PVS. 17-31 - Atle Refsdal, Knut Eilif Husa, Ketil Stølen:
Specification and Refinement of Soft Real-Time Requirements Using Sequence Diagrams. 32-48
Times Games and Synthesis
- Thomas Brihaye, Véronique Bruyère, Jean-François Raskin:
On Optimal Timed Strategies. 49-64 - B. Thomas Adler, Luca de Alfaro, Marco Faella:
Average Reward Timed Games. 65-80 - Gerd Behrmann, Kim Guldstrand Larsen, Jacob Illum Rasmussen:
Beyond Liveness: Efficient Parameter Synthesis for Time Bounded Liveness. 81-94
Invited Talk
- Parosh Aziz Abdulla:
Verification of Parameterized Timed Systems. 95-97
Model Checking
- Martijn Hendriks:
Model Checking the Time to Reach Agreement. 98-111 - Patricia Bouyer, François Laroussinie, Pierre-Alain Reynier:
Diagonal Constraints in Timed Automata: Forward Analysis of Timed Systems. 112-126 - K. Subramani, Dejan Desovski:
A New Verification Procedure for Partially Clairvoyant Scheduling. 127-141
Invited Talk
- Karl-Erik Årzén:
Timing Analysis and Simulation Tools for Real-Time Control. 142-143
Hybrid Systems
- Laurent Doyen, Thomas A. Henzinger, Jean-François Raskin:
Automatic Rectangular Refinement of Affine Hybrid Systems. 144-161 - Raffaella Gentilini:
Reachability Problems on Extended O-Minimal Hybrid Automata. 162-176 - Husain Aljazzar, Holger Hermanns, Stefan Leue:
Counterexamples for Timed Probabilistic Reachability. 177-195
Petri Nets
- Thomas Chatain, Claude Jard:
Time Supervision of Concurrent Systems Using Symbolic Unfoldings of Time Petri Nets. 196-210 - Béatrice Bérard, Franck Cassez, Serge Haddad, Didier Lime, Olivier H. Roux:
Comparison of the Expressiveness of Timed Automata and Time Petri Nets. 211-225
Semantics
- Thomas A. Henzinger, Rupak Majumdar, Vinayak S. Prabhu:
Quantifying Similarities Between Timed Systems. 226-241 - Flavio Corradini, Walter Vogler:
Performance of Pipelined Asynchronous Systems. 242-257 - Wan J. Fokkink, Jun Pang, Anton Wijs:
Is Timed Branching Bisimilarity an Equivalence Indeed?. 258-272
Semantics and Modelling
- Karine Altisen, Stavros Tripakis:
Implementation of Timed Automata: An Issue of Semantics or Modeling? 273-288 - Roberto Giacobazzi, Isabella Mastroeni:
Timed Abstract Non-interference. 289-303
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-12-04 01:33 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
