See this document in CiteSeerX!

Processes of Timed Petri Nets  (Make Corrections)  
Józef Winkowski
Theoretical Computer Science



  Home/Search   Context   Related

 
View or download:
ipipan.waw.pl/~wink/fptn.ps
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  ipipan.waw.pl/~wink/winkowski (more)
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: . Processes of timed Petri nets are represented by labelled partial orders with some extra features. These features reflect the execution times of processes and allow to combine processes sequentially and in parallel, which leads to some algebras. The processes can be represented either without specifying when particular situations appear (free processes), or together with the respective appearance times (timed processes). The processes of the latter type determine the possible firing sequences ... (Update)

Similar documents (at the sentence level):
26.2%:   Concatenable weighted pomsets and their applications to.. - Winkowski (1996)   (Correct)

Active bibliography (related documents):   More   All
0.7:   A Description of Processes of Timed Petri Nets - Winkowski   (Correct)
0.5:   Verifying Performance Equivalence for Timed Basic.. -.. (2000)   (Correct)
0.5:   Towards Performance Evaluation in Process Algebras - Gorrieri, Roccetti   (Correct)

Similar documents based on text:   More   All
0.8:   A Multi-Agent System For Distributed Job And Resource Management - Winkowski (1999)   (Correct)
0.7:   Processes of Contextual Nets and their Characteristics - Winkowski (1998)   (Correct)
0.5:   An Algebraic Characterization of Independence of Petri Net.. - Winkowski   (Correct)

BibTeX entry:   (Update)

@article{ winkowski00processes,
    author = "J{\'o}zef Winkowski",
    title = "Processes of timed {Petri} nets",
    journal = "Theoretical Computer Science",
    volume = "243",
    number = "1--2",
    pages = "1--34",
    year = "2000",
    url = "citeseer.ist.psu.edu/246675.html" }
Citations (may not include all citations):
71   Modelling Concurrency with Partial Orders - Pratt - 1986
57   Petri Net Models for Algebraic Theories of Concurrency (context) - van Glabbeek, Vaandrager - 1987
53   Analysis of Asynchronous Concurrent Systems by Timed Petri N.. (context) - Ramchandani - 1974
32   Axiomatizing Net Computations and Processes (context) - Degano, Meseguer et al. - 1989
23   A Theory of Processes with Durational Actions - Gorrieri, Roccetti et al. - 1995
8   Theoretical Computer Science (context) - Winkowski - 1980
3   Algebras of Processes of Timed Petri Nets (context) - Winkowski - 1994
3   Timing Petri Nets Categorically (context) - Brown, Gurr - 1992
3   An Algebraic Description of Processes of Timed Petri Nets (context) - Winkowski - 1994
2   Dynamic Matrices and the Cost Analysis of Concurrent Program.. (context) - Ferrari, Montanari - 1995
2   Weighted Basic Petri Nets (context) - Best - 1988
1   A Partial Order Representation of Processes of Timed Petri N.. (context) - Winkowski - 1993

Documents on the same site (http://www.ipipan.waw.pl/~wink/winkowski.htm):   More
A Partial Order Representation of Processes of Contextual Nets - Winkowski (1997)   (Correct)
A Representation Of Processes Of Petri Nets By Matrices - Winkowski (1996)   (Correct)
Modelling Timed Behaviours With The Aid Of Event And.. - Winkowski   (Correct)

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC