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
Polychronous Automata
2015
2015 International Symposium on Theoretical Aspects of Software Engineering
Preserved Fulltext
We propose a model of finite-state automata, called polychronous automata, which is based on clock relations. A specificity of this model is that an automaton is submitted to clock constraints. ...
In this relational model, the basic objects are signals, which are related through data-flow equations. ...
Signal regular event expressions are defined on a (finite) vocabulary made of the equivalence classes of event formulas. ...
doi:10.1109/tase.2015.21
dblp:conf/tase/GuernicGTB15
fatcat:p2vvncvo4fdlvnk5dk2rmqnkje
On the power of bounded concurrency I: finite automata
1994
Journal of the ACM
Preserved Fulltext
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.
Our results are couched in the general framework of finite-state automata, but hold for appropriate versions of most concurrent models of computation, such as Petri nets, statecharts or finite-state versions ...
For example, we prove exponential upper and lower bounds on the simulation of deterministic concurrent automata by AFAs, and triple-exponential bounds on the simulation of alternating concurrent automata ...
Our results are couched in the general framework of finite-state automata, but hold for appropriate versions of most concurrent models of computation, such as Petri nets, statecharts or finite-state versions ...
doi:10.1145/176584.176587
fatcat:jzmuron32radvigroj7jxtnl44
Buffer automata
2011
Proceedings of the 3rd ACM SIGCHI symposium on Engineering interactive computing systems - EICS '11
Preserved Fulltext
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.
We introduce an architectural software formalism, buffer automata, for the specification, implementation and analysis of a particular class of discrete interactive systems and devices. ...
Such systems are well suited to modelling as buffer automata. ...
A key example is Statecharts [8, 9] (see also the closely-related UML state diagrams), an automata-based visual formalism with a variety of features enabling the representation of many complex systems ...
doi:10.1145/1996461.1996497
dblp:conf/eics/ThimblebyGC11
fatcat:fnj4dvwt7fconjfwlnpkz7l37e
Semantics and Runtime Monitoring of TLCharts: Statechart Automata with Temporal Logic Conditioned Transitions
2005
Electronical Notes in Theoretical Computer Science
Preserved Fulltext
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.
We describe an automata-theoretic semantics for non-deterministic statecharts with negation and state overlapping and extend it to cater for temporally annotated transitions, thereby providing a simple ...
automata theoretic semantics for TLCharts. ...
We use the automata-theoryoriented notation where transitions are annotated with symbols from a finite input alphabet Σ. ...
doi:10.1016/j.entcs.2004.01.025
fatcat:srowwwkqlbcnrhfff35udmh27a
Formal Analysis of Publish-Subscribe Systems by Probabilistic Timed Automata
[chapter]
2007
Lecture Notes in Computer Science
Preserved Fulltext
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.
Application components are modeled by using statechart diagrams and then translated into probabilistic timed automata. The main elements of the approach are described through an example. ...
., the transmission channels and the publish-subscribe middleware) are modeled directly by means of probabilistic timed automata. ...
Application components are modeled with statechart diagrams, and we provide some easy clues for translating these diagrams to probabilistic timed automata. ...
doi:10.1007/978-3-540-73196-2_16
fatcat:omjedwkprbfippws4lx643vaga
Timed Automata Patterns
2008
IEEE Transactions on Software Engineering
Preserved Fulltext
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.
Specification languages like Timed Communicating Sequential Process (CSP) and Timed Communicating Object-Z (TCOZ) are well suited for presenting compositional models of complex real-time systems. ...
A number of automated analyzers for Timed Automata have been developed. However, Timed Automata lack composable patterns for high-level system design. ...
A closely related work is the hierarchical Timed Automata proposed in [11] . The notion of hierarchical Timed Automata in [11] is based the notion of Statechart. ...
doi:10.1109/tse.2008.52
fatcat:snutny5k45ebfexanzrvokqaqm
On the power of bounded concurrency II: The pushdown automata level
[chapter]
1990
Lecture Notes in Computer Science
Preserved Fulltext
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.
In this paper we deal with the level of pushdown automata. ...
While we use the language of statecharts to capture these features, our results are extremely robust, and hold also for bounded versions of virtually all other concurrent languages. tThis paper is based ...
[Ha2] as an extension of finite automata. ...
doi:10.1007/3-540-52590-4_37
fatcat:7p6xzwv375cx7au2ckmlojx2ae
Modal Scenarios as Automata
[chapter]
2014
Lecture Notes in Computer Science
Preserved Fulltext
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.
MSSs are essentially automata, in which the notion of temperature is adopted from LSCs, replacing traditional acceptance conditions. ...
In translating LSCs into automata over infinite words, an intermediate step constructs a kind of transition system that we call a modal state structure (MSS). ...
MSS and Büchi Automata A modal state structure (MSS) M is defined by M = Σ, S, s 0 , →, C, R , where Σ is a finite alphabet of events, S is a finite set of states, s 0 ∈ S is the initial state, → ⊆ S × ...
doi:10.1007/978-3-642-45321-2_7
fatcat:fgcxtbsnxzbrbmyfwm34ogzw2a
Applying Automata Learning to Embedded Control Software
[chapter]
2015
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2013; you can also visit the original URL.
The file type is application/pdf.
Our work provides a challenging benchmark for the automata learning and model-based testing communities. ...
To the best of our knowledge, this is the first paper in which active automata learning is applied to industrial embedded control software. ...
A Mealy machine is a tuple M = I, O, Q, q0, δ, λ , where • I is a finite set of input symbols, • O is a finite set of output symbols, • Q is a finite set of states, • q0 ∈ Q is an initial state, • δ : ...
doi:10.1007/978-3-319-25423-4_5
fatcat:bnv7epbjkrc3jddivf7cb3wni4
Polychronous mode automata
2006
Proceedings of the 6th ACM & IEEE International conference on Embedded software - EMSOFT '06
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
Our presentation features the formalization and use of model transformation techniques of the Gme environment to embed the extension of Polychrony's meta-model with mode automata. ...
In order to bring the modeling capability of Polychrony to the context of a model-driven engineering toolset for embedded system design, we define a diagramic notation composed of mode automata and data-flow ...
[3] , Statecharts [12] , or SyncCharts [1] . ...
doi:10.1145/1176887.1176900
dblp:conf/emsoft/TalpinBGG06
fatcat:tp7l5p374naw3pvdd4dpchpoz4
Automata Describing Object Behavior
[article]
2014
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
We will present an automata model together with a denotational and an operational semantics to describe the behavior of objects. ...
Nierstrasz uses finite automata in [N93] for typing objects. The automata are used to model which messages are accepted by an object in which states. ...
Therefore, in [R94] we used finite automata the transitions of which are labeled with executable program fragments and executable pre-and postconditions. ...
arXiv:1411.2408v1
fatcat:q7hxytbxcvaibm7wahbfayjfei
A Rice-style theorem for parallel automata
2009
Information and Computation
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
parallel automata, which we denote by CFAs (Concurrent Finite Automata). ...
We present a general result, similar to Rice's theorem, concerning the complexity of detecting properties on finite automata enriched by bounded cooperative concurrency, such as statecharts and abstract ...
Cooperative Finite Automata (denoted C-FAs) that are based on statecharts [10] , and had been defined in [3] , are closest to finite automata. ...
doi:10.1016/j.ic.2008.10.004
fatcat:uz2arfrs75cu5p7wlcf5ti5msa
Hybrid I/O automata
2003
Information and Computation
Preserved Fulltext
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.
Hybrid systems are systems that exhibit a combination of discrete and continuous behavior. ...
However, in general, they are allowed to change the state in more elaborate ways, including changing variables that represent physical quantities. ...
In [6, 33] , compositional trace-based semantics are presented for Statecharts-like languages that support hierarchical design of hybrid systems. ...
doi:10.1016/s0890-5401(03)00067-1
fatcat:7nibo6ry6vebpkkp3w52p5aukq
Learning Communicating Automata from MSCs
2010
IEEE Transactions on Software Engineering
Preserved Fulltext
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.
Communicating finite-state machines (CFMs), i.e., finite automata that communicate via FIFO buffers, act as system realizations. ...
Requirements are defined as basic message sequence charts (MSCs) specifying positive and negative scenarios. ...
An alphabet is a nonempty finite set whose elements are called actions. Finite sequences of actions are elements of Σ * and are called words. ...
doi:10.1109/tse.2009.89
fatcat:5mbmadir6rdaxp5nodnwp36o7m
Stateflow to Extended Finite Automata Translation
2011
2011 IEEE 35th Annual Computer Software and Applications Conference Workshops
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2012; you can also visit the original URL.
The file type is application/pdf.
In this paper, we present a systematic method, which translates Stateflow into a formal model, called Input/Output Extended Finite Automata (I/O-EFA). ...
CONCLUSION We presented a translation approach from Stateflow chart to Input/Output Extended Finite Automata (I/O-EFA). ...
In our previous work [1] , we introduced a recursive modeling method to translate Simulink diagram to Input/Output Extended Finite Automata (I/O-EFA), which is a formal model of a reactive untimed infinite ...
doi:10.1109/compsacw.2011.11
dblp:conf/compsac/LiK11
fatcat:y2quway5kveqri5ulchd7rc2cy
« Previous
Showing results 1 — 15 out of 1,348 results