56 Hits in 2.7 sec

Büchi automata for modeling component connectors

Mohammad Izadi, Marcello Bonsangue, Dave Clarke
2010 Journal of Software and Systems Modeling  
It is shown that constraint automata can be recast into our proposed Büchi automata of records.  ...  In this paper, we propose another operational model of Reo based on Büchi automata in which port synchronization is modeled by records labeling the transitions, whereas context dependencies are stored  ...  In this paper we recast the theory of constraint automata into that of ordinary Büchi automata.  ... 
doi:10.1007/s10270-010-0152-1 fatcat:o7ez547sf5eljnwo6fl25qskfi

Model Checking of Component Connectors

Mohammad Izadi, Ali Movaghar, Farhad Arbab
2007 Computer Software and Applications Conference (COMPSAC) Proceedings of the IEEE International  
G G /.-, ()*+ {A,B},dA=dB Õ Õ {A} G G /.-, ()*+ AB Õ Õ A (a) (b) Recasting Constraint Automata into Büchi Automata Now we show that for every constraint automaton A over a name set N and a data set D  ...  Also, we present a method to recast this join operation using the standard product operator of Büchi automata.  ... 
doi:10.1109/compsac.2007.153 dblp:conf/compsac/IzadiMA07 fatcat:lysriwrovfalxdsge5jm7xxuvi

Three Lectures on Automatic Structures [article]

Bakhadyr Khoussainov, Mia Minnes
2008 arXiv   pre-print
We discuss variants of automatic structures related to several models of computation: word automata, tree automata, Buchi automata, and Rabin automata.  ...  Word automata process finite strings, tree automata process finite labeled trees, Buchi automata process infinite strings, and Rabin automata process infinite binary labeled trees.  ...  Büchi automata.  ... 
arXiv:0809.3430v1 fatcat:s5o3fh45bbf3dmo6ms3h6pjiia

Concurrent Software Architectures [chapter]

2005 Software Paradigms  
model checking and automata-theoretic model checking, respectively (Figure 2 .1).  ...  System specifications are typically expressed in some temporal logic or as automata, giving rise to two general approaches to model checking that are used in practice today [Clarke and Wing 96a]: temporal  ...  Büchi automata are transformed into Büchi processes for verification.  ... 
doi:10.1002/0471703567.ch18 fatcat:bmnxn3yffngxhgumtp2onr5mji

Multi-core Reachability for Timed Automata [chapter]

Andreas E. Dalsgaard, Alfons Laarman, Kim G. Larsen, Mads Chr. Olesen, Jaco van de Pol
2012 Lecture Notes in Computer Science  
Multicore Büchi Emptiness Checking for Timed Automata This chapter is based on the paper "Multi-Core Emptiness Checking of Timed Büchi Automata using Inclusion Abstraction" [66] .  ...  By recasting the cache analysis into our framework we gain the ability to give WCET guarantees, and gradually refine those guarantees by being more and more concrete with respect to the data-flow of the  ... 
doi:10.1007/978-3-642-33365-1_8 fatcat:qwhq3mr2bzfizm54xhsw7ddd5a

Run-Time Enforcement of Nonsafety Policies

Jay Ligatti, Lujo Bauer, David Walker
2009 ACM Transactions on Privacy and Security  
. · 19: 3 automata [Büchi 1962] (which are like regular deterministic finite automata except that they can have an infinite number of states, operate on infinite-length input strings, and accept inputs  ...  Computability Constraints on Execution Recognizers.  ...  automata using a particular variety of Büchi 19: 4 · Jay Ligatti et al.  ... 
doi:10.1145/1455526.1455532 fatcat:2sufnxfk7vgidiirl46suxq3wm

A Specification Language for Reo Connectors [chapter]

Alexandra Silva
2012 Lecture Notes in Computer Science  
Recent approaches to component-based software engineering employ coordinating connectors to compose components into software systems.  ...  In this paper, we study Reo automata from a coalgebraic perspective.  ...  Also, in [3] , only connectors which are not context dependent are taken into account (since they base their results on the constraint automata model).  ... 
doi:10.1007/978-3-642-29320-7_26 fatcat:cteut2ve2zfyxcrrsd6y6fescq

Synthesis of correct adaptors for protocol enhancement in component-based systems [article]

Marco Autili, Paola Inverardi, Massimo Tivoli, David Garlan
2015 arXiv   pre-print
Taking into account the specification of the system to be assembled and the specification of the protocol enhancements, our tool (called SYNTHESIS) automatically derives, in a compositional way, the glue  ...  ,j+m δ ] Figure 6 : 6 Büchi Automata of K ′′ 417 , K1[f 1 417 ][fenv] and K1[f 1 417 ][fenv] ..,j+m δ ] Pi and true K ′′ δ A hold then we can conclude that true ((K[f j,..  ...  This is done by integrating the interaction protocol into components.  ... 
arXiv:1504.07504v2 fatcat:lhh23lev6jdvdpwj6zgzm4gnui

B2M: A Semantic Based Tool for BLIF Hardware Descriptions [chapter]

David Basin, Stefan Friedrich, Sebastian Mödersheim
2002 Lecture Notes in Computer Science  
To decide S1S a similar procedure based on Büchi automata can be used. The decision problem for both logics is non-elementary [8] .  ...  Our use of them has a practical advantage: The MONA system supports predicate definitions and predicates are compiled individually, only once, into automata.  ... 
doi:10.1007/3-540-40922-x_7 fatcat:arhd7yprwvdt3ikb724mz3j27a

Some approximations in Model Checking and Testing [article]

M.C. Gaudel and R. Lassaigne and F. Magniez and M. de Rougemont
2013 arXiv   pre-print
The tester transform both transition systems and a specification (formula) into Büchi automata, and test their approximate equivalence efficiently.  ...  Technically, the algorithm translates an LTL formula into a generalized Büchi automaton using a depth-first search.  ... 
arXiv:1304.5199v1 fatcat:ytly2coo4jgfxerjndgyhm47gy

Towards a Graphical Tool for Refining User to System Requirements

Marco Autili, Patrizio Pelliccione
2008 Electronical Notes in Theoretical Computer Science  
We also presented an algorithm, called Psc2Ba, to translate PSC into Büchi automata 3 [3] .  ...  Differently from them we provide PSC with a precise semantics via translation, by means of an algorithm implemented as a plugin of our Charmy tool [4] , into Büchi automata.  ... 
doi:10.1016/j.entcs.2008.04.037 fatcat:uxlnhrdppfhazhq2zjr5hrh2ru

A computational guide to the dichotomy of features and constraints

Thomas Graf
2017 Glossa  
Building on recent work in mathematical linguistics, I argue that constraints and features are interchangeable in Minimalist syntax. This does not invalidate the feature-constraint debate, though.  ...  At the same time, the feature-constraint equivalence can be helpful in plugging this loophole.  ...  The translation hinges on a long-known equivalence between MSO formulas and bottom-up tree automata (Büchi 1960; Thatcher & Wright 1968; Doner 1970) .  ... 
doi:10.5334/gjgl.212 fatcat:yr5ydnr5qfhp3bqfwyinqpq7wa

Symbolic planning and control using game theory and grammatical inference

Jie Fu, Herbert G. Tanner, Jeffrey N. Heinz, Konstantinos Karydis, Jane Chandlee, Cesar Koirala
2015 Engineering applications of artificial intelligence  
Note that any learner for a class of regular languages can be converted into a normal-form learner by transforming its output grammars into canonical automata.  ...  Note that prefixes of ω-languages of deterministic Büchi automata form a regular languages (Perrin and Éric Pin, 2004) ; therefore, for the kinds of winning conditions and games considered in this paper  ...  This learning algorithm does not output finite-state automata, but sets of factors.  ... 
doi:10.1016/j.engappai.2014.09.020 fatcat:mlpippqnfbbsbjk3sawkpvtoii

A heuristic search approach to planning with temporally extended preferences

Jorge A. Baier, Fahiem Bacchus, Sheila A. McIlraith
2009 Artificial Intelligence  
Our technique involves converting a planning problem with TEPs into an equivalent planning problem containing only simple preferences.  ...  Because these works are recasting the problem into a different formalism, they explore a very different search space than our approach.  ...  In the rest of the section, we give some more details on the construction of automata and the way we embed these automata into a planning domain.  ... 
doi:10.1016/j.artint.2008.11.011 fatcat:hszstaywbrczrjvfpabq2an37e

The synchronous languages 12 years later

A. Benveniste, P. Caspi, S.A. Edwards, N. Halbwachs, P. Le Guernic, R. de Simone
2003 Proceedings of the IEEE  
The solution to the problem of the overly restrictive acyclic constraint came from recasting Esterel's semantics in a constructive framework.  ...  The product of automata is a familiar example: two automata must synchronize when performing a shared transition; this is a constraint.  ... 
doi:10.1109/jproc.2002.805826 fatcat:pdjbogxbovgvnc27ijgbch47aa
« Previous Showing results 1 — 15 out of 56 results