×

zbMATH — the first resource for mathematics

Schnoebelen, Philippe

Compute Distance To:
Author ID: schnoebelen.philippe Recent zbMATH articles by "Schnoebelen, Philippe"
Published as: Schnoebelen, P.; Schnoebelen, Ph.; Schnoebelen, Philippe
External Links: MGP · dblp
Documents Indexed: 88 Publications since 1987, including 2 Books

Publications by Year

Citations contained in zbMATH Open

73 Publications have been cited 590 times in 365 Documents Cited by Year
Well-structured transition systems everywhere! Zbl 0973.68170
Finkel, A.; Schnoebelen, P.
112
2001
Reset nets between decidability and undecidability. Zbl 0909.68124
Dufourd, C.; Finkel, A.; Schnoebelen, Ph.
41
1998
The complexity of propositional linear temporal logics in simple cases. Zbl 1009.68072
Demri, Stéphane; Schnoebelen, Philippe
24
2002
Verifying lossy channel systems has nonprimitive recursive complexity. Zbl 1043.68016
Schnoebelen, Ph.
23
2002
Systems and software verification. Model-checking techniques and tools. Zbl 1002.68029
Bérard, B.; Bidoit, M.; Finkel, A.; Laroussinie, F.; Petit, A.; Petrucci, L.; Schnoebelen, Ph.; McKenzie, P.
21
2001
Revisiting Ackermann-hardness for lossy counter machines and reset Petri nets. Zbl 1287.68059
Schnoebelen, Philippe
19
2010
Model checking a path (preliminary report). Zbl 1274.68197
Markey, N.; Schnoebelen, P.
16
2003
Model checking timed automata with one or two clocks. Zbl 1099.68057
Laroussinie, F.; Markey, N.; Schnoebelen, Ph.
14
2004
Specification in CTL + past for verification in CTL. Zbl 1046.68599
Laroussinie, F.; Schnoebelen, Ph.
14
2000
The regular viewpoint on PA-processes. Zbl 0932.68052
Lugiez, D.; Schnoebelen, Ph.
14
1998
Multiply-recursive upper bounds with Higman’s lemma. Zbl 1333.68179
Schmitz, S.; Schnoebelen, Ph.
13
2011
The complexity of temporal logic model checking. Zbl 1084.03013
Schnoebelen, Ph.
13
2003
Model checking \(\text{CTL}^+\) and FCTL is hard. Zbl 0986.68067
Laroussinie, François; Markey, Nicolas; Schnoebelen, Philippe
13
2001
Flat acceleration in symbolic model checking. Zbl 1170.68507
Bardin, Sébastien; Finkel, Alain; Leroux, Jérôme; Schnoebelen, Philippe
12
2005
The ordinal-recursive complexity of timed-arc Petri nets, data nets, and other enriched nets. Zbl 1362.68214
Haddad, Serge; Schmitz, Sylvain; Schnoebelen, Philippe
11
2012
Boundedness of reset P/T nets. Zbl 0943.68122
Dufourd, C.; Jancǎr, P.; Schnoebelen, Ph.
11
1999
Computable fixpoints in well-structured symbolic model checking. Zbl 1291.68247
Bertrand, N.; Schnoebelen, P.
10
2013
The state explosion problem from trace to bisimulation equivalence. Zbl 0961.68090
Laroussinie, François; Schnoebelen, Philippe
10
2000
The power of priority channel systems. Zbl 1448.68341
Haase, Christoph; Schmitz, Sylvain; Schnoebelen, Philippe
9
2014
The power of well-structured systems. Zbl 1390.68488
Schmitz, Sylvain; Schnoebelen, Philippe
9
2013
Lossy counter machines decidability cheat sheet. Zbl 1287.68101
Schnoebelen, Philippe
9
2010
Verification of probabilistic systems with faulty communication. Zbl 1105.68003
Abdulla, P. A.; Bertrand, N.; Rabinovich, A.; Schnoebelen, Ph.
9
2005
Mixing lossy and perfect fifo channels (extended abstract). Zbl 1160.68460
Chambart, P.; Schnoebelen, Ph.
8
2008
The regular viewpoint on PA-processes. Zbl 0992.68150
Lugiez, D.; Schnoebelen, Ph.
8
2002
On the index of Simon’s congruence for piecewise testability. Zbl 1312.68160
Karandikar, P.; Kufleitner, M.; Schnoebelen, Ph.
7
2015
On computing fixpoints in well-structured regular model checking, with applications to lossy channel systems. Zbl 1165.68397
Baier, Christel; Bertrand, Nathalie; Schnoebelen, Philippe
6
2006
The verification of probabilistic lossy channel systems. Zbl 1203.68101
Schnoebelen, Philippe
6
2004
Model checking lossy channels systems is probably decidable. Zbl 1029.68105
Bertrand, Nathalie; Schnoebelen, Philippe
6
2003
Some decidability results for nested Petri nets. Zbl 0964.68094
Lomazova, Irina A.; Schnoebelen, Philippe
6
2000
On termination and invariance for faulty channel machines. Zbl 1259.68142
Bouyer, Patricia; Markey, Nicolas; Ouaknine, Joël; Schnoebelen, Philippe; Worrell, James
5
2012
Post embedding problem is not primitive recursive, with applications to channel systems. Zbl 1136.03030
Chambart, Pierre; Schnoebelen, Philippe
5
2007
A general approach to comparing infinite-state systems with their finite-state specifications. Zbl 1097.68075
Kučera, Antonín; Schnoebelen, Philippe
5
2006
A PTIME-complete matching problem for SLP-compressed words. Zbl 1177.68138
Markey, N.; Schnoebelen, Ph.
5
2004
Oracle circuits for branching-time model checking. Zbl 1039.68076
Schnoebelen, Philippe
5
2003
On the expressivity and complexity of quantitative branching-time temporal logics. Zbl 1019.03012
Laroussinie, F.; Schnoebelen, Ph.; Turuani, M.
5
2003
On verifying fair lossy channel systems. Zbl 1014.68004
Masson, Benoît; Schnoebelen, Ph.
5
2002
A model for recursive-parallel programs. Zbl 0912.68131
Kouchnarenko, Olga; Schnoebelen, Ph.
5
1997
On the state complexity of closures and interiors of regular languages with subwords and superwords. Zbl 1332.68118
Karandikar, P.; Niewerth, M.; Schnoebelen, Ph.
4
2016
Decidability in the logic of subsequences and supersequences. Zbl 1366.03167
Karandikar, Prateek; Schnoebelen, Philippe
4
2015
Verifying nondeterministic probabilistic channel systems against \(\omega\)-regular linear-time properties. Zbl 1367.68181
Baier, Christel; Bertrand, Nathalie; Schnoebelen, Philippe
4
2007
On model checking durational Kripke structures. Zbl 1077.68691
Laroussinie, François; Markey, Nicolas; Schnoebelen, Philippe
4
2002
Bisimulation and other undecidable equivalences for lossy channel systems. Zbl 1087.68609
Schnoebelen, Ph.
4
2001
The complexity of propositional linear temporal logics in simple cases. (Extended abstract). Zbl 0919.03012
Demri, S.; Schnoebelen, Ph.
4
1998
Refined compilation of pattern-matching for functional languages. Zbl 0677.68004
Schnoebelen, Ph.
4
1988
The height of piecewise-testable languages with applications in logical complexity. Zbl 1369.68221
Karandikar, Prateek; Schnoebelen, Philippe
3
2016
A short visit to the STS hierarchy. Zbl 1273.68248
Bertrand, Nathalie; Schnoebelen, Philippe
3
2006
A note on the attractor-property of infinite-state Markov chains. Zbl 1191.68330
Baier, Christel; Bertrand, Nathalie; Schnoebelen, Philippe
3
2006
A parametric analysis of the state explosion problem in model checking. Zbl 1054.68557
Demri, S.; Laroussinie, F.; Schnoebelen, P.
3
2002
Verifying performance equivalence for timed basic parallel processes. Zbl 0965.68063
Bérard, Beatrice; Labroue, Anne; Schnoebelen, Philippe
3
2000
On functions weakly computable by Petri nets and vector addition systems. Zbl 1448.68346
Leroux, J.; Schnoebelen, Ph.
2
2014
Cutting through regular Post embedding problems. Zbl 1315.03064
Karandikar, Prateek; Schnoebelen, Philippe
2
2012
Pumping and counting on the regular Post embedding problem. Zbl 1288.68151
Chambart, Pierre; Schnoebelen, Philippe
2
2010
The \(\omega \)-regular Post embedding problem. Zbl 1139.03031
Chambart, P.; Schnoebelen, Ph.
2
2008
A parametric analysis of the state-explosion problem in model checking. Zbl 1094.68056
Demri, S.; Laroussinie, F.; Schnoebelen, Ph.
2
2006
Symbolic model checking for simply-timed systems. Zbl 1109.68519
Markey, Nicolas; Schnoebelen, Philippe
2
2004
Bisimulation and the reduction of Petri nets. Zbl 0986.68074
Schnoebelen, Philippe; Sidorova, Natalia
2
2000
Decidable first-order transition logics for PA-processes. Zbl 0973.68162
Lugiez, Denis; Schnoebelen, Philippe
2
2000
\(\tau\)-bisimulations and full abstraction for refinement of actions. Zbl 0743.68060
Cherief, F.; Schnoebelen, Ph.
2
1991
The height of piecewise-testable languages and the complexity of the logic of subwords. Zbl 1421.68063
Karandikar, Prateek; Schnoebelen, Philippe
1
2019
On shuffle products, acyclic automata and piecewise-testable languages. Zbl 1446.68081
Halfon, S.; Schnoebelen, Ph.
1
2019
Generalized Post embedding problems. Zbl 1316.03020
Karandikar, Prateek; Schnoebelen, Philippe
1
2015
The power of priority channel systems. Zbl 1390.68471
Haase, Christoph; Schmitz, Sylvain; Schnoebelen, Philippe
1
2013
Unidirectional channel systems can be tested. Zbl 1362.68174
Jančar, Petr; Karandikar, Prateek; Schnoebelen, Philippe
1
2012
Computing blocker sets for the regular Post embedding problem. Zbl 1250.68152
Chambart, Pierre; Schnoebelen, Philippe
1
2010
On termination for faulty channel machines. Zbl 1259.68120
Bouyer, Patricia; Markey, Nicolas; Ouaknine, Joël; Schnoebelen, Philippe; Worrell, James
1
2008
Mu-calculus path checking. Zbl 1184.68339
Markey, Nicolas; Schnoebelen, Philippe
1
2006
Symbolic verification of communicating systems with probabilistic message losses: liveness and fairness. Zbl 1225.68108
Baier, C.; Bertrand, N.; Schnoebelen, Ph.
1
2006
\(\text{BTL}_{2}\) and the expressive power of \(\text{ECTL}^{+}\). Zbl 1110.68076
Rabinovich, Alexander; Schnoebelen, Philippe
1
2006
Efficient timed model checking for discrete-time systems. Zbl 1088.68107
Laroussinie, F.; Markey, N.; Schnoebelen, Ph.
1
2006
On solving temporal logic queries. Zbl 1275.68093
Hornus, Samuel; Schnoebelen, Philippe
1
2002
An automata-theoretic approach to the reachability analysis of RPPS systems. Zbl 1021.68064
Labroue, Anne; Schnoebelen, Philippe
1
2002
A rewrite-based type discipline for a subset of computer algebra. Zbl 0739.68048
Comon, H.; Lugiez, D.; Schnoebelen, Ph.
1
1991
Refined compilation of pattern-matching for functional languages. Zbl 0708.68017
Schnoebelen, Ph.
1
1989
The height of piecewise-testable languages and the complexity of the logic of subwords. Zbl 1421.68063
Karandikar, Prateek; Schnoebelen, Philippe
1
2019
On shuffle products, acyclic automata and piecewise-testable languages. Zbl 1446.68081
Halfon, S.; Schnoebelen, Ph.
1
2019
On the state complexity of closures and interiors of regular languages with subwords and superwords. Zbl 1332.68118
Karandikar, P.; Niewerth, M.; Schnoebelen, Ph.
4
2016
The height of piecewise-testable languages with applications in logical complexity. Zbl 1369.68221
Karandikar, Prateek; Schnoebelen, Philippe
3
2016
On the index of Simon’s congruence for piecewise testability. Zbl 1312.68160
Karandikar, P.; Kufleitner, M.; Schnoebelen, Ph.
7
2015
Decidability in the logic of subsequences and supersequences. Zbl 1366.03167
Karandikar, Prateek; Schnoebelen, Philippe
4
2015
Generalized Post embedding problems. Zbl 1316.03020
Karandikar, Prateek; Schnoebelen, Philippe
1
2015
The power of priority channel systems. Zbl 1448.68341
Haase, Christoph; Schmitz, Sylvain; Schnoebelen, Philippe
9
2014
On functions weakly computable by Petri nets and vector addition systems. Zbl 1448.68346
Leroux, J.; Schnoebelen, Ph.
2
2014
Computable fixpoints in well-structured symbolic model checking. Zbl 1291.68247
Bertrand, N.; Schnoebelen, P.
10
2013
The power of well-structured systems. Zbl 1390.68488
Schmitz, Sylvain; Schnoebelen, Philippe
9
2013
The power of priority channel systems. Zbl 1390.68471
Haase, Christoph; Schmitz, Sylvain; Schnoebelen, Philippe
1
2013
The ordinal-recursive complexity of timed-arc Petri nets, data nets, and other enriched nets. Zbl 1362.68214
Haddad, Serge; Schmitz, Sylvain; Schnoebelen, Philippe
11
2012
On termination and invariance for faulty channel machines. Zbl 1259.68142
Bouyer, Patricia; Markey, Nicolas; Ouaknine, Joël; Schnoebelen, Philippe; Worrell, James
5
2012
Cutting through regular Post embedding problems. Zbl 1315.03064
Karandikar, Prateek; Schnoebelen, Philippe
2
2012
Unidirectional channel systems can be tested. Zbl 1362.68174
Jančar, Petr; Karandikar, Prateek; Schnoebelen, Philippe
1
2012
Multiply-recursive upper bounds with Higman’s lemma. Zbl 1333.68179
Schmitz, S.; Schnoebelen, Ph.
13
2011
Revisiting Ackermann-hardness for lossy counter machines and reset Petri nets. Zbl 1287.68059
Schnoebelen, Philippe
19
2010
Lossy counter machines decidability cheat sheet. Zbl 1287.68101
Schnoebelen, Philippe
9
2010
Pumping and counting on the regular Post embedding problem. Zbl 1288.68151
Chambart, Pierre; Schnoebelen, Philippe
2
2010
Computing blocker sets for the regular Post embedding problem. Zbl 1250.68152
Chambart, Pierre; Schnoebelen, Philippe
1
2010
Mixing lossy and perfect fifo channels (extended abstract). Zbl 1160.68460
Chambart, P.; Schnoebelen, Ph.
8
2008
The \(\omega \)-regular Post embedding problem. Zbl 1139.03031
Chambart, P.; Schnoebelen, Ph.
2
2008
On termination for faulty channel machines. Zbl 1259.68120
Bouyer, Patricia; Markey, Nicolas; Ouaknine, Joël; Schnoebelen, Philippe; Worrell, James
1
2008
Post embedding problem is not primitive recursive, with applications to channel systems. Zbl 1136.03030
Chambart, Pierre; Schnoebelen, Philippe
5
2007
Verifying nondeterministic probabilistic channel systems against \(\omega\)-regular linear-time properties. Zbl 1367.68181
Baier, Christel; Bertrand, Nathalie; Schnoebelen, Philippe
4
2007
On computing fixpoints in well-structured regular model checking, with applications to lossy channel systems. Zbl 1165.68397
Baier, Christel; Bertrand, Nathalie; Schnoebelen, Philippe
6
2006
A general approach to comparing infinite-state systems with their finite-state specifications. Zbl 1097.68075
Kučera, Antonín; Schnoebelen, Philippe
5
2006
A short visit to the STS hierarchy. Zbl 1273.68248
Bertrand, Nathalie; Schnoebelen, Philippe
3
2006
A note on the attractor-property of infinite-state Markov chains. Zbl 1191.68330
Baier, Christel; Bertrand, Nathalie; Schnoebelen, Philippe
3
2006
A parametric analysis of the state-explosion problem in model checking. Zbl 1094.68056
Demri, S.; Laroussinie, F.; Schnoebelen, Ph.
2
2006
Mu-calculus path checking. Zbl 1184.68339
Markey, Nicolas; Schnoebelen, Philippe
1
2006
Symbolic verification of communicating systems with probabilistic message losses: liveness and fairness. Zbl 1225.68108
Baier, C.; Bertrand, N.; Schnoebelen, Ph.
1
2006
\(\text{BTL}_{2}\) and the expressive power of \(\text{ECTL}^{+}\). Zbl 1110.68076
Rabinovich, Alexander; Schnoebelen, Philippe
1
2006
Efficient timed model checking for discrete-time systems. Zbl 1088.68107
Laroussinie, F.; Markey, N.; Schnoebelen, Ph.
1
2006
Flat acceleration in symbolic model checking. Zbl 1170.68507
Bardin, Sébastien; Finkel, Alain; Leroux, Jérôme; Schnoebelen, Philippe
12
2005
Verification of probabilistic systems with faulty communication. Zbl 1105.68003
Abdulla, P. A.; Bertrand, N.; Rabinovich, A.; Schnoebelen, Ph.
9
2005
Model checking timed automata with one or two clocks. Zbl 1099.68057
Laroussinie, F.; Markey, N.; Schnoebelen, Ph.
14
2004
The verification of probabilistic lossy channel systems. Zbl 1203.68101
Schnoebelen, Philippe
6
2004
A PTIME-complete matching problem for SLP-compressed words. Zbl 1177.68138
Markey, N.; Schnoebelen, Ph.
5
2004
Symbolic model checking for simply-timed systems. Zbl 1109.68519
Markey, Nicolas; Schnoebelen, Philippe
2
2004
Model checking a path (preliminary report). Zbl 1274.68197
Markey, N.; Schnoebelen, P.
16
2003
The complexity of temporal logic model checking. Zbl 1084.03013
Schnoebelen, Ph.
13
2003
Model checking lossy channels systems is probably decidable. Zbl 1029.68105
Bertrand, Nathalie; Schnoebelen, Philippe
6
2003
Oracle circuits for branching-time model checking. Zbl 1039.68076
Schnoebelen, Philippe
5
2003
On the expressivity and complexity of quantitative branching-time temporal logics. Zbl 1019.03012
Laroussinie, F.; Schnoebelen, Ph.; Turuani, M.
5
2003
The complexity of propositional linear temporal logics in simple cases. Zbl 1009.68072
Demri, Stéphane; Schnoebelen, Philippe
24
2002
Verifying lossy channel systems has nonprimitive recursive complexity. Zbl 1043.68016
Schnoebelen, Ph.
23
2002
The regular viewpoint on PA-processes. Zbl 0992.68150
Lugiez, D.; Schnoebelen, Ph.
8
2002
On verifying fair lossy channel systems. Zbl 1014.68004
Masson, Benoît; Schnoebelen, Ph.
5
2002
On model checking durational Kripke structures. Zbl 1077.68691
Laroussinie, François; Markey, Nicolas; Schnoebelen, Philippe
4
2002
A parametric analysis of the state explosion problem in model checking. Zbl 1054.68557
Demri, S.; Laroussinie, F.; Schnoebelen, P.
3
2002
On solving temporal logic queries. Zbl 1275.68093
Hornus, Samuel; Schnoebelen, Philippe
1
2002
An automata-theoretic approach to the reachability analysis of RPPS systems. Zbl 1021.68064
Labroue, Anne; Schnoebelen, Philippe
1
2002
Well-structured transition systems everywhere! Zbl 0973.68170
Finkel, A.; Schnoebelen, P.
112
2001
Systems and software verification. Model-checking techniques and tools. Zbl 1002.68029
Bérard, B.; Bidoit, M.; Finkel, A.; Laroussinie, F.; Petit, A.; Petrucci, L.; Schnoebelen, Ph.; McKenzie, P.
21
2001
Model checking \(\text{CTL}^+\) and FCTL is hard. Zbl 0986.68067
Laroussinie, François; Markey, Nicolas; Schnoebelen, Philippe
13
2001
Bisimulation and other undecidable equivalences for lossy channel systems. Zbl 1087.68609
Schnoebelen, Ph.
4
2001
Specification in CTL + past for verification in CTL. Zbl 1046.68599
Laroussinie, F.; Schnoebelen, Ph.
14
2000
The state explosion problem from trace to bisimulation equivalence. Zbl 0961.68090
Laroussinie, François; Schnoebelen, Philippe
10
2000
Some decidability results for nested Petri nets. Zbl 0964.68094
Lomazova, Irina A.; Schnoebelen, Philippe
6
2000
Verifying performance equivalence for timed basic parallel processes. Zbl 0965.68063
Bérard, Beatrice; Labroue, Anne; Schnoebelen, Philippe
3
2000
Bisimulation and the reduction of Petri nets. Zbl 0986.68074
Schnoebelen, Philippe; Sidorova, Natalia
2
2000
Decidable first-order transition logics for PA-processes. Zbl 0973.68162
Lugiez, Denis; Schnoebelen, Philippe
2
2000
Boundedness of reset P/T nets. Zbl 0943.68122
Dufourd, C.; Jancǎr, P.; Schnoebelen, Ph.
11
1999
Reset nets between decidability and undecidability. Zbl 0909.68124
Dufourd, C.; Finkel, A.; Schnoebelen, Ph.
41
1998
The regular viewpoint on PA-processes. Zbl 0932.68052
Lugiez, D.; Schnoebelen, Ph.
14
1998
The complexity of propositional linear temporal logics in simple cases. (Extended abstract). Zbl 0919.03012
Demri, S.; Schnoebelen, Ph.
4
1998
A model for recursive-parallel programs. Zbl 0912.68131
Kouchnarenko, Olga; Schnoebelen, Ph.
5
1997
\(\tau\)-bisimulations and full abstraction for refinement of actions. Zbl 0743.68060
Cherief, F.; Schnoebelen, Ph.
2
1991
A rewrite-based type discipline for a subset of computer algebra. Zbl 0739.68048
Comon, H.; Lugiez, D.; Schnoebelen, Ph.
1
1991
Refined compilation of pattern-matching for functional languages. Zbl 0708.68017
Schnoebelen, Ph.
1
1989
Refined compilation of pattern-matching for functional languages. Zbl 0677.68004
Schnoebelen, Ph.
4
1988
all top 5

Cited by 563 Authors

24 Schnoebelen, Philippe
17 Finkel, Alain
13 Demri, Stéphane P.
10 Abdulla, Parosh Aziz
10 Van Begin, Laurent
9 Lasota, Sławomir
8 Bozzelli, Laura
8 Delzanno, Giorgio
8 Raskin, Jean-François
8 Zavattaro, Gianluigi
7 Bertrand, Nathalie
7 Montanari, Angelo
7 Schmitz, Sylvain
6 Bouyer, Patricia
6 Busi, Nadia
6 Laroussinie, François
6 Lazić, Ranko
6 Lohrey, Markus
6 Lozin, Vadim Vladislavovich
6 Rosa-Velardo, Fernando
5 Baier, Christel
5 Goubault-Larrecq, Jean
5 Jamroga, Wojciech
5 Kucera, Antonin
5 Majumdar, Rupak
5 Markey, Nicolas
5 Rabinovich, Alexander
5 Sala, Pietro
5 Sangnier, Arnaud
4 Jančar, Petr
4 Karandikar, Prateek
4 Kuske, Dietrich
4 Lange, Martin
4 Leroux, Jérôme
4 Lin, Anthony Widjaja
4 Lugiez, Denis
4 Meier, Arne
4 Molinari, Alberto
4 Murano, Aniello
4 Ouaknine, Joel O.
4 Peron, Adriano
4 Touili, Tayssir
4 Wooldridge, Michael J.
3 Aceto, Luca
3 Blondin, Michael
3 Bulling, Nils
3 Dabrowski, Konrad Kazimierz
3 Esparza, Javier
3 Ganty, Pierre
3 Geeraerts, Gilles
3 Genest, Blaise
3 Ghilardi, Silvio
3 Göller, Stefan
3 Gutierrez, Julian
3 Halfon, Simon
3 Kamide, Norihiro
3 Lück, Martin
3 Masopust, Tomáš
3 Meseguer Guaita, José
3 Meyer, Roland
3 Muscholl, Anca
3 Paulusma, Daniël
3 Praveen, M.
3 Rigo, Michel
3 Schnoebelen, Ph
3 Sutre, Grégoire
3 ter Hofstede, Arthur H. M.
3 Thati, Prasanna
3 van der Aalst, Wil M. P.
3 Veith, Helmut
3 Verbeek, H. M. W.
3 Weber, Volker
3 Worrell, James B.
3 Wynn, Moe Thandar
2 Acciai, Lucia
2 Akshay, S.
2 Atig, Mohamed Faouzi
2 Boreale, Michele
2 Bravetti, Mario
2 Brázdil, Tomáš
2 Bresolin, Davide
2 Brickenstein, Michael
2 Brihaye, Thomas
2 Bugaichenko, D. Yu.
2 Cécé, Gérard
2 Chakraborty, Supratik
2 Chambart, Pierre
2 Chini, Peter
2 Comon, Hubert
2 de Frutos-Escrig, David
2 Della Monica, Dario
2 Deters, Morgan
2 Devillers, Raymond
2 Dhar, Amit Kumar
2 Dix, Jurgen
2 Doyen, Laurent
2 Dreyer, Alexander
2 Figueira, Diego
2 Fu, Yuxi
2 Gabbrielli, Maurizio
...and 463 more Authors
all top 5

Cited in 55 Serials

63 Theoretical Computer Science
53 Information and Computation
17 Acta Informatica
13 Information Processing Letters
12 Journal of Computer and System Sciences
8 MSCS. Mathematical Structures in Computer Science
8 Logical Methods in Computer Science
7 Formal Aspects of Computing
7 Formal Methods in System Design
7 ACM Transactions on Computational Logic
6 International Journal of Foundations of Computer Science
5 Artificial Intelligence
5 Journal of Symbolic Computation
5 Journal of Logical and Algebraic Methods in Programming
4 Theory of Computing Systems
4 RAIRO. Theoretical Informatics and Applications
3 Information Sciences
3 Annals of Pure and Applied Logic
3 Journal of Applied Non-Classical Logics
3 The Journal of Logic and Algebraic Programming
2 Real-Time Systems
2 Discrete Event Dynamic Systems
2 Distributed Computing
2 Vestnik St. Petersburg University. Mathematics
2 Cybernetics and Systems Analysis
2 Annals of Mathematics and Artificial Intelligence
1 Discrete Mathematics
1 International Journal of General Systems
1 Journal of Combinatorial Theory. Series A
1 Journal of Combinatorial Theory. Series B
1 Journal of Pure and Applied Algebra
1 The Journal of Symbolic Logic
1 Programming and Computer Software
1 Semigroup Forum
1 Studia Logica
1 Science of Computer Programming
1 International Journal of Production Research
1 Order
1 Journal of Computer Science and Technology
1 Algorithmica
1 Journal of Automated Reasoning
1 International Journal of Approximate Reasoning
1 International Journal of Computer Mathematics
1 Indagationes Mathematicae. New Series
1 Journal of Logic, Language and Information
1 The Bulletin of Symbolic Logic
1 Higher-Order and Symbolic Computation
1 Theory and Practice of Logic Programming
1 Natural Computing
1 Journal of Applied Logic
1 RAIRO. Theoretical Informatics and Applications
1 Frontiers of Computer Science in China
1 Frontiers of Computer Science
1 Computer Science Review
1 ACM Transactions on Computation Theory

Citations by Year