Filters








17,367 Hits in 1.8 sec

Composing Constraint Automata, State-by-State [chapter]

Sung-Shik T. Q. Jongmans, Tobias Kappé, Farhad Arbab
2016 Lecture Notes in Computer Science  
, and our compiler for Reo based on constraint automata.  ...  Combined with earlier research on constraint automata verification, these ingredients facilitate a correctness-by-construction approach to component-based software engineering-one of the hallmarks in Sifakis  ...  Aut is the universal set of constraint automata, ranged over by α. Figure 2 shows example cas.  ... 
doi:10.1007/978-3-319-28934-2_12 fatcat:gyfs24guxrc6blhnzu5hq7keku

A Formal Method for Specifying The Interface of Components in Real-time Concurrent Systems

Do Van Chieu
2015 Research and Development on Information and Communication Technology  
In addition, we propose a class of automata that can recognize a class of timed trace languages called timed concurrent interface automata.  ...  We propose a technique to specify the interaction protocols of component interfaces by the languages of timed words augmented with the concurrency, i.e. timed trace languages.  ...  ACKNOWLEDGMENT This work is supported by the project no. QG.13.01 granted by Vietnam National University, Hanoi (VNU).  ... 
doi:10.32913/mic-ict-research.v3.n12.317 fatcat:p4yjwyuvebba7fdrc7gukeq4yi

Towards verifiable deeply embedded systems

Terry Tidwell, Christopher Gill
2008 ACM SIGBED Review  
An important class of deeply embedded systems (DES) involves interlocking cyber-physical control loops, each with its own dynamics and correctness constraints.  ...  What is needed are platforms capable of precise monitoring and enforcement of diverse execution constraints, and techniques to verify system correctness.  ...  The system's scheduling semantics is specified as a set of constraints over the composed state space (i.e. precedence or other event ordering constraints, etc.).  ... 
doi:10.1145/1366283.1366287 fatcat:qyo6du2l6rh7lirgsenhvc7dta

Modeling and synthesis of service composition using tree automata

Ken Q. Pu, Ying Zhu
2008 2008 IEEE International Conference on Information Reuse and Integration  
In our framework, tree automata is used to express both type signature constraints of individual services as well as constraints on the order in which services must be invoked.  ...  Comparing to existing finite state machine and graph-based approaches to the problem of service composition, tree automata offers a more flexible and faithful modeling of multi-input services and their  ...  Modeling Services In this section, we describe by a running case study how tree automata are used to model services and their various constraints.  ... 
doi:10.1109/iri.2008.4583003 dblp:conf/iri/PuZ08 fatcat:q2tvmhlqpzhhjmre4ehjgmug6m

Brenda: Towards a Composition Framework for Non-orthogonal Non-functional Properties [chapter]

Mikaël Beauvois
2003 Lecture Notes in Computer Science  
Then, we study a new approach where compositions of non functional properties are compositions of components and automata and show how we have implemented these concepts in a composition framework.  ...  Scheduling constraint automata can only react to events coming from changes of the component automata that are impacted by the scheduling constraint.  ...  In the example, the first scheduling constraint (figure 2) between the decompress and log operations can be represented by an automaton with three states and two transitions.  ... 
doi:10.1007/978-3-540-40010-3_3 fatcat:ibso6n22f5ax5k27th5z7535pi

Decoupled execution of synchronous coordination models via behavioural automata

José Proença, Dave Clarke, Erik de Vink, Farhad Arbab
2011 Electronic Proceedings in Theoretical Computer Science  
Synchronous coordination systems allow the exchange of data by logically indivisible actions involving all coordinated entities.  ...  This paper introduces behavioural automata, a logically synchronous coordination model based on the Reo coordination language, which focuses on relevant aspects for the concurrent evolution of these systems  ...  We start by encoding the constraint automata semantics of Reo as behavioural automata.  ... 
doi:10.4204/eptcs.58.5 fatcat:smxr5yawofcyvne4eszs5uwsci

Constraint automata with memory cells and their composition

S.-S.T.Q. Jongmans, T. Kappé, F. Arbab
2017 Science of Computer Programming  
The "standard approach" [5] to this computation consists of composing local constraint automata one-after-the-other, thereby iteratively forming the global constraint automaton.  ...  Although inspired by our work on Reo, from this point onward, this paper is primarily about constraint automata w/mc.  ...  Related work The main inspiration for the state-by-state approach for composing constraint automata w/mc came from Proença's distributed Reo engine [37] .  ... 
doi:10.1016/j.scico.2017.03.006 fatcat:iyndmcz7obfajoa6f5yf64zhzu

Multi-Agent Systems: Modeling and Verification Using Hybrid Automata [chapter]

Ammar Mohammed, Ulrich Furbach
2010 Lecture Notes in Computer Science  
In turn, the resulting composed agent afterwards is checked by hybrid automata verification tools. Consequently, this composition process may lead to a state explosion problem.  ...  In turn, the composed automata are given to a model checker that checks the reachability of a certain state.  ... 
doi:10.1007/978-3-642-14843-9_4 fatcat:txbyuahum5a57k3tqi5hbzijia

Component Behavior Synthesis for Critical Systems, [chapter]

Tobias Eckardt, Stefan Henkler
2010 Lecture Notes in Computer Science  
For one component, separation of concerns is realized by defining the overall component functionality by separated protocol behaviors.  ...  We present an approach which addresses these problems by a well-defined automatic composition of protocol behaviors with respect to interdependent concerns.  ...  On this parallelly composed timed automaton the composition rules are applied, by removing the forbidden system states specified by the state composition rules and by including the specified event composition  ... 
doi:10.1007/978-3-642-13556-9_4 fatcat:ihuo6socgrfbzaylbawukr2zea

Formalizing Safety Requirements Using Controlling Automata [article]

Zhe Chen, Gilles Motet
2009 arXiv   pre-print
It explicitly separates the tasks of product engineers and safety engineers, and provides a top-down technique for modeling a system with safety constraints, and for automatically composing a safe system  ...  Most accidents involving software-intensive systems have been system accidents, which are caused by unsafe inter-system or inter-component interactions.  ...  The composition of two interface automata A, B is obtained by restricting the product of the two automata to the set Cmp(A, B) of compatible states, which are the states from which there exists a legal  ... 
arXiv:0905.2364v1 fatcat:7ja2hhk6nrfxzebypvo6b5y5sy

Composability of Infinite-State Activity Automata [chapter]

Zhe Dang, Oscar H. Ibarra, Jianwen Su
2004 Lecture Notes in Computer Science  
., Ar) of automata in M, is composable if for every string w = a1...an of symbols accepted by A, there is an assignment of each symbol in w to one of the Ai's such that if wi is the subsequence assigned  ...  Our results generalize earlier ones (and resolve some open questions) concerning composability of deterministic finite automata as e-services to finite automata that are augmented with unbounded storage  ...  change state to p and increment the counter by d where d = 0, + 1, − 1, with the constraint that if s = 0, then d = 0, + 1.  ... 
doi:10.1007/978-3-540-30551-4_34 fatcat:rsjvhw7sqvcnfgz7b7enc4fp4y

Decomposition of Constraint Automata [chapter]

Bahman Pourvatan, Marjan Sirjani, Farhad Arbab, Marcello M. Bonsangue
2012 Lecture Notes in Computer Science  
In this paper, we introduce complete constraint automata (CCA) whose extra information about entropy states helps in analyzing and decomposing them into Reo circuits.  ...  Constraint automata form a formal semantics for Reo connectors based on a co-algebraic model of streams.  ...  To define the inverse of constraint automata, we define Complete Constraint Automata (CCA) by adding extra information about the impossible events and states disallowed by the original constraint automata  ... 
doi:10.1007/978-3-642-27269-1_14 fatcat:tq6gfv4divfcpkzjjigwy62fme

System Safety Requirements as Control Structures

Zhe Chen, Gilles Motet
2009 2009 33rd Annual IEEE International Computer Software and Applications Conference  
It explicitly separates the tasks of product engineers and safety engineers, and provides a new top-down methodology for designing and modeling a system with safety constraints, and for automatically composing  ...  In this framework, functional requirements and safety requirements are separately formalized as interface automata and controlling automata respectively, as what we are doing in practice.  ...  The composition of two interface automata A, B is obtained by restricting the product of the two automata to the set Cmp(A, B) of compatible states, which are the states from which there exists a legal  ... 
doi:10.1109/compsac.2009.50 dblp:conf/compsac/ChenM09 fatcat:vjadpignvbe6zpeniryp7jxtt4

Compositional Semantics of an Actor-Based Language Using Constraint Automata [chapter]

Marjan Sirjani, Mohammad Mahdi Jaghoori, Christel Baier, Farhad Arbab
2006 Lecture Notes in Computer Science  
To this end, we consider reactive objects in Rebeca as components in Reo, and specify their behavior using constraint automata as black-box components within Reo circuits.  ...  Modeling coordination and communication among reactive objects as Reo circuits, and the behavior of reactive objects as constraint automata, provides a compositional semantics for Rebeca.  ...  We can subsequently compose the constraint automata of the rebecs with these constraint automata.  ... 
doi:10.1007/11767954_18 fatcat:bmfochvjrbduraadvilhxe42qi

Compiling Linguistic Constraints into Finite State Automata [chapter]

Matthieu Constant, Denis Maurel
2006 Lecture Notes in Computer Science  
We describe a unified method to compile sets of tables of linguistic constraints into Finite State Automata. This method has been practically implemented in the linguistic platform Unitex.  ...  This paper deals with linguistic constraints encoded in the form of (binary) tables, generally called lexicon-grammar tables.  ...  In this paper, we will describe a unified method to compile sets of tables of linguistic constraints into Finite State Automata.  ... 
doi:10.1007/11812128_23 fatcat:7smggfm7nja4bhwoi726mi7tc4
« Previous Showing results 1 — 15 out of 17,367 results