F. Maraninchi. Argonaute: Graphical Description, Semantics and Verification of Reactive Systems by using a Process Algebra. In Proceedings of the International Workshop on Automatic Verification Methods for Finite Systems. Lecture Notes in Computer Science, 407, June 1989.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....in a systematic, safe and fast way. In this article first the structure of the abstract system model is showed. Section 3 presents the automatic headlight leveling. The following sections describes the modeling of the application with the synchronous languages [1, 11] LUSTRE [8, 11] and ARGOS [21, 22]. Afterwards the toolbox Synchronie Workbench [27, 16] is used to realize the model. Included in these sections is a brief introduction of the languages and modeling techniques. In Section 5 the validation strategy is explained. Safety properties of the systems are specified with a temporal logic ....

....time of a program depends on the highest frequency of the inputs. On the other hand, a concrete implementation induces time constraints to the frequency of the inputs under which the implementation works in a defined way. More about synchronous programming can be found in [1] 4.1. ARGOS ARGOS [21, 22, 13] is a graphical formalism using hierarchical and parallel finite state machines. The language was developed at the IMAG Institut d Informatique et de Mathematique Appliquees de Grenoble. Nodes and edges are used in the usual way to describe the state machines. Edges are labeled with conditions and ....

F. Maraninchi. Argonaute, graphical description, semantics and verification of reactive systems by using a process algebra. In Workshop on Automatic Verification Methods for Finite State Systems, LNCS 407, Springer Verlag, Grenoble, jun 1989.

....programs. Hence the usefulness of the second synchrony hypothesis. Four languages are built upon this synchronous paradigm: they differ mostly in the programming style they offer. ESTEREL[7] is an imperative synchronous language. SIGNAL[6] and LUSTRE[11] are data flow languages. Finally in ARGOS[21], systems are specified with parallel and hierarchical automata. A summary of the synchronous approach can be found in [14] This paper presents the techniques used in the compilation of the SIGNAL language which is a data flow language. In this language, systems are specified with equations over ....

F. Maraninchi. Argonaute: graphical description, semantics and verification of reactive systems by using a process algebra. In J. Sifakis, editor, Automatic Verification Methods for Finite-state Systems, pages 38--53, Springer-Verlag, 1989. LNCS 407.

....durch Senden von global sichtbaren Signalen, die auch Daten tragen knnen. Dieses elementare Kommunikationsprinzip erlaubt auch die Implementierung anderer Kommunikationsarten wie etwa Datenaustausch ber Kanle oder gemeinsame Daten. Graphische synchrone Sprachen wie z.B. Statecharts [5] Argos [6] und SyncCharts [7] entstanden frh aus der Modellierung von endlichen Automaten. Im Gegensatz zu konventionellen endlichen Automaten knnen hier nebenlufige kommunizierende Automaten beschrieben werden, deren Zustnde selbst wieder Automaten enthalten knnen. Insbesondere Statecharts haben fr den ....

F. Maraninchi. Argonaute: graphical description, semantics and verification of reactive systems by using a process algebra. International Workshop on Automatic Verification Methods for Finite State Systems. Springer Verlag, LNCS 407, 1989.

....and it allows for both top down and bottom up development methodologies. The tool maintains an internal representation of systems as they are being created; this internal representation may then be manipulated by other tools in the system. In contrast with other graphical languages [Har87, Mar89] GCCS is designed to model systems in which processes execute asynchronously (although communication between processes is synchronous) The language is equipped with two semantics: one involving a translation into Milner s CCS [Mil89] and another in the form of a structural operational ....

F. Maraninchi. Argonaute, graphical description, semantics and verification of reactive systems by using a process algebra. In Proc. CAV '89, volume 407 of Lecture Notes in Computer Science, pages 38--53, Grenoble, June 1989. Springer-Verlag.

.... are labeled by unconditional differential equations, thus specifying behaviors combining discrete and continuous evolutions i.e. hybrid systems [26, 29] Another graphical language is Argos, belonging to the synchronous family, in a closer fashion than Statecharts, from which it is inspired [22]. It features the construction of automata, the possibility to encapsulate them inside a state of an upper level automaton, in a hierarchical way, and a parallel composition of automata. It does not feature suspension or history. In its present version, it supports the specification of the control ....

F. Maraninchi. Argonaute: graphical description, semantics and verification of reactive systems by using a process algebra. In Proceedings of the International Workshop on Automatic Verification Methods for Finite State Systems, Grenoble, France, LNCS n o 407, Springer, 1989. Sequencing data flow tasks in SIGNAL 45

....ready for a new computation. Hence, reactive systems must obey some real time constraints. Therefore, they are typically implemented by more than one threads. Synchronous languages [13] as Esterel [5, 6] PURR [17, 23] Reactive C [9] SML [10] Lustre [14] SIGNAL [12] Statecharts [15] Argos [19], and SyncCharts [3] have been developed as special purpose languages for the design of reactive systems. The perfect synchrony paradigm of these languages considers the computation of reactions to be infinitely fast, so that the reaction appears at the same point of time when the action requests ....

F. Maraninchi. Argonaute: graphical description, semantics and verification of reactive systems by using a process algebra. In International Workshop on Automatic Verification Methods for Finite State Systems. Springer Verlag, LNCS 407, 1989.

....systems, and it supports both top down and bottom up development methodologies. As user designs are entered using VTView, an internal representation is created by invoking the appropriate methods associated with process and network objects. In contrast with other graphical languages [Har87, Mar89] GCCS is designed to model systems in which processes execute asynchronously (although communication between processes is synchronous) The language is equipped with a formal semantics in the form of a structural operational semantics, a la Plotkin [Plo81] and [Mil89] The semantics has been ....

F. Maraninchi. Argonaute, graphical description, semantics and verification of reactive systems by using a process algebra. In Proc. CAV '89, volume 407 of Lecture Notes in Computer Science, pages 38--53, Grenoble, June 1989. Springer-Verlag.

....as well as hardware design for complex controllers to a large extent. There are different synchronous languages such as Esterel [2, 7] that represents an imperative synchronous language, Lustre [15] a synchronous dataflow language, and graphical synchronous languages such as statecharts [5] Argos [8] or SyncCharts [4] 1 This work has been partly financed by the DFG projects Automated System Design and Verification of Embedded Systems (see http: goethe.ira.uka.de for more information on the projects) In contrast to hardware description languages like VHDL or Verilog, these ....

F. MARANINCHI. Argonaute: graphical description, semantics and verification of reactive systems by using a process algebra. In International Workshop on Automatic Verification Methods for Finite State Systems (1989), Springer Verlag, LNCS 407.

....as well as hardware design for complex controllers to a large extent. There are different synchronous languages such as Esterel [2,7] that represents an imperative synchronous language, Lustre [15] a synchronous dataflow language, and graphical synchronous languages such as statecharts [5] Argos [8] or SyncCharts [4] In contrast to hardware description languages like VHDL or Verilog, these languages have been designed with the application of formal methods in mind. The result have been clear, readable languages with a clean and formal semantics. The statements are as orthogonal as possible ....

F. MARANINCHI. Argonaute: graphical description, semantics and verification of reactive systems by using a process algebra. In International Workshop on Automatic Verification Methods for Finite State Systems (1989), Springer Verlag, LNCS 407.

.... structured and thus a notion on hierarchy is naturally induced on transitions, one would expect that higher level transitions have a form of priority over lower level transitions, but again this is not the case (this inconvenience of the semantics of statecharts has been pointed out also in [12]) In this paper we show that, by extending the notion of reaction, the flexibility of the specification formalism can be improved and all the above mentioned drawbacks are overcome. We give the semantics in an operational style similar to that in [6] in order to easily compare the new model with ....

Maraninchi, F.: Argonaute: Graphical Description, Semantics and Verification of Reactive Systems by Using a Process Algebra, Lecture Notes in Computer Science 408, Springer, Berlin, 1990, pp. 38--53.

....systems which constitute the models of programs. Verification may be performed by reducing and comparing these models, modulo a given equivalence relation. This is not the case for Statecharts. However, the state transition paradigm is sometimes the most appropriate. We propose the Argos language [Mar89, Mar91a], which is a state transitionbased synchronous language, compiled into labeled transition systems, and to which existing verification methods and tools can be applied. A program is either an automaton, or an object of the form P 1 op P 2 , where P 1 and P 2 are programs and op is an operator. The ....

....i.e. if j is a congruence for the Argos operators: 8P 1 ; P 2 ; Q 2 P; P 1 jP 2 = P 1 op QjP 2 op Q . We use strong bisimulation as the relation. Structure of the Paper. Section 2 gives an informal description of the operators, using a graphical syntax. The reader should refer to [Mar89, Mar91a] for further details. Section 3 defines the language formally, and we prove the required properties of the operational semantics. Related work is summarized in section 4. Finally we conclude and give some hints about the complete Argos language and its programming environment in section 5. 3 a ....

F. Maraninchi. Argonaute, graphical description, semantics and verification of reactive systems by using a process algebra. In Workshop on Automatic Verification Methods for Finite State Systems, LNCS 407, Springer Verlag, june 1989.

....are compiled into labeled transition systems which constitute the models of programs. Verification may be performed by reducing and comparing these models, modulo a given equivalence relation, or by evaluating temporal logic formulas on these models. This paper presents the argos language [Mar89, Mar92], which is a state transition based synchronous language, compiled into labeled transition systems, and to which existing verification methods and tools can be applied. The semantics of argos allows modular development of programs. The main reason that allowed the development of a compositional ....

F. Maraninchi. Argonaute, graphical description, semantics and verification of reactive systems by using a process algebra. In Workshop on Automatic Verification Methods for Finite State Systems. LNCS 407, Springer Verlag, june 1989.

....real time process controllers or man machine interfaces contain a reactive kernel. Its behaviour can be described in a convenient manner by an automaton , for formal validation purposes. But, in general, complex systems cannot be described directly as automata. The Statecharts [4,5] and Argos [7,8] are automata based languages. The high level constructs of the language deal with states and transitions directly. A consequence of this choice is the graphical syntax, since the best representation of small automata is graphical. A consequence of this graphical syntax is the need for graphical ....

....a lot of work is being done on the topic of reactive systems, and there exist several languages for the description of such systems, together with programming environments. We are particularly interested in programming languages, like Esterel [1] Lustre [2] the Statecharts [4,5] or Argos [7,8], whose semantics rely more or less on the same model. This model is the notion of automaton, or labeled transition system, which is very well adapted to the representation of reactive behaviours. A system like the digital watch is described in a very convenient manner by seing the running modes ....

F. Maraninchi, Argonaute: Graphical Description, Semantics and Verification of Reactive Systems by Using a Process Algebra, Workshop on Automatic Verification methods for Finite State Systems, Grenoble 12-14 June 1989, Springer-Verlag, LNCS 407.

No context found.

F. Maraninchi. Argonaute: Graphical Description, Semantics and Verification of Reactive Systems by using a Process Algebra. In Proceedings of the International Workshop on Automatic Verification Methods for Finite Systems. Lecture Notes in Computer Science, 407, June 1989.

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