Dialog
Dialog Support   >   "How Do I...?" Series   >   Engineering & Technology
Dialog "How Do I...?" - Engineering & Technology

Find Who Has Cited a Particular Author?

TOPIC: Another way to find an expert on a topic is to see how many times an author is cited by other researchers in the same subject area. SciSearch®: A Cited Reference Database (File 34,434) is a good source for cited references.

In this example we want to find out who and how many times Eric Badouel, whom we saw had written about petrinets (54709), has been cited by other authors.

 

COMMAND SUMMARY

BEGIN 34
EXPAND CR=BADOUEL E

SELECT E4:E50
Page down to next list of entries
SELECT E1:E24
SELECT S1 OR S2

TYPE S3/9/1


HOW TO...



1. BEGIN File 34, SciSearch, with coverage from 1990 to the present.


?b 34

File  34:SciSearch(R) Cited Ref Sci 1990-2008/May W4
       (c) 2008 The Thomson Corp

      Set  Items  Description
      ---  -----  ----------


2. EXPAND the cited reference name (CR=) to see who has cited this author.

 

Note: A number of entries are omitted from this display.

 

3. SELECT appropriate E numbers before using P or Page for more entries. The next list of entries will start at E1 again.


?e cr=badouel e 

Ref   Items  Index-term
E1        1  CR=BADOUEL D, 1996, V1, P98, EUR C PAR PROC
E2        2  CR=BADOUEL D, 1996, V1123, P98, LNCS
E3        0 *CR=BADOUEL E
E4        1  CR=BADOUEL E, P CONCUR 92
E5        1  CR=BADOUEL E, P MFCS 89
E6        1  CR=BADOUEL E, 1987, INRIARR764
E7        1  CR=BADOUEL E, 1990, INRIA1226 TECHN REP
E8        1  CR=BADOUEL E, 1990, INRIA1249 TECHN REP
E9        1  CR=BADOUEL E, 1990, IRISAPI535
E10       9  CR=BADOUEL E, 1991, V82, P403, THEOR COMPUT SCI
E11       1  CR=BADOUEL E, 1992, INRIA1631 RES REP
E12       1  CR=BADOUEL E, 1992, V629, PUBLICATION INTERNE
E13       2  CR=BADOUEL E, 1992, V630, P302, LECT NOTES COMPUT
E14       1  CR=BADOUEL E, 1992, V666, P21, LECT NOTES COMPUTE
. . . .
E46       1  CR=BADOUEL E, 1998, PI1163 IRISA
E47       1  CR=BADOUEL E, 1998, P129, P WORKFL MAN NET BAS
E48       1  CR=BADOUEL E, 1998, P201, MODELISATION VERIFIC
E49       1  CR=BADOUEL E, 1998, RECONFIGURABLE NETS
E50       1  CR=BADOUEL E, 1998, V1, P529, LECT PETRI NETS

Enter P or PAGE for more
?s e4:e50
      S1      67  CR='BADOUEL E, P CONCUR 92':CR='BADOUEL E,
                  1998, V1,P529, LECT PETRI NETS'


4. Use P to page down to the next list of entries in the index.

5. SELECT the appropriate E numbers.

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

6. Combine Sets 1 and 2 (S1, S2) using the OR connector.

Note that you can narrow the search using keywords (e.g., s s3 and (petri()net? or petrinet?)


?p

Ref   Items  Index-term
E1        1  CR=BADOUEL E, 1998, V1, P529, LECT PETRI NETS
E2        1  CR=BADOUEL E, 1998, V1163, PUBLICATION INTERNE
E3        1  CR=BADOUEL E, 1998, V1163, PUBLICATION IRISA
E4        2  CR=BADOUEL E, 1998, V1279, P529, LECT NOTES COMPU
E5        2  CR=BADOUEL E, 1998, V1491, P529, LECT NOTES COMPU
E6       29  CR=BADOUEL E, 1998, V1491, P529, LNCS
E7        1  CR=BADOUEL E, 1998, 3 ADV COURSE PETRI N
E8        1  CR=BADOUEL E, 1998, 3490 INRIA
E9        1  CR=BADOUEL E, 1999, PI3708 INR RES
E10       2  CR=BADOUEL E, 1999, P11, P PAR DISTR PROC TEC
E11       1  CR=BADOUEL E, 1999, P129, WORKSH 19 INT C APPL
E12       1  CR=BADOUEL E, 1999, THESIS U RENNES
E13       1  CR=BADOUEL E, 1999, V1253, PUBLICATION INTERNE
E14       1  CR=BADOUEL E, 1999, V31, THESIS
E15       1  CR=BADOUEL E, 2001, ADV PETRI NETS
E16       1  CR=BADOUEL E, 2001, P304, LECT NOTES COMPUTER
E17       1  CR=BADOUEL E, 2001, V2128, P304, LECT NOTES COMPU
E18       3  CR=BADOUEL E, 2002, V13, P447, FORMAL ASPECTS COM
E19       1  CR=BADOUEL E, 2003, UNPUB SYNTHESIS PETR
E20       2  CR=BADOUEL E, 2003, V2679, P64, LECT NOTES COMPUT
E21       1  CR=BADOUEL E, 2003, V4, P1568, P INT C PAR DISTR
E22       2  CR=BADOUEL E, 2003, V4, P1568, P PAR DISTR PROC T
E23       1  CR=BADOUEL E, 2004, V193, P117, INFORM COMPUT
E24       1  CR=BADOUEL E, 2004, 5355 INR
E25       1  CR=BADOUEL F, 1990, P390, GRAPHIC GEMS
E26       1  CR=BADOUEL, 1990, RAY TRACING DISTRIBU
E27       1  CR=BADOUEL, 1990, SIGGRAPH
E28       1  CR=BADOUEL, 1994, IEEE COMPUT GRAP JUL
E29       1  CR=BADOUI AEL, 1983, THESIS I NATIONAL PO
E30       1  CR=BADOUI M, UNPUB

Enter P or PAGE for more

?s e1:e24
      S2      47  CR='BADOUEL E, 1998, V1, P529, LECT PETRI
                  NETS':CR='BADOUEL E, 2004, 5355 INR'

?s s1 or s2
              67  S1
              47  S2
      S3      93  S1 OR S2


7. TYPE out records in Format 9 to see the cited references.


?t s3/9/1

3/9/1
DIALOG(R)File 34: SciSearch(R) Cited Ref Sci
(c) 2008 The Thomson Corp. All rights reserved.

17502100   Genuine Article#: 268YT   Number of References: 26
Self-evolving Petri Nets

Author: Capra L (REPRINT) ; Cazzola W
Corporate Source: Univ Milan,Dept Informat Commun,I-20122 Milan//Italy/ (REPRINT); Univ Milan,Dept Informat Commun,I-20122 Milan//Italy/
Journal: JOURNAL OF UNIVERSAL COMPUTER SCIENCE , 2007 , V 13 ,
N13, P 2002-2034
ISSN: 0948-695X   Publication date: 20070000
Publisher: GRAZ UNIV TECHNOLGOY, INST INFORMATION SYSTEMS
COMPUTER MEDIA-IICM , INFFELDGASSE 16C, GRAZ, A-8010, AUSTRIA
Language: English   Document Type: ARTICLE
Geographic Location: Italy
Journal Subject Category: COMPUTER SCIENCE, SOFTWARE
ENGINEERING; COMPUTER SCIENCE, THEORY & METHODS
Abstract: Nowadays, software evolution is a very hot topic.
It is particularly complex when it regards critical and
nonstopping systems. Usually, these situations are tackled
by hard- coding all the foreseeable evolutions in the
application design and code.

        Neglecting the obvious difficulties in pursuing this approach, we also get the application code and design
polluted with details that do not regard the current system functionality, and that hamper design analysis, code reuse
and application maintenance in general. Petri Nets ( PN),
as a formalism for modeling and designing distributed/
concurrent software systems, are not exempt from this issue.

       The goal of this work is to propose a PN based
reflective framework that lets everyone model a system
able to evolve, keeping separated functional aspects from evolutionary ones and applying evolution to the model only
if necessary. Such an approach tries to keep system's model
as simple as possible, preserving ( and exploiting) ability
of formally verifying system properties typical of PN,
granting at the same time adaptability.
Descriptors--Author Keywords: Petri Nets; reflection;
software evolution
Cited References:
    ASPERTI A, 1996, UBLCS9610 U STUD BOL
   BADOUEL E, 1998, PI1163 IRISA
   BADOUEL E, 1997, V1279, P117, LECT NOTES COMPUT SC

   BERNARDI S, 2001, V3, P417, J SOFTWARE TOOLS TEC
   BEST E, 1986, V255, P416, LECTURE NOTES COMPUT
. . . .


RELATED HOW DO I...? SOLUTIONS

 

 

NEED HELP?

Contact the Dialog Knowledge Center
Within North America +1 800 3 DIALOG (334 2564)
Outside North America 00 800 33 DIALOG (33 34 2564)
Web Form www.dialog.com/contacts/webform

Stock #: 54710; Last modified: 14 Sep 2011



You are viewing the
Dialog Classic Version

Click below to view the
DialogLink 5 Version
Dialog Home   |   About Dialog   |   Site Search
Copyright Notices   |   Terms of Use   |   Privacy Statement