Results 1  10
of
44
Petrify: a tool for manipulating concurrent specifications and . . .
"... Petrify is a tool for (1) manipulating concurrent specifications and (2) synthesis and optimization of asynchronous control circuits. Given a Petri Net (PN), a Signal Transition Graph (STG), or a Transition System (TS) 1 it (1) generates another PN or STG which is simpler than the original descripti ..."
Abstract

Cited by 184 (33 self)
 Add to MetaCart
Petrify is a tool for (1) manipulating concurrent specifications and (2) synthesis and optimization of asynchronous control circuits. Given a Petri Net (PN), a Signal Transition Graph (STG), or a Transition System (TS) 1 it (1) generates another PN or STG which is simpler than the original description and (2) produces an optimized netlist of an asynchronous controller in the target gate library while preserving the specified inputoutput behavior. Given a specification petrify provides a designer with a netlist of an asynchronous circuit and a PNlike description of the circuit behavior in terms of events and ordering relations between events. The latter ability of backannotating to the specification level helps the designer to control the design process. For transforming a specification petrify performs a token flow analysis of the initial PN and produces a transition system (TS). In the initial TS, all transitions with the same label are considered as one event. The TS is then transformed and transitions relabeled to fulfill the conditions required to obtain a safe irredundant PN. For synthesis of an asynchronous implementation petrify performs state assignment by solving the Complete State Coding problem. State assignment is coupled with logic minimization and speedindependent technology mapping to a target library. The final netlist is guaranteed to be speedindependent, i.e., hazardfree under any distribution of gate delays and multiple input changes satisfying the initial specification. The tool has been used for synthesis of PNs and PNs composition [10], synthesis [7, 9, 8] and resynthesis [29] of asynchronous controllers and can be also applied in areas related with the analysis of concurrent programs. This paper provides an overview of petrify and the theory behind its main functions.
Deriving petri nets from finite transition systems
 IEEE Transactions on Computers
, 1998
"... ..."
(Show Context)
BRIDGING THE GAP BETWEEN BUSINESS MODELS AND WORKFLOW SPECIFICATIONS
 INTERNATIONAL JOURNAL OF COOPERATIVE INFORMATION SYSTEMS
"... ..."
Synthesizing Petri nets from statebased models
, 1995
"... This paper presentsa method to synthesize labeled Petri nets from statebased models. Although statebased models (such as Finite State Machines) are a powerful formalism to describe the behavior of sequential systems,they cannot explicitly express the notions of concurrency, causality and conflict. ..."
Abstract

Cited by 36 (17 self)
 Add to MetaCart
(Show Context)
This paper presentsa method to synthesize labeled Petri nets from statebased models. Although statebased models (such as Finite State Machines) are a powerful formalism to describe the behavior of sequential systems,they cannot explicitly express the notions of concurrency, causality and conflict. Petri nets can naturally capture these notions. The proposed method in based on deriving an Elementary Transition System (ETS) from a specification model. Previous work has shown that for any ETS there exists a Petri net with minimum transition count (one transition for each label) with a reachability graph isomorphic to the original ETS. This paper presents the first known approach to obtain an ETS from a nonelementary TS and derive a placeirredundant Petri net. Furthermore, by imposing constraints on the synthesis method, different classes of Petri nets can be derived from the same reachability graph (pure, free choice, unique choice). This method has been implemented and efficiently applied in different frameworks: Petri net composition, synthesis of Petri nets from asynchronous circuits, and resynthesis of Petri nets. 1
Correctbyconstruction asynchronous implementation of modular synchronous specifications
"... specifications ..."
(Show Context)
Higher dimensional transition systems
, 1996
"... We introduce the notion of higher dimensional transition systems as a model of concurrency providing an elementary, settheoretic formalisation of the idea of higher dimensional transition. We show an embedding of the category of higher dimensional transition systems into that of higher dimension ..."
Abstract

Cited by 25 (3 self)
 Add to MetaCart
(Show Context)
We introduce the notion of higher dimensional transition systems as a model of concurrency providing an elementary, settheoretic formalisation of the idea of higher dimensional transition. We show an embedding of the category of higher dimensional transition systems into that of higher dimensional automata which cuts down to an equivalence when we restrict to nondegenerate automata. Moreovel; we prove that the natural notion of bisimulation for such structures is a generalisation of the strong history preserving bisimulation, and provide an abstract categorical account of it via open maps. Finally, we dejine a notion of unfolding for higher dimensional transition systems and characterise the structures so obtained as a generalisation of event structures.
Polynomial Algorithms for the Synthesis of Bounded Nets
 PROCCEDINGS CAAP 95, LECTURE NOTES IN COMPUTER SCIENCE 915
, 1994
"... The socalled synthesis problem for nets, which consists in deciding whether a given graph is isomorphic to the case graph of some net, and then constructing the net, has been solved in the litterature for various types of nets, ranging from elementary nets to Petri nets. The common principle for th ..."
Abstract

Cited by 23 (6 self)
 Add to MetaCart
The socalled synthesis problem for nets, which consists in deciding whether a given graph is isomorphic to the case graph of some net, and then constructing the net, has been solved in the litterature for various types of nets, ranging from elementary nets to Petri nets. The common principle for the synthesis is the idea of regions in graphs, representing possible extensions of places in nets. However, no practical algorithm has been defined so far for the synthesis. We give here explicit algorithms solving in polynomial time the synthesis problem for bounded nets from regular languages or from finite automata.
An Event Structure Semantics for General Petri Nets
 Theoretical Computer Science
, 1993
"... In this paper we address the following question: What type of event structures are suitable for representing the behaviour of general Petri nets? As a partial answer to this question we define a new class of event structures called local event structures and identify a subclass called ULevent stru ..."
Abstract

Cited by 21 (1 self)
 Add to MetaCart
(Show Context)
In this paper we address the following question: What type of event structures are suitable for representing the behaviour of general Petri nets? As a partial answer to this question we define a new class of event structures called local event structures and identify a subclass called ULevent structures. We propose that ULevent structures are appropriate for capturing the behaviour of general Petri nets. Our answer is a partial one in that in the proposed event structure semantics, autoconcurrency is filtered out from the behaviour of Petri nets. It turns out that this limited event structure semantics for Petri nets is nevertheless a nontrivial and conservative extension of the (prime) event structure semantics of 1safe Petri nets provided in [NPW]. We also show that the strong relationship between prime event structures and 1safe Petri nets established in a categorical framework in [W3] can be extended to the present setting, provided we restrict our attention to the subclass ...
Petri Nets and Bisimulations
 THEORETICAL COMPUTER SCIENCE
, 1995
"... Several categorical relationships (adjunctions) between models for concurrency have been established, allowing the translation of concepts and properties from one model to another. A central example is a coreflection between Petri nets and asynchronous transition systems. The purpose of the pres ..."
Abstract

Cited by 16 (7 self)
 Add to MetaCart
Several categorical relationships (adjunctions) between models for concurrency have been established, allowing the translation of concepts and properties from one model to another. A central example is a coreflection between Petri nets and asynchronous transition systems. The purpose of the present paper is to illustrate the use of such relationships by transferring to Petri nets a general concept of bisimulation.