Daniele Gorla

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Paolo Baldan

> Home > Persons > Daniele Gorla

Publications

2022
[j31]
- view
  authority control:
- export record
  dblp key:
  - journals/iandc/BaldanGPS22
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/iandc/BaldanGPS22
Paolo Baldan, Daniele Gorla, Tommaso Padoan, Ivano Salvo:
Characterising spectra of equivalences for event structures, logically. Inf. Comput. 285(Part): 104887 (2022)
[j30]
- view
  authority control:
- export record
  dblp key:
  - journals/tcs/BaldanGPS22
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tcs/BaldanGPS22
Paolo Baldan, Daniele Gorla, Tommaso Padoan, Ivano Salvo:
Behavioural logics for configuration structures. Theor. Comput. Sci. 913: 94-112 (2022)
2017
[j19]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/iandc/BaldanG17
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/iandc/BaldanG17
Paolo Baldan, Daniele Gorla:
Preface. Inf. Comput. 252: 1 (2017)
2014
[e4]
- view
  authority control:
- export record
  dblp key:
  - conf/concur/2014
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/concur/2014
Paolo Baldan, Daniele Gorla:
CONCUR 2014 - Concurrency Theory - 25th International Conference, CONCUR 2014, Rome, Italy, September 2-5, 2014. Proceedings. Lecture Notes in Computer Science 8704, Springer 2014, ISBN 978-3-662-44583-9 [contents]

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.