Please use this identifier to cite or link to this item:
https://hdl.handle.net/11147/14194
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Adobbati, Federica | - |
dc.contributor.author | Bernardinello, Luca | - |
dc.contributor.author | Kılınç Soylu, Görkem | - |
dc.contributor.author | Pomello, Lucia | - |
dc.date.accessioned | 2024-01-06T07:22:34Z | - |
dc.date.available | 2024-01-06T07:22:34Z | - |
dc.date.issued | 2024 | - |
dc.identifier.isbn | 9783662681909 | - |
dc.identifier.issn | 0302-9743 | - |
dc.identifier.uri | https://doi.org/10.1007/978-3-662-68191-6_3 | - |
dc.identifier.uri | https://hdl.handle.net/11147/14194 | - |
dc.description | 43rd International Conference on Application and Theory of Petri Nets and Concurrency , Petri Nets 2022 -- 22 June 2022 through 24 June 2022 | en_US |
dc.description.abstract | In a distributed system, in which an action can be either “hidden” or “observable”, an unwanted information flow might arise when occurrences of observable actions give information about occurrences of hidden actions. A collection of relations, i.e. reveals and its variants, is used to model such information flow among transitions of a Petri net. This paper recalls the reveals relations defined in [3], and proposes an algorithm to compute them on bounded equal-conflict PT systems, using a smaller structure than the one defined in [3]. © 2024, The Author(s), under exclusive license to Springer-Verlag GmbH, DE, part of Springer Nature. | en_US |
dc.language.iso | en | en_US |
dc.publisher | Springer | en_US |
dc.relation.ispartof | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) | en_US |
dc.rights | info:eu-repo/semantics/closedAccess | en_US |
dc.subject | Bounded equal-conflict Petri nets | en_US |
dc.subject | Distributed systems | en_US |
dc.subject | Information flow | en_US |
dc.subject | Noninterference | en_US |
dc.subject | Reveals relations | en_US |
dc.subject | Bounded equal-conflict petri net | en_US |
dc.subject | Distributed systems | en_US |
dc.title | Computing a parametric reveals relation for bounded equal-conflict Petri nets | en_US |
dc.type | Conference Object | en_US |
dc.authorid | 0000-0002-7047-0556 | - |
dc.institutionauthor | Kılınç Soylu, Görkem | - |
dc.department | İzmir Institute of Technology. Computer Engineering | en_US |
dc.identifier.volume | 14150 LNCS | en_US |
dc.identifier.startpage | 54 | en_US |
dc.identifier.endpage | 83 | en_US |
dc.identifier.scopus | 2-s2.0-85177236382 | en_US |
dc.relation.publicationcategory | Konferans Öğesi - Uluslararası - Kurum Öğretim Elemanı | en_US |
dc.identifier.doi | 10.1007/978-3-662-68191-6_3 | - |
dc.authorscopusid | 57209282556 | - |
dc.authorscopusid | 22733831400 | - |
dc.authorscopusid | 58701065700 | - |
dc.authorscopusid | 22735111500 | - |
dc.identifier.wosquality | N/A | - |
dc.identifier.scopusquality | Q3 | - |
item.fulltext | No Fulltext | - |
item.grantfulltext | none | - |
item.languageiso639-1 | en | - |
item.openairecristype | http://purl.org/coar/resource_type/c_18cf | - |
item.cerifentitytype | Publications | - |
item.openairetype | Conference Object | - |
Appears in Collections: | Computer Engineering / Bilgisayar Mühendisliği Scopus İndeksli Yayınlar Koleksiyonu / Scopus Indexed Publications Collection |
CORE Recommender
Items in GCRIS Repository are protected by copyright, with all rights reserved, unless otherwise indicated.