ask others

Pierre McKenzie

◀ ▶ joint publications with Alain Finkel

> Home > Persons > Pierre McKenzie
> Home > Persons > Alain Finkel

Publications

2018
[j39]
- view
  - electronic edition via DOI
- export record
  dblp key:
  - journals/iandc/BlondinFM18
- ask others
- share record
  short URL:
  - https://dblp.org/rec/journals/iandc/BlondinFM18
Michael Blondin, Alain Finkel, Pierre McKenzie:
Handling infinitely branching well-structured transition systems. Inf. Comput. 258: 28-49 (2018)
2017
[j38]
- view
  - electronic edition via DOI
- export record
  dblp key:
  - journals/lmcs/BlondinFM17
- ask others
- share record
  short URL:
  - https://dblp.org/rec/journals/lmcs/BlondinFM17
Michael Blondin, Alain Finkel, Pierre McKenzie:
Well Behaved Transition Systems. Logical Methods in Computer Science 13(3) (2017)
2016
[i14]
- view
  - electronic edition @ arxiv.org
- export record
  dblp key:
  - journals/corr/BlondinFM16
- ask others
- share record
  short URL:
  - https://dblp.org/rec/journals/corr/BlondinFM16
Michael Blondin, Alain Finkel, Pierre McKenzie:
Well Behaved Transition Systems. CoRR abs/1608.02636 (2016)
2015
[c40]
- view
- export record
  dblp key:
  - conf/lics/BlondinFGHM15
- ask others
- share record
  short URL:
  - https://dblp.org/rec/conf/lics/BlondinFGHM15
Michael Blondin, Alain Finkel, Stefan Göller, Christoph Haase, Pierre McKenzie:
Reachability in Two-Dimensional Vector Addition Systems with States Is PSPACE-Complete. LICS 2015: 32-43
2014
[c39]
- view
  - electronic edition via DOI
- export record
  dblp key:
  - conf/icalp/BlondinFM14
- ask others
- share record
  short URL:
  - https://dblp.org/rec/conf/icalp/BlondinFM14
Michael Blondin, Alain Finkel, Pierre McKenzie:
Handling Infinitely Branching WSTS. ICALP (2) 2014: 13-25
[i13]
- view
  - electronic edition @ arxiv.org
- export record
  dblp key:
  - journals/corr/BlondinFGHM14
- ask others
- share record
  short URL:
  - https://dblp.org/rec/journals/corr/BlondinFGHM14
Michael Blondin, Alain Finkel, Stefan Göller, Christoph Haase, Pierre McKenzie:
Reachability in Two-Dimensional Vector Addition Systems with States is PSPACE-complete. CoRR abs/1412.4259 (2014)
[i12]
- view
  - electronic edition via DOI
- export record
  dblp key:
  - journals/dagstuhl-reports/EsparzaFMO14
- ask others
- share record
  short URL:
  - https://dblp.org/rec/journals/dagstuhl-reports/EsparzaFMO14
Javier Esparza, Alain Finkel, Pierre McKenzie, Joël Ouaknine:
Reachability Problems for Infinite-State Systems (Dagstuhl Seminar 14141). Dagstuhl Reports 4(3): 153-180 (2014)
2013
[j34]
- view
  - electronic edition via DOI
- export record
  dblp key:
  - journals/ijfcs/CadilhacFM13
- ask others
- share record
  short URL:
  - https://dblp.org/rec/journals/ijfcs/CadilhacFM13
Michaël Cadilhac, Alain Finkel, Pierre McKenzie:
Unambiguous constrained Automata. Int. J. Found. Comput. Sci. 24(7): 1099-1116 (2013)
2012
[j33]
- view
  - electronic edition via DOI
- export record
  dblp key:
  - journals/ijfcs/CadilhacFM12
- ask others
- share record
  short URL:
  - https://dblp.org/rec/journals/ijfcs/CadilhacFM12
Michaël Cadilhac, Alain Finkel, Pierre McKenzie:
Bounded Parikh Automata. Int. J. Found. Comput. Sci. 23(8): 1691-1710 (2012)
[j32]
- view
  - electronic edition via DOI
- export record
  dblp key:
  - journals/ita/CadilhacFM12
- ask others
- share record
  short URL:
  - https://dblp.org/rec/journals/ita/CadilhacFM12
Michaël Cadilhac, Alain Finkel, Pierre McKenzie:
Affine Parikh automata. RAIRO - Theor. Inf. and Applic. 46(4): 511-545 (2012)
[c34]
- view
  - electronic edition via DOI
- export record
  dblp key:
  - conf/dlt/CadilhacFM12
- ask others
- share record
  short URL:
  - https://dblp.org/rec/conf/dlt/CadilhacFM12
Michaël Cadilhac, Alain Finkel, Pierre McKenzie:
Unambiguous Constrained Automata. Developments in Language Theory 2012: 239-250
2011
[c32]
- no documents available
- export record
  dblp key:
  - conf/ncma/CadilhacFM11
- ask others
- share record
  short URL:
  - https://dblp.org/rec/conf/ncma/CadilhacFM11
Michaël Cadilhac, Alain Finkel, Pierre McKenzie:
On the Expressiveness of Parikh Automata and Related Models. NCMA 2011: 103-119
[c31]
- view
  - electronic edition via DOI
  - electronic edition @ arxiv.org
- export record
  dblp key:
  - journals/corr/abs-1108-3625
- ask others
- share record
  short URL:
  - https://dblp.org/rec/journals/corr/abs-1108-3625
Michaël Cadilhac, Alain Finkel, Pierre McKenzie:
Bounded Parikh Automata. WORDS 2011: 93-102
[i9]
- view
  - electronic edition @ arxiv.org
- export record
  dblp key:
  - journals/corr/abs-1101-1547
- ask others
- share record
  short URL:
  - https://dblp.org/rec/journals/corr/abs-1101-1547
Michaël Cadilhac, Alain Finkel, Pierre McKenzie:
Storming the Parikh Automaton. CoRR abs/1101.1547 (2011)
2004
[j23]
- view
  - electronic edition via DOI
- export record
  dblp key:
  - journals/iandc/FinkelMP04
- ask others
- share record
  short URL:
  - https://dblp.org/rec/journals/iandc/FinkelMP04
Alain Finkel, Pierre McKenzie, Claudine Picaronny:
A well-structured framework for analysing petri net extensions. Inf. Comput. 195(1-2): 1-29 (2004)
1997
[j12]
- view
  - electronic edition via DOI
- export record
  dblp key:
  - journals/tcs/FinkelM97
- ask others
- share record
  short URL:
  - https://dblp.org/rec/journals/tcs/FinkelM97
Alain Finkel, Pierre McKenzie:
Verifying Identical Communicating Processes is Undecidable. Theor. Comput. Sci. 174(1-2): 217-230 (1997)

maintained by

at