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
Bounded Analysis and Decomposition for Behavioural Descriptions of Components
[chapter]
2006
Lecture Notes in Computer Science
Preserved Fulltext
In this paper, we propose the notions of bounded analysis and bounded decomposition. ...
Explicit behavioural interfaces are now accepted as a mandatory feature of components to address architectural analysis. ...
We would like to thank the reviewers for their useful comments and suggestions. ...
doi:10.1007/11768869_5
fatcat:rcfsnbesqfgn7ajpi2t6i57bya
Towards compositionality in execution time analysis
2015
ACM SIGBED Review
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.
For current processors, timing analysis is a complex task mainly due to interdependencies of the processors' features that affect the overall timing behaviour. ...
For hard real-time systems, timeliness of operations has to be guaranteed. Static timing analysis is therefore employed to compute upper bounds on the execution times of a program. ...
DFG as part of the Excellence Initiative of the German Federal and State Governments. ...
doi:10.1145/2752801.2752805
fatcat:xbcfcm4uvbcyth3bb3azkpah5q
Checking Asynchronously Communicating Components Using Symbolic Transition Systems
[chapter]
2004
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 2006; you can also visit the original URL.
The file type is application/pdf.
Explicit behavioural interface description languages (BIDLs, protocols) are now recognized as a mandatory feature of component languages in order to address component reuse, coordination, adaptation and ...
One future work is to study specific communication checking to help the design and analysis of such systems. We have yet some preliminary results about deadlock checking for STS. ...
Mailbox analysis is a valuable step in the design of components and architectures as mailbox boundedness may for example lead to automatic simplifications in the protocol and component descriptions. ...
doi:10.1007/978-3-540-30469-2_42
fatcat:xua2ebffprbnrihtxpinbsk52i
Improving the performance of high-level synthesis
1989
Microprocessing and Microprogramming
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 2007; you can also visit the original URL.
The file type is application/pdf.
We allow the designer to indicate a set of bindings between behaviour and structure in order to add some of the designer's knowledge to the design process. ...
Backtracking, together with preliminary oor-planning, is required for area-e cient designs. ...
Prebound Variables Procedural descriptions of the required behaviour contain a set of abstract variables. It is not obvious, how these should be bound to hardware registers and RAMs. ...
doi:10.1016/0165-6074(89)90078-1
fatcat:33o5wzqozvcotlt7yrjr4pizyq
On the exploitation of chaos to build reduced-order models
2003
Computer Methods in Applied Mechanics and 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.
In an example, it is shown that the modes for this particular behaviour are more representative of the system dynamics than any other set of modes extracted from a non-chaotic response. ...
The present study focuses on the model reduction of non-linear systems. The proper orthogonal decomposition is exploited to compute eigenmodes from time series of displacement. ...
For the sake of brevity, the complete mathematical description of the POD is not recalled here. The reader is referred to Ref. [20] for a detailed description. ...
doi:10.1016/s0045-7825(03)00206-8
fatcat:bd6hryikmjghboghc3qufockca
An algorithm for the synthesis of processor structures from behavioural specifications
1986
Microprocessing and Microprogramming
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.
This paper describes a method for the automatic generation of the internal structure of digital processors from a specification of the required behaviour. ...
These steps include a flexible expression decomposition, a statement scheduling phase, anew module selection method and optimizations of interconnections and instruction word length. ...
Therefore, there is a growing interest in methods for the synthesis of digital processors from a description of the required behaviour. ...
doi:10.1016/0165-6074(86)90052-9
fatcat:beb74h524va6dgri7qejg3jmay
An algorithm for the synthesis of processor structures from behavioural specifications
1986
Microprocessors and microsystems
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.
This paper describes a method for the automatic generation of the internal structure of digital processors from a specification of the required behaviour. ...
These steps include a flexible expression decomposition, a statement scheduling phase, anew module selection method and optimizations of interconnections and instruction word length. ...
Therefore, there is a growing interest in methods for the synthesis of digital processors from a description of the required behaviour. ...
doi:10.1016/0141-9331(86)90069-4
fatcat:nhikvbae2vgwjjcxqzr4hcg524
Microservice Ambients: An Architectural Meta-Modelling Approach for Microservice Granularity
2017
2017 IEEE International Conference on Software Architecture (ICSA)
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.
essentially support architecture description for microservices. ...
Additionally, we evaluate the expressiveness and effectiveness of microservice ambients using criteria from Architecture Description Language (ADL) classification frameworks since microservice ambients ...
Capturing granularity adaptation behaviour as a transactional set of decomposition/merging steps to facilitate runtime analysis is a novel contribution of this work. ...
doi:10.1109/icsa.2017.32
dblp:conf/icsa/HassanAB17
fatcat:oarhez4a25hnnlog2s7qu4rekm
Analysing Mailboxes of Asynchronous Communicating Components
[chapter]
2003
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 2004; you can also visit the original URL.
The file type is application/pdf.
We also present an algorithm devoted to an analysis of the dynamic behaviour of the system. ...
The dynamic behaviour of a component is represented as a structured symbolic transition system with mailboxes. ...
Fig. 1 . 1 The Bank Component and Its Dynamic Behaviour
Fig. 2 . 2 Decomposition of the Dynamic Behaviour of the Bank 2.3 The counter, the client and the company Components
Fig. 3 Fig. 3 . 33 represents ...
doi:10.1007/978-3-540-39964-3_89
fatcat:msktwxqsxjg5lkrnrfyi5fjdxm
Brain Complexity: Analysis, Models and Limits of Understanding
[chapter]
2009
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 2011; you can also visit the original URL.
The file type is application/pdf.
This paper reviews key features of the standard method applied to complexity in the cognitive and brain sciences, i.e. decompositional analysis. ...
Using Rosen's modeling relation, the scientific analysis method itself is made a subject of discussion. ...
Fig. 1 . 1 View on decompositional analysis of brain and behavior. See text for details. ...
doi:10.1007/978-3-642-02264-7_21
fatcat:vvndtzzkcbba5bevv4in6civt4
Low-dimensional representation of near-wall dynamics in shear flows, with implications to wall-models
2017
Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences
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.
Transfer behaviour and input-output analysis With the entries of the C-matrix established, we are now in a position to analyse the transfer behaviour of the subsystem ∂ ∂t R = DR + CU (4.1) that relates ...
The Using the triple decomposition, for example for the streamwise component, we can take advantage of the following relation uu −ū 2 =ũũ − u u (3.1) from which the necessary terms in the C-matrix can ...
doi:10.1098/rsta.2016.0082
pmid:28167578
fatcat:myliv577bnh6zjdnugkaa6ltdi
Right-Hand Side Dependent Bounds for GMRES Applied to Ill-Posed Problems
[chapter]
2014
IFIP Advances in Information and Communication Technology
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.
Our bounds depend on the eigenvalues of the coefficient matrix, the right-hand side vector and the nonnormality of the system. ...
The bounds show that GMRES residuals initially decrease, as residual components associated with large eigenvalues are reduced, after which semi-convergence can be expected because of the effects of small ...
KUK-C1-013-04, made by King Abdullah University of Science and Technology (KAUST). ...
doi:10.1007/978-3-662-45504-3_22
fatcat:4wkrpqjbi5hwbifmry4ql6nroq
Constructing Active Architectures in the ArchWare ADL
[article]
2010
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 2020; you can also visit the original URL.
The file type is application/pdf.
representation of system execution; a decomposition operator to break up and introspect on executing systems; and structural reflection for creating new components and binding them into running systems ...
Here we describe the facilities of the ArchWare architecture description language (ADL) for specifying active architectures. ...
[7] provides a formal basis for architectural refinement; C2 [8] supports the description of user interface systems; Wright [9] supports the specification and analysis of interactions and UniCon ...
arXiv:1006.4829v1
fatcat:dtlipfszf5gipcw2xpeg5tejoy
Investigating modularity in the analysis of process algebra models of biochemical systems
2010
Electronic Proceedings 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.
Other Versions
Unfortunately the dynamic behaviour of biochemical systems exhibits strong interdependencies between the components of the model making decomposed solution a difficult task. ...
In essence this means using the compositional structure to guide decomposed solution and analysis. ...
Bio-PEPA In this section we give a short description of Bio-PEPA, a language that has recently been developed for the modelling and analysis of biological systems. ...
doi:10.4204/eptcs.19.4
fatcat:agnnrbvn3nds7oihhka5dkr2mi
Using Rewriting to Synthesize Functional Languages to Digital Circuits
[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.
The presented term rewrite system is used in the compiler for CλaSH: a polymorphic, higher-order, functional hardware description language. ...
Using a term rewrite system, polymorphic and function-type binders can be completely eliminated from a circuit description given only minor, reasonable, restrictions on the input. ...
The simultaneous presence of all alternatives in a case decomposition, and all bindings in let-binding, has consequences for the sharing behaviour of expressions. ...
doi:10.1007/978-3-642-45340-3_2
fatcat:7s6ojzn5kne7hahlqecxtdjwga
« Previous
Showing results 1 — 15 out of 48,400 results