See this document in CiteSeerX!

Series-Parallel Languages and 1-Safe Nets  (Make Corrections)  
K. Lodaya, D. Ranganayakulu, K. Rangarajan



  Home/Search   Context   Related

 
View or download:
imsc.ernet.in/~kamal/spl1sn.ps.gz
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  imsc.ernet.in/~kamal/ (more)
(Enter author homepages)

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

Abstract: We give precise syntactic characterizations for the following subclasses of 1-safe net systems: S-systems [12], communication-free systems [13] and N-free systems (following [16]), by proving Kleene-Myhill-Nerode-Buchi theorems. (Update)

Active bibliography (related documents):   More   All
0.7:   Towards a language theory for infinite N-free pomsets - Kuske (2000)   (Correct)
0.5:   Petri Net Languages and Infinite Subsets of N m - Gaubert, Giua   (Correct)
0.5:   Some Algebraic Laws for Spans (and Their Connections With.. - Bruni, Gadducci (2001)   (Correct)

Similar documents based on text:   More   All
0.6:   Rationality in Algebras With a Series Operation - Lodaya, Weil (2000)   (Correct)
0.6:   Series-Parallel Languages and the Bounded-Width Property - Lodaya, Weil (1998)   (Correct)
0.4:   Series-Parallel Posets: Algebra, Automata and Languages - Lodaya, Weil   (Correct)

BibTeX entry:   (Update)

@misc{ lodaya-seriesparallel,
  author = "K. Lodaya and D. Ranganayakulu and K. Rangarajan",
  title = "Series-Parallel Languages and 1-Safe Nets",
  url = "citeseer.ist.psu.edu/600861.html" }
Citations (may not include all citations):
71   Modelling concurrency with partial orders - Pratt - 1986
69   Free choice Petri nets (context) - Desel, Esparza - 1995
65   Analysis of production schemata by Petri nets - Hack - 1972
49   Petri nets (context) - Reisig - 1985
38   World Scienti c (context) - Diekert, Rozenberg et al. - 1995
33   Finite representations of CCS and TCSP programs by automata .. (context) - Taubner - 1989
29   Petri nets and the equivalence problem (context) - Hirshfeld - 1994
26   terms and formulas (context) - Olderog - 1991
19   The equational theory of pomsets (context) - Gischer - 1988
19   Petri net models for algebraic theories of concurrency (context) - van Glabbeek, Vaandrager - 1987
15   On partial languages (context) - Grabowski - 1981
8   Series-parallel languages and the bounded-width property - Lodaya, Weil - 2000
5   Processes in Petri nets (context) - Starke - 1981
4   safe Petri nets to pomset-equivalent 1-safe Petri nets (context) - Best, Wimmel - 2000
3   Behaviours of concurrent systems (context) - Winkowski - 1980
2   Rationality in algebras with a series operation - Lodaya, Weil - 2001
2   A logical approach of Petri net languages (context) - Parigot, Pelz - 1985
2   Network algebra (context) - tef - 2000
1   A uni ed model for nets and process algebras (context) - Best, Devillers et al. - 2000
1   A partial order semantics for CCS (context) - Degano, de Nicola et al. - 1990
1   On representing CCS programs by nite Petri nets (context) - Goltz, Mycroft - 1984
1   free pomsets are monadically axiomatizable (context) - Kuske, of - 2002
1   Process semantucs of Petri nets over partial algebra (context) - Desel, Juh et al. - 2000
1   Automata on series-parallel biposets (context) - Esik, emeth - 2002
1   Fundamentals of a theory of asynchronous information ow (context) - Petri - 1962

Documents on the same site (http://www.imsc.ernet.in/~kamal/):   More
Series-Parallel Languages and the Bounded-Width Property - Lodaya, Weil (1998)   (Correct)
A Kleene iteration for parallelism - Lodaya, Weil (1998)   (Correct)
Series-Parallel Posets: Algebra, Automata and Languages - Lodaya, Weil   (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