High level executable network abstract machine

Details High level executable network abstract machine High level executable network abstract machine

2006-12-12

2006-12-12

Phan, Thai (Department: 2128)

Data processing: structural design, modeling, simulation, and em

Simulating electronic device or electrical system

Software program

C703S002000, C709S202000, C709S232000, C709S239000, C700S049000, C700S097000

Reexamination Certificate

active

07149678

ABSTRACT:
A generic algorithm for simulating communications software in the network environment, based on the model of plural Abstract State Machines (ASMs) is discussed. Other properties and behaviors can supplement the generic case, for example, network topology, delaying behaviors, message transport reliability, and message priority. Plural executing agents, each a sequential abstract state machine, are combined to simulate the behavior of a dynamic network environment. Agent and message behavior is altered based on the proposed or selected network under simulation. The desired behaviors and constraints are coded, compiled, and executed using an executable abstract state machine language.

REFERENCES:
patent: 5963447 (1999-10-01), Kohn et al.
patent: 6363421 (2002-03-01), Barker et al.
patent: 2003/0033039 (2003-02-01), Gutberlet et al.
patent: 2003/0156549 (2003-08-01), Binder et al.
patent: 2003/0217096 (2003-11-01), McKelvie et al.
Martelli, M. et al., Applying Logic Programming to the Specification of Complex Applications, 1997.
Kleijn, J.J.T., et al., A Process Algebra Based Verification of a Production System, 1998.
Cardelli, L., Wide Area Computation, Microsoft Research, 1998.
G. Del Castillo, W. Hardt, Fast Dynamic Analysis of Complex HW/SW-Systems based on Abstract State Machine Models, in: Proceedings of the Sixth International Workshop on Hardware/Software Codesign (CODES/CASHE'98), Seattle, Washington, Mar. 15-18, 1998, pp. 77-81.
Rettberg, A., Compilation of Flow Diagrams into Target Code for Embedded Systems, 1999.
Kara, M., et al., Update Plans for Parallel Architectures, Proceedings of the 3rdAbstract Machines Workshop, Abstract Machine Models for Parallel and Distributed Computing, IOS Press, 1996.
Sasaki, H. et al., Semantic Validation of VHDL-AMS by an Abstract State Machine, 1997.
Gurevich, Y., Sequential Abstract State Machines Capture Sequential Algorithms, MSR-TR-99-65, Micrososft Research, revised Feb. 20, 2000.
Barnett et al., “The ABCs of Specification: AsmL, Behavior, and Components”, Jun. 2001, 11 pages.
Barnett et al., “Conformance Checking of Components Against Their Non-deterministic Specifications”, Technical Report MSR-TR-2001-56, Jun. 2001, 18 pages.
Barnett et al., “Specification, Simulation and Testing of COM Components Using Abstract State Machines”, Technical report, Microsoft Research, undated, 5 pages.
Cardelli, “Wide Area Computation”, Microsoft Research, 1998. 16 pages.
Comer, “Internetworking with TCP/IP, vol. 1: Principles, Protocols, and Architecture”, Chapters 4, 5, and 7, Prentice Hall, © 2000, pp. 63-87 and 95-114.
Del Castillo et al., “Fast Dynamic Analysis of Complex HW/SW-Systems based on Abstract State Machine Models”,Proceedings of the Sixth International Workshop on Hardware/Software Codesign(CODE/CASHE'98), Seattle, Washington, Mar. 15-18, 1998, pp. 77-81.
Glässer et al., “An Abstract Communication Model”, Technical Report MSR-TR-2002-55, May 2002, 34 pages.
Glässer et al., “High-Level Executable Specification of the Universal Plug and Play Architecture”,Proceedings of the 35thAnnual Hawaii International Conference on System Sciences, 2002, 10 pages.
Glässer et al., “Universal Plug and Play Machine Models”, Technical Report MSR-TR-2001-59, Jun. 2001, 56 pages.
Grieskamp et al., “Conformance Testing with Abstract State Machines”, Technical report msr-tr-2001-97, Microsoft Research, Oct. 2001, 16 pages.
Grieskamp et al., “Generating Finite State Machines from Abstract State Machines”, Technical Report MSR-TR-2001-97, Oct. 2001, 19 pages.
Gurevich et al., “AsmL: The Abstract State Machine Language”, White Paper, Nov. 2001, 86 pages.
Gurevich, “Evolving Algebras 1993: Lipari Guide”,Specification and Validation Methods, Oxford University Press, © 1995, 26 pages.
Gurevich, “Sequential Abstract State Machines Capture Sequential Algorithms”, MSR-TR-99-65, Microsoft Research, revised Feb. 20, 2000, pp. 1-32.
Kleijn et al., “A Process Algebra Based Verification of a Production System”, 1998, 9 pages.
Martelli et al., “Applying Logic Programming to the Specification of Complex Applications”, 1997, 9 pages.
Osborne, “Update Plans for Parallel Architectures”,Proceedings of the 3rdAbstract Machines Workshop, Abstract Machine Models for Parallel and Distributed Computing, IOS Press, 1996, 12 pages.
Rettberg et al., “Compilation of Flow Diagrams into Target Code for Embedded Systems”, 1999, 5 pages.
Sasaki et al., “Semantic Validation VHDL-AMS by an Abstract State Machine”, 1997, 8 pages.
UPnP™ Forum, “UPnP™ Device Architecture”, Version 1.0, Jun. 2000, 52 pages.

Affiliated with

Also associated with

Rating

High level executable network abstract machine does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with High level executable network abstract machine, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and High level executable network abstract machine will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-3681841