Results 1  10
of
132
Petri Nets
 ACM Computing Surveys
, 1977
"... Over the last decade, the Petri net has gamed increased usage and acceptance as a basic model of systems of asynchronous concurrent computation. This paper surveys the basic concepts and uses of Petm nets. The structure of Petri nets, their markings and execution, several examples of Petm net models ..."
Abstract

Cited by 227 (0 self)
 Add to MetaCart
(Show Context)
Over the last decade, the Petri net has gamed increased usage and acceptance as a basic model of systems of asynchronous concurrent computation. This paper surveys the basic concepts and uses of Petm nets. The structure of Petri nets, their markings and execution, several examples of Petm net models of computer hardware and software, and
Synchronization and Storage Models for Multimedia Objects
 IEEE Journal on Selected Areas in Communications
, 1990
"... Abstractâ€“Multimedia computer systems are required to store, retrieve, and communicate objects comprised of mixed data types including images, text and voice. An important aspect of multimedia systems is the integration of elements retrieved from databases distributed across a network. Integration of ..."
Abstract

Cited by 205 (21 self)
 Add to MetaCart
Abstractâ€“Multimedia computer systems are required to store, retrieve, and communicate objects comprised of mixed data types including images, text and voice. An important aspect of multimedia systems is the integration of elements retrieved from databases distributed across a network. Integration of object components requires consideration of the temporal characteristics of multimedia elements. We propose a technique for the formal specification and modeling of multimedia composition with respect to intermedia timing. The proposed model is based on the logic of temporal intervals, and Timed Petri Nets. A strategy is evinced for constructing a database schema to facilitate data storage and retrieval of media elements based on the temporal relationships established by the proposed modeling tool. We present an algorithm which allows the retrieval of media elements from the constructed database in a manner which preserves the temporal requirements of the initial specification. Through the proposed model, the synchronization requirements of complex structures of temporally related objects can be easily specified.
Design of Embedded Systems: Formal Models, Validation, and Synthesis
 PROCEEDINGS OF THE IEEE
, 1999
"... This paper addresses the design of reactive realtime embedded systems. Such systems are often heterogeneous in implementation technologies and design styles, for example by combining hardware ASICs with embedded software. The concurrent design process for such embedded systems involves solving the ..."
Abstract

Cited by 122 (9 self)
 Add to MetaCart
(Show Context)
This paper addresses the design of reactive realtime embedded systems. Such systems are often heterogeneous in implementation technologies and design styles, for example by combining hardware ASICs with embedded software. The concurrent design process for such embedded systems involves solving the specification, validation, and synthesis problems. We review the variety of approaches to these problems that have been taken.
Decidability Issues for Petri Nets  a survey
, 1994
"... : We survey 25 years of research on decidability issues for Petri nets. We collect results on the decidability of important properties, equivalence notions, and temporal logics. 1. Introduction Petri nets are one of the most popular formal models for the representation and analysis of parallel proc ..."
Abstract

Cited by 113 (5 self)
 Add to MetaCart
: We survey 25 years of research on decidability issues for Petri nets. We collect results on the decidability of important properties, equivalence notions, and temporal logics. 1. Introduction Petri nets are one of the most popular formal models for the representation and analysis of parallel processes. They are due to C.A. Petri, who introduced them in his doctoral dissertation in 1962. Some years later, and independently from Petri's work, Karp and Miller introduced vector addition systems [47], a simple mathematical structure which they used to analyse the properties of "parallel program schemata', a model for parallel computation. In their seminal paper on parallel program schemata, Karp and Miller studied some decidability issues for vector addition systems, and the topic continued to be investigated by other researchers. When Petri's ideas reached the States around 1970, it was observed that Petri nets and vector addition systems were mathematically equivalent, even though thei...
Decidability and complexity of Petri net problems  an Introduction
 In Lectures on Petri Nets I: Basic Models
, 1998
"... . A collection of 10 "rules of thumb" is presented that helps to determine the decidability and complexity of a large number of Petri net problems. 1 ..."
Abstract

Cited by 96 (2 self)
 Add to MetaCart
(Show Context)
. A collection of 10 "rules of thumb" is presented that helps to determine the decidability and complexity of a large number of Petri net problems. 1
An introduction to asynchronous circuit design
 THE ENCYCLOPEDIA OF COMPUTER SCIENCE AND TECHNOLOGY
, 1997
"... ..."
(Show Context)
FunState  An Internal Design Representation for Codesign
 IEEE Transactions on Very Large Scale Integration (VLSI) Systems
, 2001
"... In this paper, an internal design model called FunState (functions driven by state machines) is presented that enables the representation of different types of system components and scheduling mechanisms using a mixture of functional programming and state machines. It is shown how properties relevan ..."
Abstract

Cited by 56 (17 self)
 Add to MetaCart
In this paper, an internal design model called FunState (functions driven by state machines) is presented that enables the representation of different types of system components and scheduling mechanisms using a mixture of functional programming and state machines. It is shown how properties relevant for scheduling and verification of specification models such as Boolean dataflow, cyclostatic dataflow, synchronous dataflow, marked graphs, and communicating state machines as well as Petri nets can be represented in the FunState model of computation. Examples of methods suited for FunState are described, such as scheduling and verification. They are based on the representation of the model's state transitions in form of a periodic graph. The feasibility of the novel approach is shown with an ATM switch example.
Complexity Results for 1safe Nets
, 1993
"... We study the complexity of several standard problems for 1safe Petri nets and some of its subclasses. We prove that reachability, liveness, and deadlock are all PSPACEcomplete for 1safe nets. We also prove that deadlock is NPcomplete for freechoice nets and for 1safe freechoice nets. Finally, ..."
Abstract

Cited by 49 (7 self)
 Add to MetaCart
(Show Context)
We study the complexity of several standard problems for 1safe Petri nets and some of its subclasses. We prove that reachability, liveness, and deadlock are all PSPACEcomplete for 1safe nets. We also prove that deadlock is NPcomplete for freechoice nets and for 1safe freechoice nets. Finally, we prove that for arbitrary Petri nets, deadlock is equivalent to reachability and liveness. This paper is to be presented at FST&TCS 13, Foundations of Software Technology & Theoretical Computer Science, to be held 1517 December 1993, in Bombay, India. A version of the paper with most proofs omitted is to appear in the proceedings. 1 Introduction Petri nets are one of the oldest and most studied formalisms for the investigation of concurrency [33]. Shortly after the birth of complexity theory, Jones, Landweber, and Lien studied in their classical paper [24] the complexity of several fundamental problems for Place/Transition nets (called in [24] just Petri nets). Some years later, Howell,...
J.C.: Phased logic: Supporting the synchronous design paradigmwith delayinsensitive circuitry
 IEEE Transactions on Computers
, 1996
"... ..."