Compositional semantics of a real-time prototyping language
Abstract
formal semantics of a prototyping language for
hard real-time systems, PSDL, is given. PSDL provides a data
flow notation augmented by application-orientation timing and
control constraints to describe a system as a hierarchy of networks
of processing units communicating via data streams. The
semantics of PSDL is defined in terms of algebraic high-level
Petri nets. This formalism combines algebraic specifications of
abstract data types with process and concurrency concepts of
Petri nets. Its data abstraction facilities are used to define the
meaning of PSDL data types, while high-level Petri nets serve to
model the casual and timing behavior of a system. The net model
exposes potential concurrency of computation and makes all
synchronization needs implied by timing and control constraints
explicit and precise. Time is treated as state of clocks, and clocks
are modeled as ordinary system components. The net semantics
provides the basis for applying analysis techniques and semantic
tools available for high-level Petri nets.
Rights
This publication is a work of the U.S. Government as defined in Title 17, United States Code, Section 101. Copyright protection is not available for this work in the United States.Collections
Related items
Showing items related by title, author, creator and subject.
-
Denotational Semantics of a Real-Time Prototyping Language
Krämer, Bernd; Luqi; Berzins, Valdis (Monterey, California. Naval Postgraduate School, 1990-07); NPS 52-90-033The denotational semantics of the Prototype System Description Language PSDL is formally described in terms of an algebra-based Petri net model in this paper. PSDL supports specification and design of software prototypes ... -
Multi-resolution playback of network trace files
Fortner, Scott (Monterey, California: Naval Postgraduate School, 2015-06);Marine Corps Tactical Systems Support Activity (MCTSSA) has put forth a requirement for a non-proprietary network traffic replay system that is user friendly and can provide both replay of a network trace file as well as ... -
A type inference algorithm and transition semantics for polymorphic C
Özgen, Mustafa (Monterey, California. Naval Postgraduate School, 1996-09);In an attempt to bring the ML-style type inference to the C programming language, Smith and Volpano developed a type system for a dialect of C, called PolyC SmV96a SmV95b. PolyC extends C with ML-style polymorphism and a ...