Timed Catalytic Petri Nets

PINNA, GIOVANNI MICHELE
2012-01-01

Abstract

We consider catalytic membrane systems (CatMS) and catalytic Petri nets (CatPN). We add discrete timers to these classes, and prove that the timed formalisms ($tCatMS$ and $tCatPN$) can be expressed by their untimed versions if finite timers are used. We establish formal links between these formalisms, and characterize some subclasses in which various properties are decidable and can be analyzed using CPN Tools, i.e., a software tool for editing, simulating, and analyzing colored Petri nets.
2012
Inglese
Proceeding 14th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, SYNASC 2012, Timisoara, Romania, September 26-29, 2012
978-1-4673-5026-6
IEEE Computer Society
Los Alamitos, CA
319
326
8
14th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, SYNASC 2012
Esperti anonimi
26 September 2012 through 29 September 2012
Timisoara, Romania,
internazionale
scientifica
4 Contributo in Atti di Convegno (Proceeding)::4.1 Contributo in Atti di convegno
Aman, Bogdan; Ciobanu, Gabriel; Pinna, GIOVANNI MICHELE
273
3
4.1 Contributo in Atti di convegno
none
info:eu-repo/semantics/conferencePaper
Files in This Item:
There are no files associated with this item.

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.

Questionnaire and social

Share on:
Impostazioni cookie