3,754 Hits in 6.2 sec

From hybrid data-flow languages to hybrid automata

Peter Schrammel, Bertrand Jeannet
2012 Proceedings of the 15th ACM international conference on Hybrid Systems: Computation and Control - HSCC '12  
We describe a translation from a hybrid data-flow language to logiconumerical hybrid automata that points out this issue carefully.  ...  Indeed, in simulation languages the interaction between discrete and continuous execution steps is specified using the concept of zero-crossings, whereas hybrid automata exploit the notion of staying conditions  ...  Simulink for example uses a data-flow-based description of the behavior of continuous-and discrete-time variables; Stateflow extends it with the ability of automata-based specifications of the discrete-time  ... 
doi:10.1145/2185632.2185658 dblp:conf/hybrid/SchrammelJ12 fatcat:hzntgwmpizdczniasprtnnejre

A hybrid synchronous language with hierarchical automata

Albert Benveniste, Timothy Bourke, Benoît Caillaud, Marc Pouzet
2011 Proceedings of the ninth ACM international conference on Embedded software - EMSOFT '11  
The main novelty is a language with hierarchical automata that can be arbitrarily mixed with data-flow and ordinary differential equations (ODEs).  ...  It is critical to ensure that the results of simulation, compilation and verification are consistent. Synchronous languages have addressed these issues but only for discrete systems.  ...  The ultimate goal is to translate programs written in a hybrid data-flow language with automata into imperative code, i.e., to go from the top-left of Figure 1 to the bottom-right.  ... 
doi:10.1145/2038642.2038664 dblp:conf/emsoft/BenvenisteBCP11 fatcat:i2cc6mw2mraxbeq53cy6elokpq

Page 110 of Automation and Remote Control Vol. 35, Issue 12 [page]

1974 Automation and Remote Control  
to time and with respect to memory.  ...  Shipilina An automated system is described for the logical design of discrete automata, the system consisting of algorithms and programs for translation, syntax and semantics checking, standard implementa  ... 

Semantic Translation of Simulink/Stateflow Models to Hybrid Automata Using Graph Transformations

Aditya Agrawal, Gyula Simon, Gabor Karsai
2004 Electronical Notes in Theoretical Computer Science  
This paper describes a translation algorithm that converts a well-defined subset of the MSS modeling language into an equivalent hybrid automata.  ...  On the other hand verification techniques and tools do exist for models based on the notion of Hybrid Automata (HA) but there are no tools that can convert Simulink/Stateflow models into their semantically  ...  Yet another potential work could be to extend HSIF with the capability of representing sampled-data systems, and extend the translator to map the "discrete time" blocks in MSS into the corresponding HSIF  ... 
doi:10.1016/j.entcs.2004.02.055 fatcat:ybtpndiuubb7pfwkuv5slblqsq

Software Architecture of Modern Model Checkers [chapter]

Fabrice Kordon, Michael Leuschel, Jaco van de Pol, Yann Thierry-Mieg
2019 Lecture Notes in Computer Science  
An important design goal of modern model checkers is to support many input languages (front-end) and many verification strategies (back-end), and to allow arbitrary combinations of them.  ...  Automated formal verification using model checking is a mature field with many tools available. We summarize the recent trends in the design and architecture of model checking tools.  ...  We also thank Stefan Blom, Michael Weber, Elwin Pater for setting up the architecture of LTSmin and Alfons Laarman, Tom van Dijk, Jeroen Meijer for recent developments on multicore and symbolic LTSmin.  ... 
doi:10.1007/978-3-319-91908-9_20 fatcat:seh3tr6qdrf2lovprttf5msm2m

Page 4715 of Mathematical Reviews Vol. , Issue 84k [page]

1984 Mathematical Reviews  
While the first edition dealt only with the theory of finite automata, here we also give an introduction to the theory of context-free languages.  ...  Use of periodic rectangular functions for computing discrete Fourier transforms. Avtomat. i Vychisl. Tekhn. ( Riga) 1982, no. 2, 81-86 ( Russian); translated as Automat. Control Comput.  ... 

MATOU: An Implementation of Mode-Automata [chapter]

Florence Maraninchi, Yann Rémond, Yannick Raoul
2000 Lecture Notes in Computer Science  
The idea is to associate data-flow programs with the states of an automaton, representing modes.  ...  Mode-Automata have been proposed in [11] . They introduce, in the domain-specific data-flow language Lustre for reactive systems, a new construct devoted to the expression of running modes.  ...  In a data-flow language for reactive systems, both the inputs and outputs of the system are described by their flows of values along time. Time is discrete and instants may be numbered by integers.  ... 
doi:10.1007/3-540-46423-9_17 fatcat:prdvcdi5nrgbxporbewfgq6ttq

Compiling real time functional reactive programming

Dana N. Xu, Siau-Cheng Khoo
2002 Proceedings of the ASIAN symposium on Partial evaluation and semantics-based program manipulation - ASIA-PEPM '02  
The unique feature of this language is the highlevel abstraction provided in the form of behaviors for continuous-time signals, and events for discrete-time signals.  ...  The second stage attempts to compile the intermediate code to a corresponding automata code. Our main novelty is the use of two high-level transformation techniques for this compilation.  ...  ACKNOWLEDGMENT We would like to thank Wei-Ngan Chin and everyone residing in the Programming Language Laboratory of National University of Singapore for their valuable feedback through numerous discussions  ... 
doi:10.1145/568173.568183 dblp:conf/pepm/XuK02 fatcat:3k76ftr23bf6zmb5p2otdd4utq

If: An Intermediate Representation and Validation Environment for Timed Asynchronous Systems [chapter]

Marius Bozga, Jean-Claude Fernandez, Lucian Ghirvu, Susanne Graf, Jean-Pierre Krimm, Laurent Mounier
1999 Lecture Notes in Computer Science  
Being built upon a mathematically sound model (extended timed automata) it allows to properly evaluate different semantics for fdts, in particular with respect to time considerations.  ...  The benefits of using if are multiples. First, it is general enough to handle significant subsets of most fdts, and in particular a translation from sdl to if is already implemented.  ...  Notice that the discrete/dense interpretation of time does not influence the translation from IF to a timed automata.  ... 
doi:10.1007/3-540-48119-2_19 fatcat:nnhwqtlc6bb53nrfva7ickokfm

Automatic Verification of Real-Time Systems with Rich Data: An Overview [chapter]

Ernst-Rüdiger Olderog
2012 Lecture Notes in Computer Science  
of Timed Automata.  ...  , which advances the automatic verification of high-level specifications of systems exhibiting the three dimensions of process behavior, complex infinite data, and continuous real-time-beyond the capabilities  ...  This paper is a report of the work done in the project  ... 
doi:10.1007/978-3-642-29952-0_14 fatcat:tplffbonpngj7hsyxyhan5rm6m


Stanley Bak, Sergiy Bogomolov, Taylor T. Johnson
2015 Proceedings of the 18th International Conference on Hybrid Systems Computation and Control - HSCC '15  
Our evaluation demonstrates Hyst is capable of automatically translating benchmarks in several classes (including affine and nonlinear hybrid automata) to the input formats of several tools.  ...  Hyst is a source-to-source translation tool, currently taking input in the SpaceEx model format, and translating to the formats of HyCreate, Flow*, or dReach.  ...  Other recent languages include the HYbrid systems with Discrete Interaction (HyDI) language, which is an extension of the SMV input language [13] .  ... 
doi:10.1145/2728606.2728630 dblp:conf/hybrid/BakBJ15 fatcat:urdljbjf7ne7tahiuyn2jni5ta

On Implementable Timed Automata [chapter]

Sergio Feo-Arenis, Milan Vujinović, Bernd Westphal
2020 Lecture Notes in Computer Science  
We characterise a set of implementable timed automata models and provide a translation to a timed while language.  ...  Generating code from networks of timed automata is a wellresearched topic with many proposed approaches, which have in common that they not only generate code for the processes in the network, but necessarily  ...  For networks of implementable timed automata that do not depend on a global scheduler, we have given a translation scheme to a simple, exact-time programming language.  ... 
doi:10.1007/978-3-030-50086-3_5 fatcat:ctr33lseundhfjxlzn6t73rboa

Foreword to the special section on synchronous programming

Jean-Pierre Talpin
2013 Frontiers of Computer Science  
It appears in automata, in the discrete-time dynamical systems familiar to control engineers, and in synchronous digital logic familiar to hardware designers.  ...  Synchrony divides time into discrete instants. This model is pervasive in mathematics and engineering.  ... 
doi:10.1007/s11704-013-3905-5 fatcat:w3qx6kdphnd7jh2w67l4xqzkw4

The Impressive Power of Stopwatches [chapter]

Franck Cassez, Kim Larsen
2000 Lecture Notes in Computer Science  
In this paper we define and study the class of stopwatch automata which are timed automata augmented with stopwatches and unobservable behaviour.  ...  We report on preliminary experiments on analyzing translations of linear hybrid automata using a stopwatch-extension of the real-time verification tool UPPAAL.  ...  Acknowledgement The authors would like to thank Gerd Behrmann, Johan Bengtsson and Paul Pettersson for numerous discussions and assistance in making the stopwatchextension of UPPAAL.  ... 
doi:10.1007/3-540-44618-4_12 fatcat:phpkxtmhf5gfldcsqzoui7fxbe

Symbolic Model-Checking Using ITS-Tools [chapter]

Yann Thierry-Mieg
2015 Lecture Notes in Computer Science  
Using model transformations to a Guarded Action Language (GAL) as intermediate format, ITS-tools can analyze third party (Uppaal, Spin, Divine...) specifications.  ...  The ITS-tools is the result of many years of collaborative development with both colleagues and students at LIP6, without whom this tool presentation would not be possible.  ...  We applied this approach for the DVE language of DiVinE [5] , the Promela language of Spin [3] and the Timed Automata of Uppaal [4] (in Uppaal's native XTA syntax).  ... 
doi:10.1007/978-3-662-46681-0_20 fatcat:wuraebux5rguvm5k2gxdb2zpg4
« Previous Showing results 1 — 15 out of 3,754 results