Filters








2,954 Hits in 2.0 sec

Constraint automata with memory cells and their composition

S.-S.T.Q. Jongmans, T. Kappé, F. Arbab
2017 Science of Computer Programming  
Our extension is based on memory cells; a rigorous and formal presentation of constraint automata with memory cells (abbreviation: w/mc) as comprehensive as ours in this paper does not yet exist.  ...  The new material in this paper consists of a comprehensive presentation of constraint automata with memory cells.  ...  Extensions of constraint automata with memory cells include constraint automata with state memory, used in work of Pourvatan et al. and formalized in a categorical setting by Krause et al.  ... 
doi:10.1016/j.scico.2017.03.006 fatcat:iyndmcz7obfajoa6f5yf64zhzu

Compositional and behavior-preserving reconfiguration of component connectors in Reo

Christian Krause, Holger Giese, Erik de Vink
2013 Journal of Visual Languages and Computing  
We show that our connector model has a compositional semantics and lift structural reconfigurations to the semantical level.  ...  In this paper, we target the channel-based coordination language Reo and introduce a combined structural and behavioral model for graph-based component connectors in Reo.  ...  Constraint automata [2] and their extension with state memory [8, 18] come equipped with a parallel composition operator, which is a special case of the composition using pullbacks presented in this  ... 
doi:10.1016/j.jvlc.2012.09.002 fatcat:hxknyv6jbnfthfd52zd36pbr4e

Decomposition of Constraint Automata [chapter]

Bahman Pourvatan, Marjan Sirjani, Farhad Arbab, Marcello M. Bonsangue
2012 Lecture Notes in Computer Science  
This property helps to partition and decompose a constraint automaton, a process which can be utilized to synthesize Reo circuits from constraint automata, automatically.  ...  In this paper, we introduce complete constraint automata (CCA) whose extra information about entropy states helps in analyzing and decomposing them into Reo circuits.  ...  An extension of constraint automata with state memory(CASM) extends the language of data constraints to accommodate state memory cells.  ... 
doi:10.1007/978-3-642-27269-1_14 fatcat:tq6gfv4divfcpkzjjigwy62fme

Automated Analysis of Reo Circuits using Symbolic Execution

Bahman Pourvatan, Marjan Sirjani, Hossein Hojjat, Farhad Arbab
2009 Electronical Notes in Theoretical Computer Science  
We propose a technique for symbolic execution of Reo circuits using Constraint Automata and more specifically exploiting their data constraints.  ...  This technique enables us to obtain the relations among the data passing through different nodes in a circuit and also infer coordination patterns.  ...  In this example, x is the memory cell for FIFO1, y and z are memory cells for FIFO2, and m and n are memory cells for the Adder component.  ... 
doi:10.1016/j.entcs.2009.10.029 fatcat:hplrvzjmbzdu3jshlxdec7pfvy

Soft constraint automata with memory

Kasper Dokter, Fabio Gadducci, Benjamin Lion, Francesco Santini
2020 Journal of Logical and Algebraic Methods in Programming  
We furthermore revise automata operators, such as composition and hiding, providing examples on how such memory locations interact with preferences.  ...  We then equip automata with memory locations, that is, with an internal state to remember and update information from transition to transition.  ...  Section 3 introduces soft constraint automata with memory (SCAMs) and their interpretation as soft constraints.  ... 
doi:10.1016/j.jlamp.2020.100615 fatcat:sqjktjgcy5huxcmbq3xxhgxnea

Soft Constraint Automata with Memory [chapter]

Kasper Dokter, Fabio Gadducci, Francesco Santini
2018 Lecture Notes in Computer Science  
Then, we equip automata with memory cells, that is, with an internal state to remember and update information from transition to transition. Finally, we revise automata operators, as join and hiding.  ...  In this paper, we revise the notion of Soft Constraint Automata, where automata transitions are weighted and consequently each action is associated with a preference value.  ...  Definition 9 (Soft constraint automata with memory).  ... 
doi:10.1007/978-3-319-90089-6_6 fatcat:zwi6o7l4afbl3f3xb5wad62duq

Intentional Automata: A Context-Dependent Model for Component Connectors [chapter]

David Costa, Milad Niqui, Jan Rutten
2012 Lecture Notes in Computer Science  
[5] define a compositional calculus in the Bird and Meertens style where Reo-like context-dependent connectors can be modelled compositionally and show that their expressiveness permits to capture non-trivial  ...  We define three operations on intentional automata to model compositionally composite connectors [10, Section 4.3]): product, hiding, and internal transitions elimination.  ... 
doi:10.1007/978-3-642-29320-7_22 fatcat:3zmnvpwprvc6haeoiig4i2fz5y

Rabbit: A Tool for BDD-Based Verification of Real-Time Systems [chapter]

Dirk Beyer, Claus Lewerentz, Andreas Noack
2003 Lecture Notes in Computer Science  
The modeling language are timed automata extended with concepts for modular modeling. The tool provides reachability analysis and refinement checking, both implemented using the data structure BDD.  ...  This leads to a significant performance improvement compared to the tool RED and the BDD-based version of Kronos.  ...  We proved that for timed automata without strict clock constraints (i.e. without < and > in clock constraints), this integer semantics is equivalent to the usual, continuous semantics with respect to the  ... 
doi:10.1007/978-3-540-45069-6_13 fatcat:bx4a2m4rbjhuzpay2utblre64u

Formal Modeling and Conformance Validation for WS-CDL using Reo and CASM

Samira Tasharofi, Marjan Sirjani
2009 Electronical Notes in Theoretical Computer Science  
In this paper, we benefit from Reo and Constraint Automata with State Memory (CASM) to address this problem by providing a unified formalism for choreography and orchestration.  ...  WS-CDL is a choreography language that describes peer-to-peer collaborations of participants by defining their common and complementary observable behaviors from a global viewpoint.  ...  Definition 3.1 (Constraint Automata with State Memory for Choreography (CASM ch )).  ... 
doi:10.1016/j.entcs.2009.06.034 fatcat:roijdmfrerhepgwf6lqi37gn7a

Efficient Reachability Analysis and Refinement Checking of Timed Automata Using BDDs [chapter]

Dirk Beyer
2001 Lecture Notes in Computer Science  
We now define closed timed automata and their integer semantics. Clock constraints are allowed as invariants and guards of a timed automaton. Let X be a set of clocks.  ...  Formally, the set Φ(X) of clock constraints over X for closed timed automata is generated by ϕ := x ≤ c | x ≥ c | ϕ ∧ ϕ, with x ∈ X and c ∈ N.  ... 
doi:10.1007/3-540-44798-9_6 fatcat:y2awlz33szakzjfhd4scwhsdyi

Soft component automata: Composition, compilation, logic, and verification

Tobias Kappé, Benjamin Lion, Farhad Arbab, Carolyn Talcott
2019 Science of Computer Programming  
We extend linear temporal logic with two unary connectives that reflect the compositional structure of actions, and show that it is decidable whether all behaviors of a given automaton satisfy a formula  ...  The design of a complex system warrants a compositional methodology, i.e., composing simple components to obtain a system that meaningfully exhibits their collective behavior.  ...  Acknowledgements The authors would like to thank Vivek Nigam and the anonymous referees for their valuable feedback.  ... 
doi:10.1016/j.scico.2019.08.001 fatcat:w7yk633v2veovivyjsfpp6jeum

Polychronous automata and their use for formal validation of AADL models

Thierry Gautier, Clément Guy, Alexandre Honorat, Paul Le Guernic, Jean-Pierre Talpin, Loïc Besnard
2018 Frontiers of Computer Science  
This allows one to specify a wide range of control-related configurations, either reactive, or restrictive with respect to their control environment.  ...  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.  ...  A synchronized memory y := x cell c init x0 is defined by the composition of y := x default (y $ init x0) and yˆ= xˆ+ [c] .  ... 
doi:10.1007/s11704-017-6134-5 fatcat:ljbnqsduzveujn7vsbniztv3na

Polychronous Automata

Paul Le Guernic, Thierry Gautier, Jean-Pierre Talpin, Loic Besnard
2015 2015 International Symposium on Theoretical Aspects of Software Engineering  
This allows one to specify a wide range of control-related configurations, either reactive, or restrictive with respect to their control environment.  ...  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.  ...  A synchronized memory y := x cell c init x0 is defined by y := x default (y $ init x0) and y = x + [c] It defines y with the most recent value of x when x is present or c is present and true.  ... 
doi:10.1109/tase.2015.21 dblp:conf/tase/GuernicGTB15 fatcat:p2vvncvo4fdlvnk5dk2rmqnkje

Cellular automata as a paradigm for ecological modeling

P. Hogeweg
1988 Applied Mathematics and Computation  
We review cellular automata as a modeling formalism and discuss how it can be used for modeling (spatial) ecological processes.  ...  Finally we discuss some shortcomings of the cellular-automaton formalism and mention some extensions and generalizations which may remedy these shortcomings. 2. CELLULAR AUTOMATA 2.  ...  constraint.  ... 
doi:10.1016/0096-3003(88)90100-2 fatcat:pmvygh5pw5gc7ds6pry2revt7y

Connectors meet Choreographies [article]

Farhad Arbab and Luís Cruz-Filipe and Sung-Shik Jongmans and Fabrizio Montesi
2018 arXiv   pre-print
In CR, programmers specify the desired communications among processes using a choreography, and define how communications should be concretely animated by connectors given as constraint automata (e.g.,  ...  synchronous barriers and asynchronous multi-casts).  ...  , s 0 ∈ S is an initial state, and µ 0 is an initial memory snapshot mapping the memory cells in M to their initial content.  ... 
arXiv:1804.08976v1 fatcat:nryyelilpvhrdk342jupdk5k5m
« Previous Showing results 1 — 15 out of 2,954 results