Alain Finkel

According to our database1, Alain Finkel
  • authored at least 101 papers between 1983 and 2018.
  • has a "Dijkstra number"2 of three.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2018
Handling infinitely branching well-structured transition systems.
Inf. Comput., 2018

2017
The Logical View on Continuous Petri Nets.
ACM Trans. Comput. Log., 2017

Well Behaved Transition Systems.
Logical Methods in Computer Science, 2017

Forward Analysis for WSTS, Part III: Karp-Miller Trees.
CoRR, 2017

Synchronizability of Communicating Finite State Machines is not Decidable.
CoRR, 2017

Synchronizability of Communicating Finite State Machines is not Decidable.
Proceedings of the 44th International Colloquium on Automata, Languages, and Programming, 2017

Forward Analysis for WSTS, Part III: Karp-Miller Trees.
Proceedings of the 37th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2017

2016
Forward analysis and model checking for trace bounded WSTS.
Theor. Comput. Sci., 2016

Preface.
Fundam. Inform., 2016

Well Behaved Transition Systems.
CoRR, 2016

Approaching the Coverability Problem Continuously.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2016

The Ideal Theory for WSTS.
Proceedings of the Reachability Problems - 10th International Workshop, 2016

2015
Recent and simple algorithms for Petri nets.
Software and System Modeling, 2015

Approaching the Coverability Problem Continuously.
CoRR, 2015

Reachability in Two-Dimensional Vector Addition Systems with States Is PSPACE-Complete.
Proceedings of the 30th Annual ACM/IEEE Symposium on Logic in Computer Science, 2015

2014
Dense-choice Counter Machines revisited.
Theor. Comput. Sci., 2014

Neue, einfache Algorithmen für Petrinetze.
Informatik Spektrum, 2014

Reachability Problems for Infinite-State Systems (Dagstuhl Seminar 14141).
Dagstuhl Reports, 2014

Reachability in Two-Dimensional Vector Addition Systems with States is PSPACE-complete.
CoRR, 2014

Handling Infinitely Branching WSTS.
Proceedings of the Automata, Languages, and Programming - 41st International Colloquium, 2014

2013
Unambiguous constrained Automata.
Int. J. Found. Comput. Sci., 2013

Ordinal theory for expressiveness of well-structured transition systems.
Inf. Comput., 2013

Reachability in Register Machines with Polynomial Updates.
Proceedings of the Mathematical Foundations of Computer Science 2013, 2013

2012
Affine Parikh automata.
RAIRO - Theor. Inf. and Applic., 2012

Bounded Parikh Automata.
Int. J. Found. Comput. Sci., 2012

Forward Analysis for WSTS, Part II: Complete WSTS
Logical Methods in Computer Science, 2012

Model Checking Vector Addition Systems with one zero-test
Logical Methods in Computer Science, 2012

Extending the Rackoff technique to Affine nets.
Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2012

Unambiguous Constrained Automata.
Proceedings of the Developments in Language Theory - 16th International Conference, 2012

The Theory of WSTS: The Case of Complete WSTS.
Proceedings of the Application and Theory of Petri Nets - 33rd International Conference, 2012

2011
Bounded Parikh Automata
Proceedings of the Proceedings 8th International Conference Words 2011, 2011

Storming the Parikh Automaton
CoRR, 2011

On the Expressiveness of Parikh Automata and Related Models.
Proceedings of the Third Workshop on Non-Classical Models for Automata and Applications - NCMA 2011, Milan, Italy, July 18, 2011

Ordinal Theory for Expressiveness of Well Structured Transition Systems.
Proceedings of the Foundations of Software Science and Computational Structures, 2011

Forward Analysis and Model Checking for Trace Bounded WSTS.
Proceedings of the Applications and Theory of Petri Nets - 32nd International Conference, 2011

2010
Model-checking CTL* over flat Presburger counter systems.
Journal of Applied Non-Classical Logics, 2010

Forward Analysis and Model Checking for Bounded WSTS
CoRR, 2010

Mixing Coverability and Reachability to Analyze VASS with One Zero-Test.
Proceedings of the SOFSEM 2010: Theory and Practice of Computer Science, 2010

Place-Boundedness for Vector Addition Systems with one zero-test.
Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2010

2009
Automatic Verification of Counter Systems With Ranking Function.
Electr. Notes Theor. Comput. Sci., 2009

Reachability in Timed Counter Systems.
Electr. Notes Theor. Comput. Sci., 2009

Dense-choice Counter Machines revisited
Proceedings of the Proceedings International Workshop on Verification of Infinite-State Systems, 2009

Forward analysis for WSTS, Part I: Completions
CoRR, 2009

Forward Analysis for WSTS, Part I: Completions.
Proceedings of the 26th International Symposium on Theoretical Aspects of Computer Science, 2009

Forward Analysis for WSTS, Part II: Complete WSTS.
Proceedings of the Automata, Languages and Programming, 36th Internatilonal Colloquium, 2009

2008
FAST: acceleration from theory to practice.
STTT, 2008

Decomposition of Decidable First-Order Logics over Integers and Reals
CoRR, 2008

The convex hull of a regular set of integer vectors is polyhedral and effectively computable
CoRR, 2008

Decomposition of Decidable First-Order Logics over Integers and Reals.
Proceedings of the 15th International Symposium on Temporal Representation and Reasoning, 2008

Reversal-Bounded Counter Machines Revisited.
Proceedings of the Mathematical Foundations of Computer Science 2008, 2008

2007
Towards Model-Checking Programs with Lists.
Proceedings of the Infinity in Logic and Computation, International Conference, 2007

2006
On the omega-language expressive power of extended Petri nets.
Theor. Comput. Sci., 2006

Towards a Model-Checker for Counter Systems.
Proceedings of the Automated Technology for Verification and Analysis, 2006

2005
The convex hull of a regular set of integer vectors is polyhedral and effectively computable.
Inf. Process. Lett., 2005

Verification of programs with half-duplex communication.
Inf. Comput., 2005

On the omega-language Expressive Power of Extended Petri Nets.
Electr. Notes Theor. Comput. Sci., 2005

About Fast and TReX Accelerations.
Electr. Notes Theor. Comput. Sci., 2005

Flat Acceleration in Symbolic Model Checking.
Proceedings of the Automated Technology for Verification and Analysis, 2005

2004
A well-structured framework for analysing petri net extensions.
Inf. Comput., 2004

FASTer Acceleration of Counter Automata in Practice.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2004

Polynomial Time Image Computation with Interval-Definable Counters Systems.
Proceedings of the Model Checking Software, 2004

Image Computation in Infinite State Model Checking.
Proceedings of the Computer Aided Verification, 16th International Conference, 2004

Composition of Accelerations to Verify Infinite Heterogeneous Systems.
Proceedings of the Automated Technology for Verification and Analysis: Second International Conference, 2004

2003
Well-abstracted transition systems: application to FIFO automata.
Inf. Comput., 2003

FAST: Fast Acceleration of Symbolikc Transition Systems.
Proceedings of the Computer Aided Verification, 15th International Conference, 2003

2002
Monotonic Extensions of Petri Nets: Forward and Backward Search Revisited.
Electr. Notes Theor. Comput. Sci., 2002

Verification of Embedded Reactive Fiffo Systems.
Proceedings of the LATIN 2002: Theoretical Informatics, 2002

How to Compose Presburger-Accelerations: Applications to Broadcast Protocols.
Proceedings of the FST TCS 2002: Foundations of Software Technology and Theoretical Computer Science, 2002

2001
Well-structured transition systems everywhere!
Theor. Comput. Sci., 2001

2000
An efficient automata approach to some problems on context-free grammars.
Inf. Process. Lett., 2000

Decidability of Reachability Problems for Classes of Two Counters Automata.
Proceedings of the STACS 2000, 2000

An Algorithm Constructing the Semilinear Post* for 2-Dim Reset/Transfer VASS.
Proceedings of the Mathematical Foundations of Computer Science 2000, 2000

Well-Abstracted Transition Systems.
Proceedings of the CONCUR 2000, 2000

1999
A Polynomial-Bisimilar Normalization for Reset Petri Nets.
Theor. Comput. Sci., 1999

On the Verification of Broadcast Protocols.
Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science, 1999

1998
CapRe: a Gaze Tracking System in Man-machine Interaction.
JACIII, 1998

Fundamental Structures in Well-Structured Infinite Transition Systems.
Proceedings of the LATIN '98: Theoretical Informatics, 1998

Reset Nets Between Decidability and Undecidability.
Proceedings of the Automata, Languages and Programming, 25th International Colloquium, 1998

Effective Recognizability and Model Checking of Reactive Fiffo Automata.
Proceedings of the Algebraic Methodology and Software Technology, 1998

1997
Verifying Identical Communicating Processes is Undecidable.
Theor. Comput. Sci., 1997

A direct symbolic approach to model checking pushdown systems.
Electr. Notes Theor. Comput. Sci., 1997

Cyclic Petri net reachability sets are semi-linear effectively constructible.
Electr. Notes Theor. Comput. Sci., 1997

Polynomial-Time Manz-One Reductions for Petri Nets.
Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1997

Programs with Quasi-Stable Channels are Effectively Recognizable (Extended Abstract).
Proceedings of the Computer Aided Verification, 9th International Conference, 1997

1996
A Polynomial Algorithm for the Membership Problem with Categorial Grammars.
Theor. Comput. Sci., 1996

Unreliable Channels are Easier to Verify Than Perfect Channels.
Inf. Comput., 1996

1994
Composition/décomposition de réseaux de petri et de leurs graphes de couverture.
ITA, 1994

Decidability of the Termination Problem for Completely Specified Protocols.
Distributed Computing, 1994

Duplication, Insertion and Lossiness Errors in Unreliable Communication Channels.
Proceedings of the SIGSOFT '94, 1994

1991
Avoiding State Exposion by Composition of Minimal Covering Graphs.
Proceedings of the Computer Aided Verification, 3rd International Workshop, 1991

The Minimal Coverability Graph for Petri Nets.
Proceedings of the Advances in Petri Nets 1993, 1991

1990
Reduction and covering of infinite reachability trees
Inf. Comput., December, 1990

1988
Fifo Nets Without Order Deadlock.
Acta Inf., 1988

1987
A Generalization of the Procedure of Karp and Miller to Well Structured Transition Systems.
Proceedings of the Automata, Languages and Programming, 14th International Colloquium, 1987

A Survey on the Decidability Questions for Classes of FIFO Nets.
Proceedings of the Advances in Petri Nets 1988, 1987

1986
Applications of residues for the analysis of parallel systems communicating by fifo channels.
Bulletin of the EATCS, 1986

1985
An Introduction to Fifo Nets-Monogeneous Nets: A Subclass of Fifo Nets.
Theor. Comput. Sci., 1985

Une Généralisation des Théorème de Higman et de Simon aux Mots Infinis.
Theor. Comput. Sci., 1985

1984
Petri Nets and monogenous FIFO nets.
Bulletin of the EATCS, 1984

Blocage et vivacité dans les réseaux a pile-file.
Proceedings of the STACS 84, 1984

1983
Fifo nets: a new model of parallel computation.
Proceedings of the Theoretical Computer Science, 1983


  Loading...