Alur R. and Dill D. [1990], Automata for modelling real{time systems, in `Proc. 17th Int. Conf. on Automata, Languages and Programming (ICALP '90)', Vol. 443 of LNCS, Springer, pp. 322-335. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
First 50 documents Next 50
Checking Reachability Properties for Timed Automata via SAT - Wozna, Penczek, Zbrzezny (2002) (Correct)
....main distinction with the above mentioned techniques. Timed automata have been de ned and investigated in many papers [ACD93,AD94,TY01] We adopt the de nition given in [ACD93] 3 Timed Automata In this section we brie y recall the concept of timed automata, which was introduced by Alur and Dill [AD90] Timed automata are extensions of nite state automata with constraints on timing behaviour. The underlying nite state automata are augmented with a set of real time variables, called clocks. We start with introducing some auxiliary notation. Hereafter, IN = f0; 1; 2; g denotes a set of the ....
R. Alur and D. Dill. Automata for modelling real-time systems. In Proc. of the International Colloquium on Automata, Languages and Programming (ICALP'90), volume 443 of LNCS, pages 322-335. Springer-Verlag, 1990.
Model Checking for the Concurrent Constraint Paradigm - Garcia (Correct)
.... CC77, CC92] in order to obtain an abstract version of the system which is nite and computationally treatable; another approach, that is mostly applied to timed automata, calculates a quotient of the in nite set of states obtaining an equivalent automata with a nite number of states (see [AD90] for details) The in nite state approaches can also be classi ed into two categories. Firstly, we have those approaches that work symbolically by exploring the in nite statespace. Some of these approaches de ne abstractions to construct a nite model of the system which can be automatically ....
R. Alur and D. L. Dill. Automata for modelling real-time systems. In M.S. Paterson, editor, Proceedings of the International Colloquium on Automata, Languages, and Programming, volume 443 of Lecture Notes in Computer Scienze, pages 322-335. Springer-Verlag, 1990.
Mixed Control/Data-Flow Representation For Modelling And.. - Varea (2002) (Correct)
....complex structures, but also for exploiting the existence of symmetry in scalar types. 2.2. 3 Automata Theoretic Aproaches The foundations for automata theoretic approaches [53, 89, 90] is that a temporal logics formula j can be viewed as an acceptor of infinite words over the alphabet S = 2 [2]. Thus, the language L j which contains the words accepted by j, is a w automaton construct of the model M , i.e. A M ,if and only if: L (A M L A j where A j is the w automaton constructed from the TL formula. This approach is useful for extending model checking into a infinite state ....
....domain post: array in control domain guard: boolean 05 if (en) then p [i] # pre[i] post [i] # Figure 4. 4: Algorithm for a DFN Control Transition For the sake of clarity, assume a transition( module instantiated as follows: t[1] transition(p,[3,1,0,2], 0,1,2,0] 1) This means that: t 1 = 1 , p 2 , p 4 W (p 1 , t 1 ) 3,W (p 2 , t 1 ) 1,W (p 4 , t 1 ) 2; t 1 . 2 , p 3 W (t 1 , p 2 ) 1,W (t 1 , p 3 ) 2 and No guard function exists (since 1 is the default value on the result of a guard( module) With regard ....
[Article contains additional citation context not shown here]
R. Alur and D.L. Dill. Automata for modelling real-time systems. In Proceedings of the 17 International Conference on Automata, Languages, and Programming, volume 443 of Lecture Notes in Computer Science, pages 322--335. SpringerVerlag, 1990.
Structure and Hierarchy in Real-Time Systems - Möller (2002) (Correct)
....interpretation, approximation of real time safety properties can be formulated in the have been formulated in this framework [WT94, DT98] An approach to approximate also liveness is presented in Chapter 7. Timed Automata Model. For model checking, the timed automata model of Alur and Dill [AD94] is most influential for this thesis. The language is basically an extension of finite state machines with additional real valued variables that represent clocks. Transitions can be guarded by Boolean expressions over these clocks and clocks can be reset when taking a transition. Properties of ....
....over time. See [BRJ99, Kob01b,Kob01a] for an more detailed exposition. The first object oriented modeling languages appeared between the mid 1970s and the late 1980, as methodologists started to experiment with new modeling concepts that were tailored for the new object oriented design paradigm. In 1994 there were around 50 di#erent object oriented modeling languages around [BRJ99] The standardization of modeling languages started out, as Grady Booch and James Rumbaugh collaborated within the company Rational and sought to join their development methods, Booch and OMT with the Unified Method ....
[Article contains additional citation context not shown here]
Rajeev Alur and David L. Dill. Automata for Modelling Real-Time Systems. Theoretical Computer Science, 126(2):183--236, April 1994. 14, 41
Model Checking - Clarke, Schlingloff (2000) (755 citations) (Correct)
No context found.
Alur R. and Dill D. [1990], Automata for modelling real{time systems, in `Proc. 17th Int. Conf. on Automata, Languages and Programming (ICALP '90)', Vol. 443 of LNCS, Springer, pp. 322-335.
Symbolic Bisimulation Checking and Decomposition of Real-Time.. - Nakata (1997) (Correct)
No context found.
Rajeev Alur and David Dill. Automata for modelling real-time systems. In M. S. Paterson, editor, Proc. of ICALP'90, volume 443 of Lecture Notes in Computer Science, pages 322--335. Springer-Verlag, 1990.
Towards a Notion of Distributed Time for Petri Nets.. - Nielsen, Sassone, Srba (Correct)
No context found.
R. Alur and D. Dill. Automata for Modelling Real-Time Systems. Theoretical Computer Science, 126(2):183236, 1994.
Towards a Notion of Distributed Time for Petri Nets.. - Nielsen, Sassone, Srba (Correct)
No context found.
R. Alur and D. Dill. Automata for modelling real-time systems. In Proc. of Int. Colloquium on Algorithms, Languages and Programming, volume 443 of LNCS, pages 322335, 1990.
Minimization Algorithms for Time Petri Nets - Polrola, Penczek (2003) (Correct)
No context found.
R. Alur and D. Dill. Automata for modelling real-time systems. In Proc. of the Int. Colloquium on Automata, Languages and Programming (ICALP'90), volume 443 of LNCS, pages 322-335. Springer-Verlag, 1990.
A Formal Approach to Analysis of Software Architectures for.. - Wall (2000) (2 citations) (Correct)
No context found.
R. Alur and D. Dill. Automata for modelling real-time systems. In Proceedings of ICALP'90, volume 443 of Lecture Notes in Computer Science. Springer, 1990.
Deciding Monotonic Games - Abdulla, Bouajjani, d'Orso (2003) (4 citations) (Correct)
No context found.
R. Alur and D. Dill. Automata for modelling real-time systems. In Proc. ICALP '90, volume 443 of Lecture Notes in Computer Science, pages 322{ 335, 1990.
When the Minimal Number of Clocks is Computable - Adélaďde, Pagetti (2004) (Correct)
No context found.
R. Alur and D. Dill. Automata for modelling real-time systems. In 17 International Conference on Automata, Languages, and Programming, volume 443 of Lecture Notes in Computer Science, pages 322335. SpringerVerlag, 1990.
To Store or Not To Store - Behrmann, Larsen, Pelánek (2003) (2 citations) (Correct)
No context found.
R. Alur and D. Dill. Automata for Modelling Real-Time Systems. Theoretical Computer Science, 126(2):183-236, April 1994.
Timed Automata as Task Models for Event-Driven Systems - Christer Norstrom And (1999) (1 citation) (Correct)
No context found.
R. Alur and D. Dill. Automata for modelling real-time systems. In Proceedings of ICALP'90, volume 443 of Lecture Notes in Computer Science. Springer, 1990.
Studies in Computer Aided Verification of Protocols - Griffioen (2000) (Correct)
No context found.
Rajeev Alur and David Dill. Automata for Modelling Real-Time Systems. In Proc. of Int. Colloquium on Algorithms, Languages and Programming, number 443 in Lecture Notes in Computer Science, pages 322--335, July 1990.
Decidability and Complexity Issues for Infinite-State Processes - Srba (2003) (Correct)
No context found.
R. Alur and D. Dill. Automata for Modelling Real-Time Systems. Theoretical Computer Science, 126(2):183--236, 1994.
Decidability and Complexity Issues for Infinite-State Processes - Srba (2003) (Correct)
No context found.
R. Alur and D. Dill. Automata for modelling real-time systems. In Proceedings of the 17th International Colloquium on Algorithms, Languages and Programming (ICALP'90), volume 443 of LNCS, pages 322--335, 1990.
CANDLE: A High Level Language and Development.. - Kendall, Bradley.. (1998) (Correct)
No context found.
R. Alur, C. Courcoubetis, and D. Dill. Automata for modelling real-time systems. In Proc. 17th ICALP, volume 443, pages 322--335, 1990.
bCANDLE: Formal Modelling and Analysis of CAN Control.. - Kendall, Bradley.. (1998) (1 citation) (Correct)
No context found.
R. Alur, C. Courcoubetis, and D. Dill. Automata for modelling real-time systems. In Proc. 17th ICALP, volume 443, pages 322--335, 1990.
Towards a Notion of Distributed Time for Petri Nets.. - Nielsen, Sassone, Srba (Correct)
No context found.
R. Alur and D. Dill. Automata for Modelling Real-Time Systems. Theoretical Computer Science, 126(2):183236, 1994.
Towards a Notion of Distributed Time for Petri Nets.. - Nielsen, Sassone, Srba (Correct)
No context found.
R. Alur and D. Dill. Automata for modelling real-time systems. In Proc. of Int. Colloquium on Algorithms, Languages and Programming, volume 443 of LNCS, pages 322335, 1990.
A Formal Basis for Tool-supported Simulation and.. - Kendall, Bradley.. (Correct)
No context found.
R. Alur, C. Courcoubetis, and D. Dill. Automata for modelling real-time systems. In Proc. 17th ICALP, volume 443, pages 322--335, 1990.
Automated Verification of an Audio Control Protocol.. - Bengtsson.. (2002) (Correct)
No context found.
Rajeev Alur and David Dill. Automata for Modelling Real-Time Systems. In Proc. of Int. Colloquium on Algorithms, Languages and Programming, number 443 in Lecture Notes in Computer Science, pages 322-335, July 1990.
Checking Reachability Properties for Timed Automata via SAT - Wozna, Zbrzezny, Penczek (2003) (Correct)
No context found.
R. Alur and D. Dill. Automata for modelling real-time systems. In Proc. of ICALP'90, vol. 443 of LNCS, pp. 322--335. Springer-Verlag, 1990.
Verics: A Tool for Verifying Timed Automata and.. - Dembinski.. (2003) (Correct)
No context found.
R. Alur and D. Dill. Automata for modelling real-time systems. In Proc. of the International Colloquium on Automata, Languages and Programming (ICALP'90), volume 443 of LNCS, pages 322-335. Springer-Verlag, 1990.
First 50 documents Next 50
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