L. Aceto, A. Inglfsdttir, M. L. Pedersen, and J. Poulsen, Characteristic formulae for timed automata, RAIRO, Theoretical Informatics and Applications, 34 (2000), pp. 565584. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Results on Event-Recording Logic - Sorea (2001) (Correct)
....timed automata are timed bisimilar is obtained. However, the technique presented by the authors produces formulas that are exponential in the size of the automaton. Therefore, checking timed bisimilarity for timed automata in this way is not practicable. Aceto, Ingolfsdottir, Pedersen, and Poulsen [AIPP00] present characteristic formula constructions for timed automata using L that yield formulas with size linear in the size of the timed automaton they characterize. Our approach for constructing characteristic formulas is similar to the one advocated in [AIPP00] One characteristic of the L ....
....Pedersen, and Poulsen [AIPP00] present characteristic formula constructions for timed automata using L that yield formulas with size linear in the size of the timed automaton they characterize. Our approach for constructing characteristic formulas is similar to the one advocated in [AIPP00]. One characteristic of the L logic is that the formulas usually include new clocks, which are not present in the timed automata model. Moreover, L includes an operator for introducing formula clocks. For example, the L formula (x in ) introduces a formula clock x and initializes it to 0. ....
[Article contains additional citation context not shown here]
Luca Aceto, Anna Ingolfsdottir, Mikkel Lykke Pedersen, and Jan Poulsen. Characteristic Formulae for Timed Automata. Technical Report RS-00-23, BRICS, September 2000.
Is your Model Checker on Time? - On the Complexity of Model .. - Aceto, Laroussinie (2001) Self-citation (Aceto) (Correct)
....problem for this logic is PSPACE complete using techniques from Mathematical Logic, and argues that QTL is as expressive as any of its rivals in the literature. Behavioural relations between timed automata and the relationship with timed logics (via characteristic formulae) are studied in [3]. This paper is an expanded version of [4] Apart from providing proofs of results that were announced ibidem, the current paper o ers several new developments. In particular, we point out that, amongst other things: we deal with the full timed calculus L we study the structural ....
L. Aceto, A. Inglfsdttir, M. L. Pedersen, and J. Poulsen, Characteristic formulae for timed automata, RAIRO, Theoretical Informatics and Applications, 34 (2000), pp. 565584.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC