Computing a Parametric Reveals Relation for Bounded Equal-Conflict Petri Nets
| 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.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.identifier.doi | 10.1007/978-3-662-68191-6_3 | |
| dc.identifier.isbn | 9783662681909 | |
| dc.identifier.issn | 0302-9743 | |
| dc.identifier.scopus | 2-s2.0-85177236382 | |
| dc.identifier.uri | https://doi.org/10.1007/978-3-662-68191-6_3 | |
| dc.identifier.uri | https://hdl.handle.net/11147/14194 | |
| 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 |
| dspace.entity.type | Publication | |
| gdc.author.id | 0000-0002-7047-0556 | |
| gdc.author.institutional | Kılınç Soylu, Görkem | |
| gdc.author.scopusid | 57209282556 | |
| gdc.author.scopusid | 22733831400 | |
| gdc.author.scopusid | 58701065700 | |
| gdc.author.scopusid | 22735111500 | |
| gdc.bip.impulseclass | C5 | |
| gdc.bip.influenceclass | C5 | |
| gdc.bip.popularityclass | C5 | |
| gdc.coar.access | metadata only access | |
| gdc.coar.type | text::conference output | |
| gdc.collaboration.industrial | false | |
| gdc.description.department | İzmir Institute of Technology. Computer Engineering | en_US |
| gdc.description.endpage | 83 | en_US |
| gdc.description.publicationcategory | Konferans Öğesi - Uluslararası - Kurum Öğretim Elemanı | en_US |
| gdc.description.scopusquality | Q3 | |
| gdc.description.startpage | 54 | en_US |
| gdc.description.volume | 14150 LNCS | en_US |
| gdc.identifier.openalex | W4388045178 | |
| gdc.index.type | Scopus | |
| gdc.oaire.diamondjournal | false | |
| gdc.oaire.impulse | 0.0 | |
| gdc.oaire.influence | 2.635068E-9 | |
| gdc.oaire.isgreen | false | |
| gdc.oaire.keywords | Bounded equal-conflict Petri nets; Distributed systems; Information flow; Noninterference; Reveals relations; | |
| gdc.oaire.popularity | 2.588463E-9 | |
| gdc.oaire.publicfunded | false | |
| gdc.openalex.collaboration | International | |
| gdc.openalex.fwci | 0.0 | |
| gdc.openalex.normalizedpercentile | 0.54 | |
| gdc.opencitations.count | 0 | |
| gdc.plumx.scopuscites | 1 | |
| gdc.scopus.citedcount | 1 | |
| relation.isOrgUnitOfPublication.latestForDiscovery | 9af2b05f-28ac-4003-8abe-a4dfe192da5e |