Grégoire Sutre

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 M. Praveen

> Home > Persons > Grégoire Sutre

Publications

2019
[j4]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/lmcs/LerouxPSS19
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/lmcs/LerouxPSS19
Jérôme Leroux, M. Praveen, Philippe Schnoebelen, Grégoire Sutre:
On Functions Weakly Computable by Pushdown Petri Nets and Related Systems. Log. Methods Comput. Sci. 15(4) (2019)
[i7]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/abs-1904-04090
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-1904-04090
Jérôme Leroux, M. Praveen, Philippe Schnoebelen, Grégoire Sutre:
On Functions Weakly Computable by Pushdown Petri Nets and Related Systems. CoRR abs/1904.04090 (2019)
2014
[c24]
- view
  authority control:
- export record
  dblp key:
  - conf/csl/LerouxPS14
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/csl/LerouxPS14
Jérôme Leroux, M. Praveen, Grégoire Sutre:
Hyper-Ackermannian bounds for pushdown vector addition systems. CSL-LICS 2014: 63:1-63:10
2013
[c23]
- view
  authority control:
- export record
  dblp key:
  - conf/concur/LerouxPS13
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/concur/LerouxPS13
Jérôme Leroux, M. Praveen, Grégoire Sutre:
A Relational Trace Logic for Vector Addition Systems with Application to Context-Freeness. CONCUR 2013: 137-151

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.