2 Search Results for "Raffaetà, Alessandra"

Document
DOI: 10.4230/DagRep.12.1.35
Mobility Data Mining: from Technical to Ethical (Dagstuhl Seminar 22022)

Authors: Bettina Berendt, Stan Matwin, Chiara Renso, Fran Meissner, Francesca Pratesi, Alessandra Raffaetà, and Geoffrey Rockwell

Published in: Dagstuhl Reports, Volume 12, Issue 1 (2022)

Abstract
This report documents the program and the outcomes of Dagstuhl Seminar 22022 "Mobility Data Analysis: from Technical to Ethical" that took place fully remote and hosted by Schloss Dagstuhl from 10-12 January 2022. An interdisciplinary team of 23 researchers from Europe, the Americas and Asia in the fields of computer science, ethics and mobility analysis discussed interactions between their topics and fields to bridge the gap between the more technical aspects to the ethics with the objective of laying the foundations of a new Mobility Data Ethics research field.
Cite as

Bettina Berendt, Stan Matwin, Chiara Renso, Fran Meissner, Francesca Pratesi, Alessandra Raffaetà, and Geoffrey Rockwell. Mobility Data Mining: from Technical to Ethical (Dagstuhl Seminar 22022). In Dagstuhl Reports, Volume 12, Issue 1, pp. 35-66, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)

Copy BibTex To Clipboard

@Article{berendt_et_al:DagRep.12.1.35,
  author =	{Berendt, Bettina and Matwin, Stan and Renso, Chiara and Meissner, Fran and Pratesi, Francesca and Raffaet\`{a}, Alessandra and Rockwell, Geoffrey},
  title =	{{Mobility Data Mining: from Technical to Ethical (Dagstuhl Seminar 22022)}},
  pages =	{35--66},
  journal =	{Dagstuhl Reports},
  ISSN =	{2192-5283},
  year =	{2022},
  volume =	{12},
  number =	{1},
  editor =	{Berendt, Bettina and Matwin, Stan and Renso, Chiara},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/DagRep.12.1.35},
  URN =		{urn:nbn:de:0030-drops-169200},
  doi =		{10.4230/DagRep.12.1.35},
  annote =	{Keywords: Dagstuhl Report, Mobility Data Mining: from Technical to Ethical}
}
Document
DOI: 10.4230/LIPIcs.FSTTCS.2019.30
Minimisation of Event Structures

Authors: Paolo Baldan and Alessandra Raffaetà

Published in: LIPIcs, Volume 150, 39th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2019)

Abstract
Event structures are fundamental models in concurrency theory, providing a representation of events in computation and of their relations, notably concurrency, conflict and causality. In this paper we present a theory of minimisation for event structures. Working in a class of event structures that generalises many stable event structure models in the literature, (e.g., prime, asymmetric, flow and bundle event structures) we study a notion of behaviour-preserving quotient, taking hereditary history preserving bisimilarity as a reference behavioural equivalence. We show that for any event structure a uniquely determined minimal quotient always exists. We observe that each event structure can be seen as the quotient of a prime event structure, and that quotients of general event structures arise from quotients of (suitably defined) corresponding prime event structures. This gives a special relevance to quotients in the class of prime event structures, which are then studied in detail, providing a characterisation and showing that also prime event structures always admit a unique minimal quotient.
Cite as

Paolo Baldan and Alessandra Raffaetà. Minimisation of Event Structures. In 39th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 150, pp. 30:1-30:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)

Copy BibTex To Clipboard

@InProceedings{baldan_et_al:LIPIcs.FSTTCS.2019.30,
  author =	{Baldan, Paolo and Raffaet\`{a}, Alessandra},
  title =	{{Minimisation of Event Structures}},
  booktitle =	{39th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2019)},
  pages =	{30:1--30:15},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-131-3},
  ISSN =	{1868-8969},
  year =	{2019},
  volume =	{150},
  editor =	{Chattopadhyay, Arkadev and Gastin, Paul},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2019.30},
  URN =		{urn:nbn:de:0030-drops-115923},
  doi =		{10.4230/LIPIcs.FSTTCS.2019.30},
  annote =	{Keywords: Event structures, minimisation, history-preserving bisimilarity, behaviour-preserving quotient}
}
  • Refine by Author
  • 2 Raffaetà, Alessandra
  • 1 Baldan, Paolo
  • 1 Berendt, Bettina
  • 1 Matwin, Stan
  • 1 Meissner, Fran
  • Show More...

  • Refine by Classification
  • 1 Computing methodologies → Artificial intelligence
  • 1 Computing methodologies → Machine learning
  • 1 Human-centered computing → Interaction design
  • 1 Security and privacy → Database and storage security
  • 1 Security and privacy → Human and societal aspects of security and privacy
  • Show More...

  • Refine by Keyword
  • 1 Dagstuhl Report
  • 1 Event structures
  • 1 Mobility Data Mining: from Technical to Ethical
  • 1 behaviour-preserving quotient
  • 1 history-preserving bisimilarity
  • Show More...

  • Refine by Type
  • 2 document

  • Refine by Publication Year
  • 1 2019
  • 1 2022

Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail
© 2023-2024 Schloss Dagstuhl – LZI GmbH Imprint Privacy Contact