CRIS Current Research Information System
IRIS è la soluzione IT che facilita la raccolta e la gestione dei dati relativi alle attività e ai prodotti della ricerca. Fornisce a ricercatori, amministratori e valutatori gli strumenti per monitorare i risultati della ricerca, aumentarne la visibilità e allocare in modo efficace le risorse disponibili.
EnglishWe clarify the relationship between picalc and finite p/t Petri nets. The first insight is that the concurrency view to processes taken in cite{Engelfriet1996,AmadioMeyssonnier2002,BusiGorrieri2009} and the structural view in cite{Meyer2009StructStat} are orthogonal. This allows us to define a new concurrency p/t net semantics that can be combined with the structural semantics in cite{Meyer2009StructStat}. The result is a more expressive mixed semantics, which translates precisely the so-called mixed-bounded processes into finite p/t nets. Technically, the translation relies on typing of restricted names. As second main result we show that mixed-bounded processes form the borderline to finite p/t nets. For processes just beyond this class reachability becomes undecidable and so no faithful translation into finite p/t nets exists.
| Titolo: | On the Relationship between π-Calculus and Finite Place/Transition Petri Nets |
| Autore/i: | R. Meyer; GORRIERI, ROBERTO |
| Autore/i Unibo: | |
| Anno: | 2009 |
| Titolo del libro: | Lecture Notes in Computer Science |
| Pagina iniziale: | 463 |
| Pagina finale: | 480 |
| Abstract: | We clarify the relationship between picalc and finite p/t Petri nets. The first insight is that the concurrency view to processes taken in cite{Engelfriet1996,AmadioMeyssonnier2002,BusiGorrieri2009} and the structural view in cite{Meyer2009StructStat} are orthogonal. This allows us to define a new concurrency p/t net semantics that can be combined with the structural semantics in cite{Meyer2009StructStat}. The result is a more expressive mixed semantics, which translates precisely the so-called mixed-bounded processes into finite p/t nets. Technically, the translation relies on typing of restricted names. As second main result we show that mixed-bounded processes form the borderline to finite p/t nets. For processes just beyond this class reachability becomes undecidable and so no faithful translation into finite p/t nets exists. |
| Data prodotto definitivo in UGOV: | 16-dic-2009 |
| Appare nelle tipologie: | 4.01 Contributo in Atti di convegno |
File in questo prodotto:
Copyright © 2020