CINECA IRIS Institutional 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 compare the expressive power of a class of well-structured transition systems that includes relational automata (extensions of), Petri nets, lossy channel systems, constrained multiset rewriting systems, and data nets. For each one of these models we study the class of languages generated by labeled transition systems describing their semantics. We consider here two types of accepting conditions: coverability and reachability of a fixed a priori configuration. In both cases we obtain a strict hierarchy in which constrained multiset rewriting systems is the most expressive model.
A classification of the expressive power of well-structured transition systems. / ABDULLA P; G. DELZANNO; VAN BEGIN L. - In: INFORMATION AND COMPUTATION. - ISSN 0890-5401. - STAMPA. - 209(3)(2011), pp. 248-279.
Scheda prodotto non validato
Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo
| Titolo: | A classification of the expressive power of well-structured transition systems. |
| Autori: | |
| Data di pubblicazione: | 2011 |
| Rivista: | |
| Citazione: | A classification of the expressive power of well-structured transition systems. / ABDULLA P; G. DELZANNO; VAN BEGIN L. - In: INFORMATION AND COMPUTATION. - ISSN 0890-5401. - STAMPA. - 209(3)(2011), pp. 248-279. |
| Abstract: | We compare the expressive power of a class of well-structured transition systems that includes relational automata (extensions of), Petri nets, lossy channel systems, constrained multiset rewriting systems, and data nets. For each one of these models we study the class of languages generated by labeled transition systems describing their semantics. We consider here two types of accepting conditions: coverability and reachability of a fixed a priori configuration. In both cases we obtain a strict hierarchy in which constrained multiset rewriting systems is the most expressive model. |
| Handle: | http://hdl.handle.net/11567/255676 |
| Appare nelle tipologie: | 01.01 - Articolo su rivista |
File in questo prodotto:
http://hdl.handle.net/11567/255676
Copyright © 2021