Filters








73,686 Hits in 8.9 sec

A Java Implementation of a Component Model with Explicit Symbolic Protocols [chapter]

Sebastian Pavel, Jacques Noyé, Pascal Poizat, Jean-Claude Royer
2005 Lecture Notes in Computer Science  
It describes a component model with explicit symbolic protocols based on STSs, and its implementation in Java.  ...  This implementation is based on controllers that encapsulate protocols and channels devoted to (possibly remote) communications between components.  ...  These protocols may be associated with interface, frame and architecture. [30] presents a model for the behaviour protocol-based description of hierarchical components.  ... 
doi:10.1007/11550679_9 fatcat:rwsn6p2ylff45j4d4redkqd2me

Method of analysing extended finite-state machine specifications

Behçet Sarikaya, Vassilios Koukoulidis, Gregor V Bochmann
1990 Computer Communications  
The paper gives a method of dynamic analysis for modular specifications which is based on symbolic execution and reachability analysis.  ...  The technique is first applied to the specifications in a nondeterministic finite-state machine model and then applied to an extended finite-state machine model for which two standard formal description  ...  This research was supported in part by the Natural Sciences and Engineering Research Council of Canada.  ... 
doi:10.1016/0140-3664(90)90175-g fatcat:l754tuprkvceljx5eofrxaewci

A roadmap to electronic payment transaction guarantees and a Colored Petri Net model checking approach

Panagiotis Katsaros
2009 Information and Software Technology  
Our approach lies on the use of Colored Petri Nets and the CPN Tools environment (i) for editing and analyzing protocol models, (ii) for proving the required transaction guarantees by CTL-based (Computation  ...  Apart from a roadmap to the forenamed transaction guarantees, this work's contribution is basically a full-fledged methodology for building and validating high-level protocol models and for proving payment  ...  Invariant analysis is not excluded, but in CPnets this analysis concerns the place or transition invariants and it is not based on explicit state enumeration, with the associated state space explosion  ... 
doi:10.1016/j.infsof.2008.01.005 fatcat:lqmt4dxbprbllj7ghrnujhx34a

A novel synthesis technique for communication controller hardware from declarative data communication protocol specifications

Robert Siegmund, Dietmar Müller
2002 Proceedings - Design Automation Conference  
In our approach, controller hardware in form of RTL models is synthesized from a formal specification of a communication protocol.  ...  The novelty and efficiency of our methodology is demonstrated through comparison to State-of-The-Art protocol synthesis tools such as [10] .  ...  For the protocol description a protocol flow analysis is then performed which results in a protocol flow graph (PFG).  ... 
doi:10.1145/513918.514071 dblp:conf/dac/SiegmundM02 fatcat:wnodhllnujeuffm3kpjzln5uou

A novel synthesis technique for communication controller hardware from declarative data communication protocol specifications

Robert Siegmund, Dietmar Müller
2002 Proceedings - Design Automation Conference  
In our approach, controller hardware in form of RTL models is synthesized from a formal specification of a communication protocol.  ...  The novelty and efficiency of our methodology is demonstrated through comparison to State-of-The-Art protocol synthesis tools such as [10] .  ...  For the protocol description a protocol flow analysis is then performed which results in a protocol flow graph (PFG).  ... 
doi:10.1145/514069.514071 fatcat:uotuby67c5ezpfqk6l6pxm2vji

A novel synthesis technique for communication controller hardware from declarative data communication protocol specifications

R. Siegmund, D. Muller
2002 Proceedings 2002 Design Automation Conference (IEEE Cat. No.02CH37324)  
In our approach, controller hardware in form of RTL models is synthesized from a formal specification of a communication protocol.  ...  The novelty and efficiency of our methodology is demonstrated through comparison to State-of-The-Art protocol synthesis tools such as [10] .  ...  For the protocol description a protocol flow analysis is then performed which results in a protocol flow graph (PFG).  ... 
doi:10.1109/dac.2002.1012696 fatcat:wimime3brvc2nah7voc2cnjmdy

Test case verification by model checking

Kshirasagar Naik, Behcet Sarikaya
1993 Formal methods in system design  
All these properties expressed as temporal formulas are verified using model checking on an extended state machine graph representing the composed behavior of a test case and protocol specification.  ...  We model a test purpose as a liveness property and give a set of notations to formally specify a test purpose.  ...  Acknowledgments The authors are grateful to the reviewers for careful reading and constructive criticism.  ... 
doi:10.1007/bf01384135 fatcat:2plvclw75zbotix3m6bvqls3aq

Verification of Infinite-State Systems by Combining Abstraction and Reachability Analysis [chapter]

Parosh Aziz Abdulla, Aurore Annichini, Saddek Bensalem, Ahmed Bouajjani, Peter Habermehl, Yassine Lakhnech
1999 Lecture Notes in Computer Science  
We develop a general methodology for analyzing such systems based on combining automatic generation of abstract models (not necessarily finite-state) with symbolic reachability analysis.  ...  procedures and reachability analysis procedures for fifo channels systems.  ...  We develop a general analysis methodology for these models based on combining abstraction and symbolic reachability analysis.  ... 
doi:10.1007/3-540-48683-6_15 fatcat:7i7pjhprhnaf5bkiqyyzcvmw34

Specification and performance analysis of embedded systems with coloured petri nets

L.P.M. Benders
1999 Computers and Mathematics with Applications  
This is illustrated with a data-link protocol system, where the disturbance on the communication channels is modelled, too. (~) Keywords--Embedded systems design, Coloured Petri nets. 0898-1221/99/$ -see  ...  The communication on a channel is performed according to a user-specified protocol or one of the default protocols.  ...  We presented a summary of our real-time embedded system analysis methodology and tool. The specification language is based on VHDL and the analysis is based on timed coloured Petri nets simulation.  ... 
doi:10.1016/s0898-1221(99)00156-x fatcat:43b7pstfqngmrhia57puqeqrgu

Automatic Completion of Distributed Protocols with Symmetry [chapter]

Rajeev Alur, Mukund Raghothaman, Christos Stergiou, Stavros Tripakis, Abhishek Udupa
2015 Lecture Notes in Computer Science  
A distributed protocol is typically modeled as a set of communicating processes, where each process is described as an extended state machine along with fairness assumptions.  ...  Aimed at simplifying this task, we allow the designer to leave some of the guards and updates to state variables in the description of the protocol as unknown functions.  ...  If A 1 has an output transition on channel c from location l 1 to l 1 with guard and updates guard 1 and updates 1 , and A 2 has an input transition on the same channel c from location l 2 to l 2 with  ... 
doi:10.1007/978-3-319-21668-3_23 fatcat:7jkacxt2wbh5tazc4wfsa5jddm

Modular Timing Constraints for Delay-Insensitive Systems

Hoon Park, Anping He, Marly Roncken, Xiaoyu Song, Ivan Sutherland
2016 Journal of Computer Science and Technology  
The library descriptions of a handshake component's circuit, protocol, timing constraints, and STA code are robust to circuit modifications applied later in the design process by technology mapping or  ...  This paper introduces ARCtimer, a framework for modeling, generating, verifying, and enforcing timing constraints for individual self-timed handshake components.  ...  We are fortunate to have the support and encouragement of our Deans, Dean Renjeng Su at Portland State University and Dean Bin Hu at Lanzhou University. Special thanks go to Willem  ... 
doi:10.1007/s11390-016-1613-y fatcat:6h3humnffbemhgrz72fcp5j5sm

Reo Based Interaction Model

Silvia Amaro, Ernesto Pimentel, Ana M. Roldan
2006 Electronical Notes in Theoretical Computer Science  
In this context we propose the use of Reo, a channel-based coordination model, to specify the interactive behavior of software components.  ...  Coordination models and languages offer a solution to this problem.  ...  interfaces with a description of an abstract component interaction protocol.  ... 
doi:10.1016/j.entcs.2006.05.012 fatcat:6pmnrwodf5etffnebjouakzdm4

A mutation model for the SystemC TLM 2.0 communication interfaces

Nicola Bombieri, Franco Fummi, Graziano Pravadelli
2008 Proceedings of the conference on Design, automation and test in Europe - DATE '08  
In this context, the paper proposes a mutation model for perturbing transaction level modeling (TLM) SystemC descriptions.  ...  Mutation analysis is a widely-adopted strategy in software testing with two main purposes: measuring the quality of test suites, and identifying redundant code in programs.  ...  The EFSM model An EFSM is a transition system which allows a more compact and intuitive representation of the state space with respect to the traditional finite state machines.  ... 
doi:10.1145/1403375.1403472 fatcat:kcgjd5tguvb4hj25e5vioe6pji

Symbolic Verification of Lossy Channel Systems: Application to the Bounded Retransmission Protocol [chapter]

Parosh Abdulla, Aurore Annichini, Ahmed Bouajjani
1999 Lecture Notes in Computer Science  
This technique is based on the analysis of the effect of iterating control loops. In the work we present here, we experiment our approach and show how it can be effectively applied.  ...  In a previous work [1], we proposed an algorithmic approach based on constructing a symbolic representation of the set of reachable configurations of a system by means of a class of regular expressions  ...  Finkel and Marcé proposed a symbolic analysis procedure using a class of regular expressions (not comparable with SREs), and which is based on an analysis of the unbounded iterability of a control loop  ... 
doi:10.1007/3-540-49059-0_15 fatcat:q4ecsz5wyfgpre3xjhy6ynsr4u

Designing and Modeling of Covert Channels in Operating Systems

Yuqi Lin, Saif U. R. Malik, Kashif Bilal, Qiusong Yang, Yongji Wang, Samee U. Khan
2016 IEEE transactions on computers  
The existing works of modeling covert channels have mainly focused on using Finite State Machines (FSMs) and their transforms to describe the process of covert channel transmission.  ...  Furthermore, we propose two new covert channel models, namely: (a) Two Channel Transmission Protocol (TCTP) model and (b) Self-Adaptive Protocol (SAP) model.  ...  Description, modeling, and analysis of the classic covert channel protocol are discussed in Section 3. Design, modeling, and analysis of TCTP are explained in Section 4.  ... 
doi:10.1109/tc.2015.2458862 fatcat:ofzcelqeibbvdkdvx2wt5zhg7m
« Previous Showing results 1 — 15 out of 73,686 results