A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Filters
Wind Turbine System: An Industrial Case Study in Formal Modeling and Verification
[chapter]
2014
Communications in Computer and Information Science
of the system. ...
One issue is related, for instance, to the expressiveness of the system artifacts, in view of the known limitations of rigorous verification, e.g. model-checking, of industrial systems. ...
Fig. 5 . 5 Timed automata modeling: (a) RT omega = RT in (b) RT in = RT out (c) Computation RT.
Fig. 6 . 6 Timed automata model for (event-triggered) ROTOR. ...
doi:10.1007/978-3-319-05416-2_15
fatcat:tmyqj5u77bekhbtc6o7rvecxwa
Correct Development of Embedded Systems
[chapter]
2004
Lecture Notes in Computer Science
This paper provides an overview on the approach of the IST OMEGA project for the development of correct software for embedded systems based on the use of UML as modelling language. ...
This work has been supported by the IST-2002-33522 OMEGA project -http://wwwomega.imag.fr ...
It takes into account the Omega realtime extensions and represents the UML model by a set of extended timed automata by abstracting a variable amount of attributes. ...
doi:10.1007/978-3-540-24769-2_21
fatcat:fvsqeoqndjbnbfnktiof35ytl4
Page 1914 of Mathematical Reviews Vol. , Issue 97C
[page]
1997
Mathematical Reviews
As a tool the authors introduce a new class of tree automata called reduction automata (RA). ...
In particular, a very nice discussion is presented about the non-computability of the algorithmic complexity of strings, and even more, almost all bits of the number Omega, i.e. the halting probability ...
Logic and Rational Languages of Words Indexed by Linear Orderings
2009
Theory of Computing Systems
We prove that every rational language of words indexed by linear orderings is definable in monadic second-order logic. ...
As a corollary we prove that the inclusion problem for rational languages of words indexed by countable linear orderings is decidable. ...
It would be interesting to determine which syntactic fragment of the monadic second-order theory captures rational languages. ...
doi:10.1007/s00224-009-9222-6
fatcat:ql4zjihwwfb4hc4fbppyqflqmu
A real-time profile for UML
2006
International Journal on Software Tools for Technology Transfer (STTT)
in the OMEGA-RT profile. ...
To this aim a concrete UML profile, called the OMEGA-RT profile, is defined, dedicated to real-time modelling by identifying a set of relevant concepts for real-time modelling which can be considered as ...
This tool represents UML specifications respecting the restrictions of the Omega profile by means of a dynamic set of communicating timed automata extended with data and actions, as they are defined by ...
doi:10.1007/s10009-005-0213-x
fatcat:v724pjfu5ff3vf245m7wvn33na
A real-time profile for UML
2006
International Journal on Software Tools for Technology Transfer (STTT)
in the OMEGA-RT profile. ...
To this aim a concrete UML profile, called the OMEGA-RT profile, is defined, dedicated to real-time modelling by identifying a set of relevant concepts for real-time modelling which can be considered as ...
This tool represents UML specifications respecting the restrictions of the Omega profile by means of a dynamic set of communicating timed automata extended with data and actions, as they are defined by ...
doi:10.1007/s10009-006-0219-z
fatcat:rti5lf726fganb4ztzfbokl7cm
Language Based Verification Tools for Functional Programs (Dagstuhl Seminar 16131)
2016
Dagstuhl Reports
This seminar brought diverse set of researchers together so that we could: compare the strengths and limitations of different approaches, discuss ways to unify the complementary advantages of different ...
This report documents the program and the outcomes of Dagstuhl Seminar 16131 "Language Based Verification Tools for Functional Programs". ...
omega-automata. ...
doi:10.4230/dagrep.6.3.59
dblp:journals/dagstuhl-reports/GaboardiJJW16
fatcat:zeqdceqvzrgplfdpsbt6deoi2i
Using Model-Driven Engineering to generate QoS Monitors from a formal specification
2006
2006 10th IEEE International Enterprise Distributed Object Computing Conference Workshops (EDOCW'06)
In the domain of soft real-time application design, the gap between component-specification models and the implementations often implies that the implementations cannot fully take advantage of the specification ...
At the validation level, the OMEGA project [1] provides formal methods to check the consistency of UML 2.0 models. The OMEGA approach deals with the specification level only. ...
It proposes a unified approach to design and to implement component based systems. ...
doi:10.1109/edocw.2006.74
dblp:conf/edoc/SaudraisBD06
fatcat:7vgbcezvbjavdhn5t6d7okly7a
SVERTS – Specification and Validation of Real-Time and Embedded Systems
[chapter]
2005
Lecture Notes in Computer Science
The main themes discussed at this years workshop concerned modeling of real-time features with the perspective of validation as well as some particular validation issues. ...
This paper presents an overview on the workshop on Specification and Validation of Real-time and embedded Systems that has taken place for the second time in association with the UML 2004 conference. ...
of timed automata [Yov97] . ...
doi:10.1007/978-3-540-31797-5_4
fatcat:a5mxsl5sw5buthatvzfexpradm
Validating timed UML models by simulation and verification
2005
International Journal on Software Tools for Technology Transfer (STTT)
With respect to language coverage, our approach takes into consideration most of the structural and behavioral characteristics of classes and their interplay. ...
We present in this paper a technique and a tool for validating operational UML models by simulation and verification of dynamic properties. ...
Introduction The Unified Modeling Language makes it possible to describe operational models of a system at various levels of abstraction corresponding to the different phases of development. ...
doi:10.1007/s10009-005-0205-x
fatcat:h3u2qdnj4rhhzgevkbcitupiiu
Extended Conscriptions Algebraically
[chapter]
2014
Lecture Notes in Computer Science
We give a new computation model which generalises extended conscriptions and apply the algebraic techniques for a unified treatment. ...
Conscriptions are a model of sequential computations with assumption/commitment specifications in which assumptions can refer to final states, not just to initial states. ...
-Can all of these models be captured by a unifying algebraic theory? ...
doi:10.1007/978-3-319-06251-8_9
fatcat:fdngyafptfemxjm5ro5s63fau4
Bounded Model Checking of ETL Cooperating with Finite and Looping Automata Connectives
2013
Journal of Applied Mathematics
Since such kind of temporal logic involves both finite and looping automata as connectives, all regular properties can be succinctly specified with it. ...
However, the expressiveness of LTL is rather limited, and some important properties cannot be captured by such logic. ...
Acknowledgments The authors thank the anonymous reviewers for their helpful comments on a previous version of this paper. ...
doi:10.1155/2013/462532
fatcat:62o6ezqlgrfinprbrbumysf7zu
From formal specifications to QoS monitors
2007
Journal of Object Technology
In the domain of soft real-time application design, the gap between componentspecification models and the implementations often implies that the implementations cannot fully take advantage of the specification ...
It proposes a unified approach to design and to implement component based systems. ...
At the validation level, the OMEGA project [1] provides formal methods to check the consistency of UML 2.0 models. The OMEGA approach deals with the specification level only. ...
doi:10.5381/jot.2007.6.11.a1
fatcat:gnichnd7pnhfhmxhuqivdmdg4e
A Verified and Compositional Translation of LTL to Deterministic Rabin Automata
2019
International Conference on Interactive Theorem Proving
We present a formalisation of the unified translation approach from linear temporal logic (LTL) to ω-automata from [19] . ...
for deterministic Rabin automata (DRA). ...
In the final tool, we combine the function ltl-to-draei with an unverified LTL parser and an unverified serialisation to the Hanoi Omega Automata format [3] , a text-based format for representing ω-automata ...
doi:10.4230/lipics.itp.2019.11
dblp:conf/itp/0001SS19
fatcat:zhsmqsspyfcd3f4uggptl3t7le
Learning automata and transducers: a categorical approach
[article]
2020
arXiv
pre-print
In this paper, we present a categorical approach to learning automata over words, in the sense of the L^*-algorithm of Angluin. ...
The generic nature of our algorithm is obtained by adopting an approach in which automata are simply functors from a particular category representing words to a "computation category". ...
The L * -algorithm turns out to be extremely robust, and has been extended to various other forms of automata (weighted automata over fields [6, 7] , nominal automata [19] , omega automata [4] , non-deterministic ...
arXiv:2010.13675v1
fatcat:rfp2n53675hndpox3mykfujq5y
« Previous
Showing results 1 — 15 out of 220 results