Filters








350,310 Hits in 4.9 sec

Formal Verification of Real-Time Systems with Data Processing

Tamás Tóth, István Majzik
2017 Periodica Polytechnica Electrical Engineering and Computer Science  
In this paper, we describe a simple formalism that represents both aspects of such systems in a uniform and explicit way, thus enables the combination of formal analysis methods for real-time systems and  ...  The behavior of practical safety critical systems often combines real-time behavior with structured data flow.  ...  With both timing and data handled with an appropriate abstraction, a compact over-approximation of the concrete state space is obtained that enables sound and efficient reachability analysis of the system  ... 
doi:10.3311/ppee.9766 fatcat:5kuh6d2y3zhbfcqkft527hvflm

Finite state verification (abstract only)

Lori A. Clarke
2000 Software engineering notes  
In this presentation, I will overview some of the different approaches to finite state verification.  ...  been called finite state verification.  ...  In this presentation, I will overview some of the different approaches to finite state verification.  ... 
doi:10.1145/347636.348946 fatcat:kw33svbk5rcg7bnnp7hlhnk4ve

Formal performance evaluation of AMBA-based system-on-chip designs

Gabor Madl, Sudeep Pasricha, Luis Angel D. Bathen, Nikil Dutt, Qiang Zhu
2006 Proceedings of the 6th ACM & IEEE International conference on Embedded software - EMSOFT '06  
In order to support high-speed pipelined data transfers, AMBA supports a rich set of bus signals, making the analysis of AMBA-based embedded systems a challenging proposition.  ...  The first contribution is to provide a method for the performance analysis and evaluation of AMBA-based SoC designs using formal models.  ...  This step is required for any formal analysis unless the DSM is already specified using a formal language (e.g. finite state machines or Petri-nets).  ... 
doi:10.1145/1176887.1176932 dblp:conf/emsoft/MadlPBDZ06 fatcat:7agackfykjbp3ghb32pdfgmwta

Towards formally verifiable resource bounds for real-time embedded systems

Kevin Hammond, Christian Ferdinand, Reinhold Heckmann
2006 ACM SIGBED Review  
This paper describes ongoing work aimed at the construction of formal cost models and analyses that are capable of producing verifiable guarantees of resource usage (space, time and ultimately power consumption  ...  ) in the context of realtime embedded systems.  ...  Finite State Automata Finite state automata provide a basis for constructing simple state-changing systems. They may also be used to give a natural model of concurrency.  ... 
doi:10.1145/1183088.1183093 fatcat:ojcxy3hksffrhfywvlrk5xky6e

Collaborative Systems – Finite State Machines

Ion IVAN, Cristian CIUREA, Sorin PAVEL
2011 Informatică economică  
In this paper the finite state machines are defined and formalized. There are presented the collaborative banking systems and their correspondence is done with finite state machines.  ...  It highlights the role of finite state machines in the complexity analysis and performs operations on very large virtual databases as finite state machines.  ...  Acknowledgements This article is a result of the project POSDRU/6/1.5/S/11 "Doctoral Program and PhD Students in the education research and innovation triangle".  ... 
doaj:7946075a978a408e9f4ecddccb9807e9 fatcat:ytwu75wkzbcfxieopozgcxzgiu

Performance evaluation of communicating processes

Ilya Gertner
1979 ACM SIGSIM Simulation Digest  
This dissertation focuses on performance analysis of existing distributed systems using finite state machine models of computation.  ...  new formalism, tested it on a real system, and used the results to support the value of finite state machines.  ...  The same formal models can then be appliec to nerformance analysis of those systems. We have done much of this fcr the R3 system using finite state machine models of computation.  ... 
doi:10.1145/1013608.805461 fatcat:k7phqhddfbh7vnuupwjdukqg4q

Performance evaluation of communicating processes

Ilya Gertner
1979 Proceedings of the 1979 ACM SIGMETRICS conference on Simulation, measurement and modeling of computer systems - SIGMETRICS '79  
This dissertation focuses on performance analysis of existing distributed systems using finite state machine models of computation.  ...  new formalism, tested it on a real system, and used the results to support the value of finite state machines.  ...  The same formal models can then be appliec to nerformance analysis of those systems. We have done much of this fcr the R3 system using finite state machine models of computation.  ... 
doi:10.1145/800188.805461 fatcat:4ozborbc6zht3lfj43wja3oq3a

Performance evaluation of communicating processes

Ilya Gertner
1979 Performance Evaluation Review  
This dissertation focuses on performance analysis of existing distributed systems using finite state machine models of computation.  ...  new formalism, tested it on a real system, and used the results to support the value of finite state machines.  ...  The same formal models can then be appliec to nerformance analysis of those systems. We have done much of this fcr the R3 system using finite state machine models of computation.  ... 
doi:10.1145/1009373.805461 fatcat:tulyvj5exbgini2wguvnu3qslu

A component-based specification approach for embedded systems using FDTs

Abdelaziz Guerrouat, Harald Richter
2005 Proceedings of the 2005 conference on Specification and verification of component-based systems - SAVCBS '05  
FDTs such as Estelle and SDL are based on EFSMs (Extended finite State Machines) and have been widely used in the automation of the development process of protocols and communicating systems, i.e. for  ...  This paper presents a framework for specification and testing of component-based embedded systems using formal description techniques (FDTs).  ...  Finite state machines are very popular in the control flow specification of state/transition-based systems and many related analysis methods have been developed [6] [7] .  ... 
doi:10.1145/1123058.1123073 fatcat:6xxhp3m2eff7tpo5jcfn6xo3m4

A component-based specification approach for embedded systems using FDTs

Abdelaziz Guerrouat, Harald Richter
2006 Software engineering notes  
FDTs such as Estelle and SDL are based on EFSMs (Extended finite State Machines) and have been widely used in the automation of the development process of protocols and communicating systems, i.e. for  ...  This paper presents a framework for specification and testing of component-based embedded systems using formal description techniques (FDTs).  ...  Finite state machines are very popular in the control flow specification of state/transition-based systems and many related analysis methods have been developed [6] [7] .  ... 
doi:10.1145/1118537.1123073 fatcat:qmfxxfsqnfbqfnoz6i77iomh3u

Specification and analysis of the FDDI MAC protocol using systems of communicating machines

GM Lundy, IF Akyildiz
1992 Computer Communications  
This model specifies each node as a finite state machine which has a set of local variables. With each transition is an enabling predicate and action.  ...  the extension of the formal model to include the timing of transitions; and confirmation of the timing properties of the protocol Keywords: MAC protocol, FDDI, protocol specification Fibre Distributed  ...  A system of communicating machines is an ordered pair 1 Si is a finite set of states; 2 s o C Si is a designated state called the initial state of mi; 3 L i is a finite set of local variables; 4 Ni is  ... 
doi:10.1016/0140-3664(92)90089-w fatcat:ivlktuxmsnhanj3rv4phwq4dvq

Abstract Interpretation Based Formal Methods and Future Challenges [chapter]

Patrick Cousot
2001 Lecture Notes in Computer Science  
In order to contribute to the solution of the software reliabil ity problem, tools have been designed to analyze statically the run-time behavior of programs.  ...  The main point is that in order to reason or compute about a complex system, some information must be lost, that is the observation of executions must be either partial or at a high level of abstraction  ...  Acknowledgements I thank Radhia Cousot and Reinhard Wilhelm for their comments on a preliminary version of this paper. This work was supported by the daedalus (58) and tuamotu (59) projects.  ... 
doi:10.1007/3-540-44577-3_10 fatcat:5d6txyozgfclpidmpgia2uqvla

Tool for Behavioral Analysis of Well-Structured Transition Systems
Инструмент для анализа поведения вполне структурированных систем переходов

L.W. Dworzanski, V.E. Mikhaylov
2017 Proceedings of the Institute for System Programming of RAS  
Two most studied algorithms for analysis of well-structured transition systems behavior (backward reachability and the Finite Reachability Tree analyses) have been implemented; and, their performance was  ...  In this paper, the tool for behavioural analysis of such systems is presented. We suggest the extension of SETL language to describe WSTS systems (WSTSL).  ...  However, the application of the WSTS analysis is hampered by the necessity of implementing algorithms and data structures to support the analysis for each new formalism.  ... 
doi:10.15514/ispras-2017-29(4)-11 fatcat:shtywwxlkzbunl5ovlcrvdncse

A new system engineering methodology coupling formal specification and performance evaluation [chapter]

J. Martins, J. -P. Hubaux
1996 Lecture Notes in Computer Science  
Therefore it associates the advantages of formal techniques that allow formal proof and automatic implementation with the benefits of performance evaluation.  ...  The basic idea is to abstract the relevant features of the system in the formal specification (structure, functional description), enhance it with relevant information for performance modeling (quality  ...  A process is an extended finite state machine (EFSM), that is either processing data or if no data is available for processing, is dormant in a state (the state defines what actions a process is allowed  ... 
doi:10.1007/3-540-60973-3_85 fatcat:757nkzgrk5d7pagerugbdl6vbe

A Formal Approach for Analysis and Testing of Reliable Embedded Systems

Abdelaziz Guerrouat, Harald Richter
2005 Electronical Notes in Theoretical Computer Science  
In this paper, a framework for the specification of embedded systems described as 'predicated' extended finite state machines (p-EFSMs) is proposed.  ...  Crucial tasks in the design of reliable embedded systems are analysis and testing.  ...  These support a formal test derivation which can be used for validation and testing purposes. However, finite state machines lack to deal with the data flow.  ... 
doi:10.1016/j.entcs.2005.02.050 fatcat:kdcbnp5ybzawrltbcfq2w2cgme
« Previous Showing results 1 — 15 out of 350,310 results