scientific article; zbMATH DE number 1231483
From MaRDI portal
Publication:4222788
zbMath0910.68109MaRDI QIDQ4222788
Publication date: 13 December 1998
Full work available at URL: http://www.elsevier.com/cas/tree/store/tcs/free/noncas/pc/volume2.htm#corradini2
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Grammars and rewriting systems (68Q42)
Related Items (3)
Concurrent graph and term graph rewriting ⋮ An event structure semantics for graph grammars with parallel productions ⋮ Modeling Petri Nets by Local Action Systems1 1Partially supported by the EC TMR Network GETGRATS (General Theory of Graph Transformation Systems) and Esprit Working Group APPLIGRAPH through Universitaire Instelling Antwerpen.
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Petri nets are monoids
- Petri nets: central models and their properties. Advances in Petri nets 1986, Part I. Proceedings of an advanced course, Bad Honnef, September 8--19, 1986
- Graph-grammars and their application to computer science. 3rd International Workshop, Warrenton, Virginia, USA, December 2-6, 1986
- Petri nets, event structures and domains. I
- Contextual nets
- Parallelism and concurrency in high-level replacement systems
- On the semantics of place/transition Petri nets
- A categorical manifesto
This page was built for publication: