Journal articles on the topic 'Specifications'
To see the other types of publications on this topic, follow the link: Specifications.
Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles
Consult the top 50 journal articles for your research on the topic 'Specifications.'
Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.
You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.
Browse journal articles on a wide variety of disciplines and organise your bibliography correctly.
1
NAKAMURA, M., W. KONG, K. OGATA, and K. FUTATSUGI. "A Specification Translation from Behavioral Specifications to Rewrite Specifications." IEICE Transactions on Information and Systems E91-D, no. 5 (May 1, 2008): 1492–503. http://dx.doi.org/10.1093/ietisy/e91-d.5.1492.
Full text
2
Easterling, W. Samuel, and Lisa Gonzalez Giroux. "Shear Lag Effects in Steel Tension Members." Engineering Journal 30, no. 3 (September 30, 1993): 77–89. http://dx.doi.org/10.62913/engj.v30i3.618.
Full textAbstract:
The non-uniform stress distribution that occurs in a tension member adjacent to a connection, in which all elements of the cross section are not directly connected, is commonly referred to as the shear lag effect. This effect reduces the design strength of the member because the entire cross section is not fully effective at the critical section location. Shear lag effects in bolted tension members have been accounted for in the American Institute of Steel Construction (AISC) allowable stress design specification1 (ASD) since 1978. The 1986 load and resistance factor design specification2 (LRFD) and the 1989 ASD specification stipulate that the shear lag effects are applicable to welded, as well as bolted, tension members. Past research on the subject of shear lag has focused primarily on bolted tension members. Recently, more attention has been given to welded members, evident by their inclusion in the AISC specifications. Shear lag provisions for welded members were introduced into the specifications primarily because of a large welded hanger plate failure. To maintain a uniform approach to both welded and bolted members, the same provisions for shear lag in bolted members were applied to welded members. Additional requirements for welded plates were added. However, the application of the shear lag requirements to welded members has raised several questions. This paper examines shear lag in steel tension members in the following context. First, the background for the current AISC specification provisions is reviewed. Second, the results of an experimental research program in which 27 welded tension members were loaded to failure is presented. Third, based on the first two parts of the paper, recommended changes to the AISC specifications are presented.
3
CORNELIUS, FELIX, MICHAEL BALDAMUS, HARTMUT EHRIG, and FERNANDO OREJAS. "Abstract and behaviour module specifications." Mathematical Structures in Computer Science 9, no. 1 (February 1999): 21–62. http://dx.doi.org/10.1017/s0960129598002606.
Full textAbstract:
The theory of algebraic module specifications and modular systems was developed initially mainly on the basis of equational algebraic specifications. We show that it is in fact almost independent of what kind of underlying specification framework is chosen. More specifically, we present a formulation where this framework appears as an indexed category or, equivalently, specification frame. The ensuing theory is called the theory of abstract module specifications. We are able to prove main results concerning the correctness and compositionality of abstract module specifications in a purely categorical way, assuming the existence of pushouts of morphisms between abstract specifications that allow model amalgamation, functor extension and/or suitable free constructions. Then, by instantiating the theory of abstract module specifications to the behaviour specification frame in the sense of Nivela and Orejas, we obtain a theory of behaviour module specifications.
4
Khazal, Ammar S., Nazar N. Ismael, and Adbulfattah Khalaf Husein. "Statistical Study to Check the Conformity of Aggregate in Kirkuk City to Requirement of Iraqi Specification." Tikrit Journal of Engineering Sciences 24, no. 2 (June 30, 2017): 11–27. http://dx.doi.org/10.25130/tjes.24.2.02.
Full textAbstract:
This research reviews a statistical study to check the conformity of aggregates (Coarseand Fine) was used in Kirkuk city to the requirements of the Iraqi specifications. The data ofsieve analysis (215 samples) of aggregates being obtained from of National CentralConstruction Laboratory and Technical College Construction Laboratory in Kirkuk city haveanalyzed using the statistical program SAS. The results showed that 5%, 17%, and 18% of fineaggregate samples are passing sieve sizes 10 mm, 4.75 mm, and 2.36 mm, respectively, whichwere less than the minimum limit allowed by the Iraqi specifications for each sieve. Thepercentages passing sieve sizes 1.18mm, 600micrometers, and 300micrometers were morethan the upper limit of specification by 5%, 20%, and 30% respectively. The samples werepassing sieve sizes 1.18mm, and 600micrometers less than the minimum limit of specificationby 17%, and 4%, respectively. The results showed that the deviation in a sieve size of 150micrometers for the upper limit of the specification performs 2% of the total number of samples.For Coarse aggregate, the samples passing sieves size 37.5mm and 20mm were comfortingthe Iraqi specifications by 100% and 83% respectively, it has found that the samples werepassing sieve sizes 10mm was 5% was more than the higher limit of Iraqi specifications, and27% of these samples were less than the minimum limit, whereas sample passing sieve size5mm was 1% which is more than the upper limit of the Iraqi specification. As a result ofstatistical analysis of data for fine aggregate, it has found that the samples were passing sievesizes 10mm, 2.36mm, 1.18mm and 150micrometers conforming from statistical point of view theIraqi specifications, whereas the samples were passing sieve sizes 4.75mm, 600micrometersand 300 micrometers didn’t conform. Statistical analysis of the results of the coarse aggregatesalso showed that conforming to sieve sizes of 37.5mm and 20mm and didn’t conform for sievesizes 10mm and 5mm.
5
ANTONIK, ADAM, MICHAEL HUTH, KIM G. LARSEN, ULRIK NYMAN, and ANDRZEJ WĄSOWSKI. "Modal and mixed specifications: key decision problems and their complexities." Mathematical Structures in Computer Science 20, no. 1 (February 2010): 75–103. http://dx.doi.org/10.1017/s0960129509990260.
Full textAbstract:
Modal and mixed transition systems are specification formalisms that allow the mixing of over- and under-approximation. We discuss three fundamental decision problems for such specifications: —whether a set of specifications has a common implementation;—whether an individual specification has an implementation; and—whether all implementations of an individual specification are implementations of another one. For each of these decision problems we investigate the worst-case computational complexity for the modal and mixed cases. We show that the first decision problem is EXPTIME-complete for both modal and mixed specifications. We prove that the second decision problem is EXPTIME-complete for mixed specifications (it is known to be trivial for modal ones). The third decision problem is also shown to be EXPTIME-complete for mixed specifications.
6
Fuchs, Norbert E., and David Robertson. "Declarative specifications." Knowledge Engineering Review 11, no. 4 (December 1996): 317–31. http://dx.doi.org/10.1017/s0269888900008018.
Full textAbstract:
AbstractDeriving formal specifications from informal requirements is extremely difficult since one has to overcome the conceptual gap between an application domain and the domain of formal specification methods. To reduce this gap we introduce application-specific specification languages, i.e., graphical and textual notations that can be unambiguously mapped to formal specifications in a logic language. We describe a number of realised approaches based on this idea, and evaluate them with respect to their domain specificity vs. generality.
7
Kovalev, Igor, Dmitry Kovalev, Komil Astanakulov, Valerya Podoplelova, Dmitry Borovinsky, and Svetlana Efa. "Conceptual basis for digitalization of specifications of transport and technological cycles of agricultural UAVs." E3S Web of Conferences 443 (2023): 06014. http://dx.doi.org/10.1051/e3sconf/202344306014.
Full textAbstract:
The conceptual basis for digitalization of the specifications of transport and technological cycles of agricultural UAVs used in performing agrotechnical operations in smart agriculture is presented in the article. The basic properties of specifications have been studied. Methods for analyzing the main properties of specifications are considered and the relationship between specifications and the main stages of the life cycle of transport and technological cycles of UAVs is established. Based on GERT-oriented conceptual specification tools, a method for organizing conceptual specification tools based on GERT-like nodal logic is proposed in the article. Formalization of the GERT-network specification of transport and technological cycles of agricultural UAVs has been completed. The proposed approach to creating specifications for transport and technological cycles of UAVs in smart agriculture makes it possible to ensure full compliance of the specifications with the basic requirements for accuracy, clarity and completeness of description.
8
HOUDEK, FRANK, THILO SCHWINN, and DIETMAR ERNST. "DEFECT DETECTION FOR EXECUTABLE SPECIFICATIONS — AN EXPERIMENT." International Journal of Software Engineering and Knowledge Engineering 12, no. 06 (December 2002): 637–55. http://dx.doi.org/10.1142/s0218194002001128.
Full textAbstract:
The deployment of executable specifications has increased significantly in the last few years. Just as with any other specification documents, these specifications must be examined to ensure the necessary degree of quality. A common and successful technique used for examining traditional specifications is inspection. Now the question has arisen whether inspections on executable specification are the best choice, or if other techniques which use the execution capabilities of the models perform better. In this paper, we empirically compare several defect detection techniques for executable specifications. In particular, we examine inspections, testing, and ad-hoc simulation. Here, we use the specification languages Statemate and Matlab/Simulink. Also, we take a closer look at the inspection process itself and try to quantify the benefits of an inspection meeting for executable specifications.
9
Geschwindner, Louis F. "Evolution of Shear Lag and Block Shear Provisions in the AISC Specification." Engineering Journal 43, no. 4 (December 31, 2006): 237–40. http://dx.doi.org/10.62913/engj.v43i4.892.
Full textAbstract:
The American Institute of Steel Construction (AISC) has published two standards for design of steel structures for the past 19 years, an allowable stress specification, ASD, and a limit states specification, LRFD. The AISC Committee on Specifications has developed a new standard that includes provisions for design according to both ASD and LRFD. For connection design, the specification evolved as provisions from the previous specifications were integrated into the new provisions. This paper highlights the provisions for shear lag and block shear from the 2005 AISC Specification for Structural Steel Buildings provisions and the changes that have taken place from previous editions of the specifications.
10
Quiroga, Cesar, David Ford, Timothy Taylor, Stanley Kranc, and Edgar Kraus. "Construction Specification Framework for Utility Installations." Transportation Research Record: Journal of the Transportation Research Board 2060, no. 1 (January 2008): 162–72. http://dx.doi.org/10.3141/2060-18.
Full textAbstract:
Utility accommodation policies nationwide contain requirements for the accommodation, location, installation, relocation, and maintenance of utility facilities on the state right-of-way. The policies normally cover basic requirements, making it necessary to use additional specifications and special provisions to handle situations not covered by the policies. Frequently, because of the lack of standard utility installation construction specifications at transportation agencies, many different versions of special specifications and special provisions exist. Closely related to the need to standardize construction specifications for utility installations is the need to standardize methodologies and procedures for determining the cost of utility relocation. This lack of standardization translates into difficulties such as how to verify the validity of the cost data submitted for reimbursement and how to prepare adequately for audits and other internal and external inquiries. This paper summarizes the work completed to develop a prototype framework of construction specification requirements for utility installations, with a focus on water, sanitary sewer, and communication specifications. The specification framework includes five groups of specifications: earth work, pipes and boxes, appurtenances, other, and general (including specifications such as mobilization and traffic control, which highway construction contracts typically include but are also relevant to the utility relocation process). The framework uses tables that summarize the main characteristics of proposed new and modified standard specifications and includes a listing of pay items, subsidiary items, and corresponding measurement units. The framework also includes specification requirements.
11
Takura, Akira, Tadashi Ohta, and Keizo Kawata. "Process specification generation from communications service specifications." Automated Software Engineering 2, no. 2 (June 1995): 167–82. http://dx.doi.org/10.1007/bf00871826.
Full text
12
Chun, Seung Su. "The Pattern Based Visual Property Specification Language and Supporting System for Software Verifications." Applied Mechanics and Materials 752-753 (April 2015): 1090–96. http://dx.doi.org/10.4028/www.scientific.net/amm.752-753.1090.
Full textAbstract:
This paper deals with issue of properties specification for software verifications and translation between formal languages. Through this paper, the unique framework of property specifications including most kinds of formal specifications logics, automatic methods are shown by a property specifications guided system and PVSL(The Pattern based Visual property Specification Language).Additionally, a properties to specify and structures, Interconnection of them are also described by property charts. In this study, the pattern based visual property specification language (PVSL) is defined and property specifications method is also designed by convenience specifications of required property.Required properties can be described by its charts and analyzes its meaning and structures as using patterns diagrams and property and-or tree. On the other hands, it also guarantees stability and limitation of utilizations of patterns using much stronger specifying Dwyer`s meaning based property classification. The PVSL and property charts use hierarchical state machine notation to take advantage of knowledge a person who is one of practitioners has as much as possible, and for Nu-SMV, CW-CNC. They can be adapted to describe property charts and analyze into examples of CTL(Computation Tree Logic) and Modal Mu-Calculus logic that have been already used.Keywords: Patterns, Property specifications, model checking, Software verification
13
Luo, Zhaohui. "Program specification and data refinement in type theory." Mathematical Structures in Computer Science 3, no. 3 (September 1993): 333–63. http://dx.doi.org/10.1017/s0960129500000256.
Full textAbstract:
The study of type theory may offer a uniform language for modular programming, structured specification and logical reasoning. We develop an approach to program specification and data refinement in a type theory with a strong logical power and nice structural mechanisms to show that it provides an adequate formalism for modular development of programs and specifications. Specification of abstract data types is considered, and a notion of abstract implementation between specifications is defined in the type theory and studied as a basis for correct and modular development of programs by stepwise refinement. The higher-order structural mechanisms in the type theory provide useful and flexible tools (specification operations and parameterized specifications) for modular design and structured specification. Refinement maps (programs and design decisions) and proofs of implementation correctness can be developed by means of the existing proof development systems based on type theories.
14
Park, Kanghee, Loris D'Antoni, and Thomas Reps. "Synthesizing Specifications." Proceedings of the ACM on Programming Languages 7, OOPSLA2 (October 16, 2023): 1787–816. http://dx.doi.org/10.1145/3622861.
Full textAbstract:
Every program should be accompanied by a specification that describes important aspects of the code's behavior, but writing good specifications is often harder than writing the code itself. This paper addresses the problem of synthesizing specifications automatically, guided by user-supplied inputs of two kinds: i) a query posed about a set of function definitions, and ii) a domain-specific language L in which the extracted property is to be expressed (we call properties in the language L-properties). Each of the property is a best L-property for the query: there is no other L-property that is strictly more precise. Furthermore, the set of synthesized L-properties is exhaustive: no more L-properties can be added to it to make the conjunction more precise. We implemented our method in a tool, Spyro. The ability to modify both the query and L provides a Spyro user with ways to customize the kind of specification to be synthesized. We use this ability to show that Spyro can be used in a variety of applications, such as mining program specifications, performing abstract-domain operations, and synthesizing algebraic properties of program modules.
15
HAMID, ISSAM A., and MOHAMED ERRADI. "DYNAMIC EVOLUTION OF DISTRIBUTED SYSTEMS SPECIFICATIONS USING REFLECTIVE LANGUAGE." International Journal of Software Engineering and Knowledge Engineering 05, no. 04 (December 1995): 511–40. http://dx.doi.org/10.1142/s0218194095000253.
Full textAbstract:
Recently, object-oriented specifications of distributed systems has gained more attention. The object-oriented approach is known for its flexibility for system construction. However, one of the major challenges is to provide facilities for the dynamic modifications of such specifications during the development and maintenance process. Yet, current work has not addressed the dynamic modifications of specifications of distributed systems. In this paper, we are concerned with formal description techniques that allow for the development and dynamic modification of executable specifications. A two-level model for the evolution of large object-oriented specifications is introduced. The first deals with the dynamic modifications of types (classes), while the second deals with modifications of modules. We have defined a set of structural and behavioral constraints to ensure specification consistency after modification at both levels. To allow dynamic modification of types and modules, we have developed a reflective object-oriented specification language which uses meta-objects to support the modification operations. In this language, types and modules are objects.
16
Carboni-Huerta, Roberto, and Klever V. Sáenz-Flor. "Sigma and Risk in the Quality Control Routine: Analysis in Chilean Clinical Laboratories." Journal of Applied Laboratory Medicine 7, no. 2 (December 12, 2021): 456–66. http://dx.doi.org/10.1093/jalm/jfab145.
Full textAbstract:
Abstract Background The Six Sigma methodology is focused toward improvement, based on the Total Quality Management. It has been implemented in analytical procedures for clinical laboratories in the form of Sigma Metrics. This method is used in the evaluation of analytical procedures, providing evidence for risk-based management. Methods A descriptive study was carried using data from 18 Chilean clinical laboratories. The information of their performance and quality specifications used in their routine work was obtained from UNITY, an internal quality comparison program. Results A total of 3461 sigma evaluations was gathered, mostly from biyearly controls. The general distribution shows a median of 5.5 with positive asymmetry similar to other publications. The reported quality specifications are based in CLIA for 51.2% of the cases, 30.2% from biological variation, and 10.7% from other programs for the external quality evaluation. Significant differences (P < 0.05) were found between medians against their specification source. Conclusions In the studied series, it would be feasible to implement a risk-based quality control system with simple rules and minimal control materials for 55.5% of the evaluated sigmas. 19.6% of the sigmas require improvement mainly in precision. The variety in specifications reveals a lack of harmonization in the specification's selections.
17
McLachlan, Scott, Evangelia Kyrimi, Kudakwashe Dube, Graham Hitman, Jennifer Simmonds, and Norman Fenton. "Towards standardisation of evidence-based clinical care process specifications." Health Informatics Journal 26, no. 4 (March 18, 2020): 2512–37. http://dx.doi.org/10.1177/1460458220906069.
Full textAbstract:
There is a strong push towards standardisation of treatment approaches, care processes and documentation of clinical practice. However, confusion persists regarding terminology and description of many clinical care process specifications which this research seeks to resolve by developing a taxonomic characterisation of clinical care process specifications. Literature on clinical care process specifications was analysed, creating the starting point for identifying common characteristics and how each is constructed and used in the clinical setting. A taxonomy for clinical care process specifications is presented. The De Bleser approach to limited clinical care process specifications characterisation was extended and each clinical care process specification is successfully characterised in terms of purpose, core elements and relationship to the other clinical care process specification types. A case study on the diagnosis and treatment of Type 2 Diabetes in the United Kingdom was used to evaluate the taxonomy and demonstrate how the characterisation framework applies. Standardising clinical care process specifications ensures that the format and content are consistent with expectations, can be read more quickly and high-quality information can be recorded about the patient. Standardisation also enables computer interpretability, which is important in integrating Learning Health Systems into the modern clinical environment. The approach presented allows terminologies for clinical care process specifications that were widely used interchangeably to be easily distinguished, thus, eliminating the existing confusion.
18
Valle, Rafael, Alexandre Donzé, Daniel J. Fremont, Ilge Akkaya, Sanjit A. Seshia, Adrian Freed, and David Wessel. "Specification Mining for Machine Improvisation with Formal Specifications." Computers in Entertainment 14, no. 3 (December 31, 2016): 1–20. http://dx.doi.org/10.1145/2967504.
Full text
19
Hsee, Christopher K., Yang Yang, Yangjie Gu, and Jie Chen. "Specification Seeking: How Product Specifications Influence Consumer Preference." Journal of Consumer Research 35, no. 6 (April 2009): 952–66. http://dx.doi.org/10.1086/593947.
Full text
20
WANG, ZHIJIAN, WENRUI LI, and PENGCHENG ZHANG. "COMPARING AND IMPROVING THE SYNTHESIS OF STATE-BASED SPECIFICATIONS FROM SCENARIO-BASED SPECIFICATIONS." International Journal of Software Engineering and Knowledge Engineering 22, no. 07 (November 2012): 867–90. http://dx.doi.org/10.1142/s0218194012500234.
Full textAbstract:
The scenario-based specifications are popularly used to capture user requirements. The state-based specifications are very appropriate to capture system design. Recently, there has been increased research interest in connecting these two kinds of specifications, called synthesis. Synthesis is a way to automatically construct the state-based specifications from the scenario-based specifications. There are two kinds of synthesis methods: global synthesis and local synthesis. Global synthesis means constructing a state-based specification for the whole system from the scenario-based specifications, while local synthesis means constructing a state-based specification for each object in the system. The two different synthesis methods have different uses and need to be systematically compared. The contributions of this paper are twofold. Firstly, we propose an improved method supporting the global and the local synthesis of state machines (a kind of state-based specifications) by using a novel algorithm for state machine execution and an algorithm similar to operator priority analysis method, which can fully automate the process of synthesis. Our synthesis method also satisfies two important properties: completeness and soundness. Secondly, to the best of our knowledge, our work does the first attempt to systematically compare global synthesis with local synthesis, and shows some insightful results of the experimental comparison between the two kinds of synthesis methods, which are valuable for the practitioners to choose an appropriate synthesis method for the analysis and verification of the system.
21
Pranevicius, Henrikas. "Integrated analysis of communication protocols by means of PLA formalism." Journal of Telecommunications and Information Technology, no. 4 (December 30, 2004): 84–90. http://dx.doi.org/10.26636/jtit.2004.4.260.
Full textAbstract:
Aggregate approach and its possibilities for specification and analysis of computer network protocols are presented. The theoretical basis of the aggregate approach is a piece-linear aggregate (PLA) for formal specification of systems. The advantage of that approach is that it permits to create models both for analysis correctness of specifications and simulation. Some methods that can be used for validation and verification of aggregate specifications are presented also.
22
Ott, Daniel, and Frank Houdek. "Automatic Requirement Classification: Tackling Inconsistencies Between Requirements and Regulations." International Journal of Semantic Computing 08, no. 01 (March 2014): 47–65. http://dx.doi.org/10.1142/s1793351x14500020.
Full textAbstract:
Current Requirement Engineering research must face the need to deal with the increasing scale of today's requirement specifications. One important and recent research direction is handling the consistency assurance between large scale specifications and many additional regulations (e.g. national and international norms and standards), which the specifications must consider or satisfy. For example, the specification volume for a single electronic control unit (ECU) in the automotive domain sums up to 3000 to 5000 pages distributed over 30 to 300 individual documents (specification and regulations). In this work, we present an approach to automatically classify the requirements in a set of specification documents and regulations to content topics in order to improve review activities in identifying cross-document inconsistencies. An essential success criteria for this approach from an industrial perspective is a sufficient classification quality with minimal manual effort. In this paper, we show the results of an evaluation in the domain of automotive specifications at Mercedes-Benz passenger cars. The results show that one manually classified specification is sufficient to derive automatic classifications for other documents within this domain with satisfactory recall and precision. So, the approach of using content topics is not only effective but also efficient in large scale industrial environments.
23
FERRUCCI, F., G. NOTA, G. PACINI, S. OREFICE, and G. TORTORA. "ON THE REFINEMENT OF LOGIC SPECIFICATIONS." International Journal of Software Engineering and Knowledge Engineering 02, no. 03 (September 1992): 433–48. http://dx.doi.org/10.1142/s0218194092000208.
Full textAbstract:
Refining a specification S1 means to provide another specification S2 which contains all the information given in S1 but with more detail. In this paper, we use logical implication from lower to higher levels of logic specifications to give a definition of refinement between these levels. This guarantees that any property of the higher level is also verified at the lower one. The definition of the relation "is refinement of" is given for specifications which are general first-order theories and it is proved to be transitive. A relevant aspect is that the different levels of logic specifications are in general not immediately comparable, because they can use different vocabularies. For this reason, the concept of transcription is introduced formally in our definition. Then the particular case of Horn specifications is considered. Horn specification semantics can be given by the methodology of least models. This may suggest definitions of the concept of refinement different from the one based on logical implication from lower to higher levels. However, conceptual problems can arise depending on the kind of the refinement definition chosen. Perhaps the most interesting effect is that the property of refinement transitivity may be lost. A possible way to restore the transitivity is provided.
24
Dole, Kalyani, Ashutosh Gupta, John Komp, Shankaranarayanan Krishna, and Ashutosh Trivedi. "Correct-by-Construction Reinforcement Learning of Cardiac Pacemakers from Duration Calculus Requirements." Proceedings of the AAAI Conference on Artificial Intelligence 37, no. 12 (June 26, 2023): 14792–800. http://dx.doi.org/10.1609/aaai.v37i12.26728.
Full textAbstract:
As the complexity of pacemaker devices continues to grow, the importance of capturing its functional correctness requirement formally cannot be overestimated. The pacemaker system specification document by \emph{Boston Scientific} provides a widely accepted set of specifications for pacemakers. As these specifications are written in a natural language, they are not amenable for automated verification, synthesis, or reinforcement learning of pacemaker systems. This paper presents a formalization of these requirements for a dual-chamber pacemaker in \emph{duration calculus} (DC), a highly expressive real-time specification language. The proposed formalization allows us to automatically translate pacemaker requirements into executable specifications as stopwatch automata, which can be used to enable simulation, monitoring, validation, verification and automatic synthesis of pacemaker systems. The cyclic nature of the pacemaker-heart closed-loop system results in DC requirements that compile to a decidable subclass of stopwatch automata. We present shield reinforcement learning (shield RL), a shield synthesis based reinforcement learning algorithm, by automatically constructing safety envelopes from DC specifications.
25
Schmitt, Robert L., Jeffrey S. Russell, Awad S. Hanna, Hussain U. Bahia, and Galadriel A. Jung. "Summary of Current Quality Control/ Quality Assurance Practices for Hot-Mix Asphalt Construction." Transportation Research Record: Journal of the Transportation Research Board 1632, no. 1 (January 1998): 22–31. http://dx.doi.org/10.3141/1632-03.
Full textAbstract:
State highway agencies and contractors have been implementing quality control/quality assurance (QC/QA) specifications in recent years to advance the quality of hot-mix asphalt (HMA) construction. During their continued development, attributes of these QC/QA specifications have varied among states. The objective of this paper is to provide a compilation of state-of-the-practice in QC/QA for HMA construction and provide recommendations for state highway agencies and contractors when modifying or developing a QC/QA specification. Survey data from 42 state highway agencies and 61 contractors working within 14 states found that a majority of states are using contractor data for acceptance. A review of QC/QA specifications from 40 states found that most states are using plant-produced mix properties, density, and smoothness tests to determine overall quality and acceptance of HMA construction work. A larger number of states are using quality level analysis for specification compliance by estimating percent within limits or percent defective for mix properties and density. Consideration is given to key attributes of a QC/QA specification, including ( a) whether to use contractor or agency data for acceptance, ( b) use of quantity or time for lots, and ( c) testing frequency. State highway agencies and contractors may find this report useful for understanding the components of different QC/QA specifications and furnishing essential information as both parties collaborate during specification development.
26
Ismatullaev, Ulugbek Vahobjon Ugli, and KwanMyung Kim. "Introducing a framework to translate user scenarios into engineering specifications with “action steps”." Proceedings of the Design Society 4 (May 2024): 23–34. http://dx.doi.org/10.1017/pds.2024.5.
Full textAbstract:
AbstractThis study presents a three-stage framework to translate user scenarios into engineering specifications. We introduced 'Action Steps' as an intermediate tool to help convert user scenarios into functional requirements and engineering specifications. It facilitates aligning specifications with user needs by filling in the essential product information not revealed in user scenarios. Preliminary testing revealed that the proposed framework improved team understanding and reduced information gaps, showcasing its potential to enhance specification development and process efficiency.
27
KAZMIERCZAK, EDMUND, PHILIP DART, LEON STERLING, and MICHAEL WINIKOFF. "VERIFYING REQUIREMENTS THROUGH MATHEMATICAL MODELLING AND ANIMATION." International Journal of Software Engineering and Knowledge Engineering 10, no. 02 (April 2000): 251–73. http://dx.doi.org/10.1142/s0218194000000146.
Full textAbstract:
Achieving confidence in the correctness, completeness and consistency of requirements specifications can be problematic and the consequences of incorrect requirements can be costly. In this paper we argue that specification and animation can provide reasonably high levels of assurance in the requirements without the overheads of using general purpose theorem proving tools. We propose a framework based on mode analysis and the operational semantics of logic programs for animating specifications. The framework allows us to combine prototyping and limited forms of automated deduction to increase our levels of confidence in specifications. Finally, we show how such a framework can be used to increase the level of confidence in the correctness of a simple dependency management system specification written in Z.
28
KAMTHAN, PANKAJ. "A FRAMEWORK FOR THE PRAGMATIC QUALITY OF Z SPECIFICATIONS." International Journal of Software Engineering and Knowledge Engineering 16, no. 05 (October 2006): 769–90. http://dx.doi.org/10.1142/s0218194006002938.
Full textAbstract:
Z is a formal specification language for describing sequential software systems. As the use of Z increases, the quality of Z specifications as effective means of communication arises. The aim of this paper is to contribute to a systematic assessment of the quality of Z specifications as perceived by their stakeholders. A pragmatic quality framework for Z specifications using notions from semiotics, cognitive psychology, and information system quality is proposed. The goals for pragmatic quality, and manageable criteria and mechanisms to address them in a feasible manner are identified. The utility and trade-offs of the mechanisms in achieving the quality goals of the framework are analyzed. Examples that lead to compromise of pragmatic quality in a Z specification, and techniques for improvement, are given.
29
Pandikow, Asmus, Erik Herzog, and Anders Törne. "5.6.3 Integrating Systems and Software Engineering Concepts in AP‐233." INCOSE International Symposium 10, no. 1 (July 2000): 781–87. http://dx.doi.org/10.1002/j.2334-5837.2000.tb00455.x.
Full textAbstract:
ABSTRACTThis paper presents ongoing work to extend the ISO 10303‐233 (AP‐233) systems engineering information model in order to integrate software‐engineering concepts. The work is motivated by the increasing importance of software in contemporary systems and the gap between systems and software engineering's specification methods. Encoding entities supporting modern software engineering attains two objectives. Firstly, the model could be used for exchanging software specifications in addition to system specifications. Secondly, relationships between entities representing software and system concepts can be encoded which allows for traceability between requirements expressed in a systems specification and the software design specification.
30
Zhang, Xiao Fen, Yi Hou, and Jia Lin Ma. "Survey on the Web Services Security Specifications." Advanced Materials Research 655-657 (January 2013): 1809–14. http://dx.doi.org/10.4028/www.scientific.net/amr.655-657.1809.
Full textAbstract:
Web Services security specifications include SSL/TLS (Secure Socket Layer/Transport Layer Security), XML Encryption, XML Signature, WS-Security specification family, PKI-related specifications etc. SSL/TLS are implemented in non-XML frameworks at the transport level, and others are implemented in XML frameworks at the application level. These specifications can satisfy the different requirements of Web Services security (confidentiality, integrity, authenticity, authorization, authentication and nonrepudiation). XML-based specifications are propitious to the integration and interoperability of Web Services security. SSL/TLS is sufficient for the basic generic security of internal Web Services projects. WS-Security is probably overkill, especially with the heavy XML processing that is involved in WS-Security.
31
Khan, A., S. Sharma, and V. Smaluk. "Review of alignment and stability tolerances for advanced light sources." Journal of Physics: Conference Series 2420, no. 1 (January 1, 2023): 012055. http://dx.doi.org/10.1088/1742-6596/2420/1/012055.
Full textAbstract:
Abstract Alignment and mechanical-stability specifications are essential to the performance of low-emittance storage rings. Beam dynamics simulations are usually performed to establish these specifications. However, the simulation procedures and the input parameters related to magnet positions are not well established which leads to differences in the final specifications. In this paper we discuss important parameters of the mechanical/structural systems of the storage ring that impact on the alignment and stability specification. We reviewed the alignment and stability specifications used at modern light sources across the world that will help to propose an efficient model for a low-emittance upgrade of NSLS-II.
32
Jiménez, Rosa M., Fernando Orejas, and Hartmut Ehrig. "Compositionality and compatibility of parameterization and parameter passing in specification languages." Mathematical Structures in Computer Science 5, no. 2 (June 1995): 283–314. http://dx.doi.org/10.1017/s0960129500000748.
Full textAbstract:
In this paper we continue previous work by Sannella, Sokolowski and Tarlecki on parameterization in specification languages. Within the loose approach, we define specification and model level semantics for two kinds of parameterizations (parameterized specifications and specifications of parameterized data types) and describe, in a compositional manner, parameter passing at both levels. Moreover, the specification and the model level semantics of parameter passing are shown to be compatible. We also show that the results obtained do not only apply to the loose approach but can also be directly applicable to the initial framework, and in general to any other kind of monomorphic framework (i.e., a framework where all specifications are monomorphic). In particular, the results obtained generalize and extend previous results for the initial approach. Finally, to obtain our results, new categorical constructions of multiple pushouts, amalgamations and extensions, which generalize standard notions of pushouts, amalgamations and extensions, had to be introduced.
33
Neary, Cyrus, Christos Verginis, Murat Cubuktepe, and Ufuk Topcu. "Verifiable and Compositional Reinforcement Learning Systems." Proceedings of the International Conference on Automated Planning and Scheduling 32 (June 13, 2022): 615–23. http://dx.doi.org/10.1609/icaps.v32i1.19849.
Full textAbstract:
We propose a framework for verifiable and compositional reinforcement learning (RL) in which a collection of RL subsystems, each of which learns to accomplish a separate subtask, are composed to achieve an overall task. The framework consists of a high-level model, represented as a parametric Markov decision process (pMDP) which is used to plan and to analyze compositions of subsystems, and of the collection of low-level subsystems themselves. By defining interfaces between the subsystems, the framework enables automatic decompositions of task specifications, e.g., reach a target set of states with a probability of at least 0.95, into individual subtask specifications, i.e. achieve the subsystem's exit conditions with at least some minimum probability, given that its entry conditions are met. This in turn allows for the independent training and testing of the subsystems; if they each learn a policy satisfying the appropriate subtask specification, then their composition is guaranteed to satisfy the overall task specification. Conversely, if the subtask specifications cannot all be satisfied by the learned policies, we present a method, formulated as the problem of finding an optimal set of parameters in the pMDP, to automatically update the subtask specifications to account for the observed shortcomings. The result is an iterative procedure for defining subtask specifications, and for training the subsystems to meet them. As an additional benefit, this procedure allows for particularly challenging or important components of an overall task to be identified automatically, and focused on, during training. Experimental results demonstrate the presented framework's novel capabilities in both discrete and continuous RL settings. A collection of RL subsystems are trained, using proximal policy optimization algorithms, to navigate different portions of a labyrinth environment. A cross-labyrinth task specification is then decomposed into subtask specifications. Challenging portions of the labyrinth are automatically avoided if their corresponding subsystems cannot learn satisfactory policies within allowed training budgets. Unnecessary subsystems are not trained at all. The result is a compositional RL system that efficiently learns to satisfy task specifications.
34
Davis-Stober, Clintin P., and Nicholas Brown. "A shift in strategy or “error”? Strategy classification over multiple stochastic specifications." Judgment and Decision Making 6, no. 8 (December 2011): 800–813. http://dx.doi.org/10.1017/s1930297500004228.
Full textAbstract:
AbstractWe present a classification methodology that jointly assigns to a decision maker a best-fitting decision strategy for a set of choice data as well as a best-fitting stochastic specification of that decision strategy. Our methodology utilizes normalized maximum likelihood as a model selection criterion to compare multiple, possibly non-nested, stochastic specifications of candidate strategies. In addition to single strategy with “error” stochastic specifications, we consider mixture specifications, i.e., strategies comprised of a probability distribution over multiple strategies. In this way, our approach generalizes the classification framework of Bröder and Schiffer (2003a). We apply our methodology to an existing dataset and find that some decision makers are best fit by a single strategy with varying levels of error, while others are best described as using a mixture specification over multiple strategies.
35
Ophey, Matthias, Christoph Löpenhaus, and Fritz Klocke. "Influence of Tool Specification and Machining Parameters on the Wear Behaviour at Generating Gear Grinding." Applied Mechanics and Materials 794 (October 2015): 231–38. http://dx.doi.org/10.4028/www.scientific.net/amm.794.231.
Full textAbstract:
One research objective for generating gear grinding is to increase economic efficiency and productivity of the process. At the same time gear quality must be equal or higher. In addition to machining parameters, tool specification has a significant influence on process productivity, workpiece quality and the wear of the tool itself. Due to the variety of tool specifications process users have the problem of selecting the best fitting tool for their demands. Therefore, it is necessary to know how interactions of tool specification and machining parameters influence tool wear and workpiece quality. But basic experimental studies, which take different tool specifications into account, are missing today.This paper focuses on the influence of different tool specifications and machining parameters on the tool wear for generating gear grinding. With analogy trials the influence of different specifications and machining parameters on tool wear and the process is mapped. The results are analyzed, discussed and summarized in a model. Furthermore, the applicability of the findings based on analogy trials to generating gear grinding is validated.
36
Neyzov, Maxim V., and Egor V. Kuzmin. "Verification of declarative LTL-specification of control programs behavior." Modeling and Analysis of Information Systems 31, no. 2 (June 13, 2024): 120–41. http://dx.doi.org/10.18255/1818-1015-2024-2-120-141.
Full textAbstract:
The article continues the series of works on development and verification of control programs based on LTL-specifications of a special type. Previously, it was proposed a declarative LTL-specification, which allows describing the behavior of control programs and building program code based on it in the imperative ST-language for programmable logic controllers. The LTL-specification can be directly verified for compliance with specified temporal properties by the model checking method using the nuXmv symbolic verification tool. In general, it is not required translating LTL-formulas of the specification into another formalism — an SMV-specification (code in the input language of the nuXmv tool). The purpose of this work is to explore alternative ways of representing a program behavior model corresponding to the declarative LTL-specification during its verification within the nuXmv tool. In the article, we transform the declarative LTL-specification into various SMV-specifications with accompanying changes of formulation of the verification problem, what leads to a significant reduction in time costs when checking temporal properties by using the nuXmv tool. The acceleration of verification is due to the reduction of the state space of a model being verified. The SMV-specifications obtained as a result of the proposed transformations specify identical or bisimulationally equivalent transition systems. It is ensuring the same verification results when replacing one SMV-specification with another.
37
CULPEPPER, RYAN. "Fortifying macros." Journal of Functional Programming 22, no. 4-5 (August 15, 2012): 439–76. http://dx.doi.org/10.1017/s0956796812000275.
Full textAbstract:
AbstractExisting macro systems force programmers to make a choice between clarity of specification and robustness. If they choose clarity, they must forgo validating significant parts of the specification and thus produce low-quality language extensions. If they choose robustness, they must write in a style that mingles the implementation with the specification and therefore obscures the latter. This paper introduces a new language for writing macros. With the new macro system, programmers naturally write robust language extensions using easy-to-understand specifications. The system translates these specifications into validators that detect misuses—including violations of context-sensitive constraints—and automatically synthesize appropriate feedback, eliminating the need for ad hoc validation code.
38
Tsai, Jhy-Cherng, and Mark R. Cutkosky. "Representation and reasoning of geometric tolerances in design." Artificial Intelligence for Engineering Design, Analysis and Manufacturing 11, no. 4 (September 1997): 325–41. http://dx.doi.org/10.1017/s0890060400003255.
Full textAbstract:
AbstractThe geometric dimensioning and tolerancing (GD&T) specifications of a design are directly associated with its performance and functional requirements. They also govern the manufacturing and quality control processes needed to achieve those requirements. This paper reviews recent work in geometric tolerance representation and reasoning and presents a generic and uniform graph-based representation scheme, called the Tolerance Network, to represent GD&T specifications across a part or assembly. The network can accommodate GD&T specifications related to the function, behavior, manufacturing, and inspection requirements embedded in design specifications and supports the use of different types of tolerances. The network also accommodates common design practices such as the specification of overconstrained features and parts. The necessary properties of such a network are discussed that allow under- and overconstrained design specifications to be detected and analyzed.
39
Chen, Shu, and Ming Kai Chen. "A Semantical Approach for Automatically Transforming Software Requirement Specification into Formal Presentation." Advanced Materials Research 225-226 (April 2011): 776–79. http://dx.doi.org/10.4028/www.scientific.net/amr.225-226.776.
Full textAbstract:
Software engineering is a critical step in obtaining high quality production. However, requirement specifications that written in natural language is inevitably has ambiguity. Modern driven architecture makes use of requirement model for the complement of requirement specification to eliminate such ambiguity. However, currently, the transformation from requirement specification into formal model only limited in syntax level, thus lack of correctness and precision. This paper proposed an approach in semantical level to process textual specifications of the requirements of unlimited natural language and their automatic mapping to the formal presentation.
40
Baumann, Pascal, Moses Ganardi, Rupak Majumdar, Ramanathan S. Thinniyam, and Georg Zetzsche. "Context-Bounded Verification of Context-Free Specifications." Proceedings of the ACM on Programming Languages 7, POPL (January 9, 2023): 2141–70. http://dx.doi.org/10.1145/3571266.
Full textAbstract:
A fundamental problem in refinement verification is to check that the language of behaviors of an implementation is included in the language of the specification. We consider the refinement verification problem where the implementation is a multithreaded shared memory system modeled as a multistack pushdown automaton and the specification is an input-deterministic multistack pushdown language. Our main result shows that the context-bounded refinement problem, where we ask that all behaviors generated in runs of bounded number of context switches belong to a specification given by a Dyck language, is decidable and coNP-complete. The more general case of input-deterministic languages follows, with the same complexity. Context-bounding is essential since emptiness for multipushdown automata is already undecidable, and so is the refinement verification problem for the subclass of regular specifications. Input-deterministic languages capture many non-regular specifications of practical interest and our result opens the way for algorithmic analysis of these properties. The context-bounded refinement problem is coNP-hard already with deterministic regular specifications; our result demonstrates that the problem is not harder despite the stronger class of specifications. Our proof introduces several general techniques for formal languages and counter programs and shows that the search for counterexamples can be reduced in non-deterministic polynomial time to the satisfiability problem for existential Presburger arithmetic. These techniques are essential to ensure the coNP upper bound: existing techniques for regular specifications are not powerful enough for decidability, while simple reductions lead to problems that are either undecidable or have high complexities. As a special case, our decidability result gives an algorithmic verification technique to reason about reference counting and re-entrant locking in multithreaded programs.
41
Aminof, Benjamin, Giuseppe De Giacomo, Aniello Murano, and Sasha Rubin. "Planning under LTL Environment Specifications." Proceedings of the International Conference on Automated Planning and Scheduling 29 (May 25, 2021): 31–39. http://dx.doi.org/10.1609/icaps.v29i1.3457.
Full textAbstract:
Planning domains represent what an agent assumes or believes about the environment it acts in. In the presence of nondeterminism, additional temporal assumptions, such as fairness, are often expressed as extra conditions on the domain. Here we consider environment specifications expressed in arbitrary LTL, which generalize many forms of environment specifications, including classical specifications of nondeterministic domains, fairness, and other forms of linear-time constraints on the domain itself. Existing literature typically implicitly or explicitly considers environment specifications as constraints on possible traces. In contrast, in spite of the fact that we use a linear-time formalism, we propose to consider environment specifications as specifications of environment strategies. Planning in this framework is the problem of computing an agent strategy that achieves its goal against all environment strategies satisfying the specification. We study the mathematical and computational properties of planning in this general setting. We observe that not all LTL formulas correspond to legitimate environment specifications, and formally characterize the ones that do. Moreover, we show that our notion of planning generalizes the classical notion of Church’s synthesis, and that in spite this one can still solve it optimally using classical Church’s synthesis.
42
Hill, ED, and G. Frohnsdorff. "Portland Cement Specifications: Performance, Prescription, and Prediction." Cement, Concrete, and Aggregates 15, no. 2 (January 1, 1993): 109–18. http://dx.doi.org/10.1520/cca10596j.
Full textAbstract:
Abstract A major driving force for specification development, whether for a cement or other material, is a need for enhanced and more predictable performance. A prescriptive specification reduces the risk of poor performance by keeping the composition and other conveniently measurable characteristics of a product close to those of a product which has performed well. Although it is harder to develop and apply, a performance specification can be a valuable complement to a prescriptive one; apart from being less restrictive, its development focuses attention explicitly on the definition and the measurement of performance. Neither prescriptive nor performance specifications necessarily require scientific understanding of factors affecting performance, and so a third approach is proposed—a predictive specification based on scientific understanding. In the case of cement and concrete, it can be foreseen as a result of the continued strengthening of the materials science base of the technology combined with developments in computer simulation of the behavior of cementitious systems. While these developments arc taking place, improvements must continue to be sought in the prescriptive and performance specifications to make sure they are as good as they can be. The desired improvements and the research needed to achieve them must be defined, and support for the research must be provided. For the near term, some suggestions for improving the existing portland cement specifications, ASTM C 150, are offered. They concern minimum strength levels, strength uniformity, and improvement of compound composition calculations.
43
Liu, Hui Fen, Mei Fa Huang, Lei Lei Chen, and Bo Shi. "On Generation of the Specification Model for Concentricity Based on Mathematical Modeling." Advanced Materials Research 361-363 (October 2011): 1481–85. http://dx.doi.org/10.4028/www.scientific.net/amr.361-363.1481.
Full textAbstract:
Feature specifications are important composite parts in the new generation of geometrical product specifications and verification (GPS). According to the theories of specification model of shaft parts, this paper presents a method to generation of specification model of concentricity. Firstly, the mathematical model of concentricity is established in terms of nominal geometrical features of product for the parts the functional requirement are satisfied. Secondly, the simulation points of the model are generated by using the methods of axial stratification and circumferential multi-angles. The concentricity specification model could be generated after these operations of association and collection. Finally, an example is applied to illustrate the new method. The experiment results show the effectiveness of the proposed method.
44
Wang, Yamin, Ramakrishna V. Vishnuvajjala, and Wei-Tek Tsai. "Sequence Specification for Concurrent Object-Oriented Applications." International Journal of Software Engineering and Knowledge Engineering 08, no. 03 (September 1998): 361–83. http://dx.doi.org/10.1142/s0218194098000200.
Full textAbstract:
Modeling synchronization among threads is important for the specification, design, and testing of concurrent object-oriented applications such as those written in Java. This paper proposes Synchronized Method Sequence Specification (SMtSS), a mechanism for specifying synchronization requirements among multiple threads sharing a common object. SMtSS identifies two kinds of synchronization among the sharing threads, internal and external ones, and explicitly specifies the synchronization scenarios. SMtSS also proposes notations for specifying different data integrity constraints on method executions. This paper also proposes specification-slicing techniques to obtain specific behavior of certain threads from SMtSS specifications. Finally, this paper discusses how SMtSS specifications can be useful in the design and testing of concurrent object-oriented applications in Java.
45
Gebhardt, RF. "Why Performance Standards for Hydraulic Cement?" Cement, Concrete, and Aggregates 15, no. 2 (January 1, 1993): 119–23. http://dx.doi.org/10.1520/cca10597j.
Full textAbstract:
Abstract There is currently a significant trend toward performance-oriented specifications for hydraulic cements. A performance specification is one which primarily or exclusively defines what its object does rather than what it is, how it is made, or what it looks like. Performance specifications for cement are not new phenomena; they have been with us from the earliest stages of standards development. The goal has always been what the cement does, but the “trend” to performance “accelerated” in the mid-1970s, driven partly by antitrust considerations. A performance-oriented specification for blended cements has almost completed the ASTM process and should appear soon in the Annual Book of ASTM Standards. It is a “pure” performance specification, intended to exist in parallel with the current hybrid specification, Specification for Blended Hydraulic Cements (C 595). ASTM C 595 prescribes that a blended cement may contain only a limited suite of materials and then applies property (performance) requirements to the resulting product. Many existing blended cements with long histories of commercial acceptance, such as product cements (block, pipe, precast, etc.), are not now included in ASTM specifications. The new specification eliminates the restriction on constituents and composition, but requires that any blended cement be demonstrated to meet specified criteria for the primary performance attributes that can reasonably be measured. A similar performance specification for portland cement is nearing the point of Committee ballot. Can masonry cement be far behind?
46
Singh, Nikhil Kumar, and Indranil Saha. "Specification Guided Automated Synthesis of Feedback Controllers." ACM Transactions on Embedded Computing Systems 20, no. 5s (October 31, 2021): 1–26. http://dx.doi.org/10.1145/3477011.
Full textAbstract:
The growing use of complex Cyber-Physical Systems (CPSs) in safety-critical applications has led to the demand for the automatic synthesis of robust feedback controllers that satisfy a given set of formal specifications. Controller synthesis from the high-level specification is an NP-Hard problem. We propose a heuristic-based automated technique that synthesizes feedback controllers guided by Signal Temporal Logic (STL) specifications. Our technique involves rigorous analysis of the traces generated by the closed-loop system, matrix decomposition, and an incremental multi-parameter tuning procedure. In case a controller cannot be found to satisfy all the specifications, we propose a technique for modifying the unsatisfiable specifications so that the controller synthesized for the satisfiable subset of specifications now also satisfies the modified specifications. We demonstrate our technique on eleven controllers used as standard closed-loop control system benchmarks, including complex controllers having multiple independent or nested control loops. Our experimental results establish that the proposed algorithm can automatically solve complex feedback controller synthesis problems within a few minutes.
47
EL-GENDY, HAZEM, and NABIL EL-KADHI. "FORMAL METHOD FOR AUTOMATED TRANSFORMATION OF LOTOS SPECIFICATIONS TO ESTELLE SPECIFICATIONS." International Journal of Software Engineering and Knowledge Engineering 15, no. 05 (October 2005): 873–91. http://dx.doi.org/10.1142/s0218194005002567.
Full textAbstract:
ISO and IEC have jointly developed two Formal Description Techniques (FDTs) for specifying distributed real time systems such as computer/telecommunications protocols. These are Lotos and Estelle. In this paper, a formal method for automated transformation of a Lotos specification to an Estelle specification is presented. The method is applicable to various Lotos specification styles and to various communications protocols of ISO OSI layers. Our method has applications in conformance testing of such systems and building common semantic model for the various FDTs. In this paper, we develop an algorithm for constructing a 'Data Oriented'-Restricted Behavior Tree T that represent both the control flow aspects and the data flow aspects of the system. Then, we develop an algorithm for constructing the Estelle specifications from T. A minimization rule is also developed to optimize the size of the Estelle specification by reducing both the number of states and the number of transitions.
48
Cooling, Michael T., and Peter Hunter. "The CellML Metadata Framework 2.0 Specification." Journal of Integrative Bioinformatics 12, no. 2 (June 1, 2015): 86–103. http://dx.doi.org/10.1515/jib-2015-260.
Full textAbstract:
Summary The CellML Metadata Framework 2.0 is a modular framework that describes how semantic annotations should be made about mathematical models encoded in the CellML (www.cellml.org) format, and their elements. In addition to the Core specification, there are several satellite specifications, each designed to cater for model annotation in a different context. Basic Model Information, Citation, License and Biological Annotation specifications are presented.
49
Zhou, Shaohua, Cheng Yang, and Jian Wang. "Modeling of Key Specifications for RF Amplifiers Using the Extreme Learning Machine." Micromachines 13, no. 5 (April 28, 2022): 693. http://dx.doi.org/10.3390/mi13050693.
Full textAbstract:
The amplifier is a key component of the radio frequency (RF) front-end, and its specifications directly determine the performance of the system in which it is located. Unfortunately, amplifiers’ specifications degrade with temperature and even lead to system failure. To study how the system failure is affected by the amplifier specification degradation, it is necessary to couple the amplifier specification degradation into the system optimization design. Furthermore, to couple the amplifier specification degradation into the optimal design of the system, it is necessary to model the characteristics of the amplifier specification change with temperature. In this paper, the temperature characteristics of two amplifiers are modeled using an extreme learning machine (ELM), and the results show that the model agrees well with the measurement results and can effectively reduce measurement time and cost.
50
Al Dallal, Jehad, and Kassem Saleh. "Service-Oriented Synthesis of Distributed and Concurrent Protocol Specifications." Journal of Computer Systems, Networks, and Communications 2008 (2008): 1–13. http://dx.doi.org/10.1155/2008/794960.
Full textAbstract:
Several methods have been proposed for synthesizing computer communication protocol specifications from service specifications. Some protocol synthesis methods based on the finite state machine (FSM) model assume that primitives in the service specifications cannot be executed simultaneously. Others either handle only controlled primitive concurrency or have tight restrictions on the applicable FSM topologies. As a result, these synthesis methods are not applicable to an interesting variety of inherently concurrent applications, such as the Internet and mobile communication systems. This paper proposes a concurrent-based protocol synthesis method that eliminates the restrictions imposed by the earlier methods. The proposed method uses a synthesis method to obtain a sequential protocol specification (P-SPEC) from a given service specification (S-SPEC). The resulting P-SPEC is then remodeled to consider the concurrency behavior specified in the S-SPEC, while guaranteeing that P-SPEC provides the specified service.