Specification of Concurrent Systems: from Petri Nets to Graph Grammars

A. Corradini () and U. Montanari ()
Additional contact information
A. Corradini: Università di Pisa, Dipartimento di Informatica
U. Montanari: Università di Pisa, Dipartimento di Informatica

A chapter in Quality of Communication-Based Systems, 1995, pp 35-52 from Springer

Abstract: Abstract We first review some aspects of Place/Transition Petri nets, which are the basis of their success as a specification formalism for con-current and distributed systems. In particular, we summarize some re-sults concerning the truly-concurrent semantics of safe nets, stressing the fruitful use of categorical techniques. Next we discuss the use of Graph Grammars (according to the alge-braic, double-pushout approach) as a specification formalism, showing that they are strictly more expressive than P/T nets. We also describe the state of the art of research activities aimed at providing graph gram-mars with a categorical truly-concurrent semantics.

Keywords: Event Structure; Graph Production; Graph Grammar; Semantic Domain; Firing Sequence (search for similar items in EconPapers)
Date: 1995
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-94-011-0187-5_3

Ordering information: This item can be ordered from
http://www.springer.com/9789401101875

DOI: 10.1007/978-94-011-0187-5_3

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().