Alain Finkel

Serge Haddad

Igor Khmelnitsky

Proceedings of the Foundations of Software Science and Computation Structures, 2020

2019

The Well Structured Problem for Presburger Counter Machines.

[BibT_eX]

[DOI]

Ekanshdeep Gupta

Proceedings of the 39th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2019

Coverability and Termination in Recursive Petri Nets.

[BibT_eX]

[DOI]

Serge Haddad

Igor Khmelnitsky

Proceedings of the Application and Theory of Petri Nets and Concurrency, 2019

2018

Handling infinitely branching well-structured transition systems.

[BibT_eX]

[DOI]

Michael Blondin

Inf. Comput., 2018

Parameterized verification of monotone information systems.

[BibT_eX]

[DOI]

Raphaël Chane-Yack-Fa

Marc Frappier

Amel Mammar

Formal Aspects Comput., 2018

Reachability for Two-Counter Machines with One Test and One Reset.

[BibT_eX]

[DOI]

Proceedings of the 38th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2018

2017

The Logical View on Continuous Petri Nets.

[BibT_eX]

[DOI]

ACM Trans. Comput. Log., 2017

Well Behaved Transition Systems.

[BibT_eX]

[DOI]

Michael Blondin

Log. Methods Comput. Sci., 2017

2016

Forward analysis and model checking for trace bounded WSTS.

[BibT_eX]

[DOI]

Pierre Chambart

Sylvain Schmitz

Theor. Comput. Sci., 2016

Preface.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2016

Approaching the Coverability Problem Continuously.

[BibT_eX]

[DOI]

Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2016

The Ideal Theory for WSTS.

[BibT_eX]

[DOI]

Proceedings of the Reachability Problems - 10th International Workshop, 2016

2015

Recent and simple algorithms for Petri nets.

[BibT_eX]

[DOI]

Softw. Syst. Model., 2015

Reachability in Two-Dimensional Vector Addition Systems with States Is PSPACE-Complete.

[BibT_eX]

[DOI]

Proceedings of the 30th Annual ACM/IEEE Symposium on Logic in Computer Science, 2015

2014

Dense-choice Counter Machines revisited.

[BibT_eX]

[DOI]

Florent Bouchy

Pierluigi San Pietro

Theor. Comput. Sci., 2014

Neue, einfache Algorithmen für Petrinetze.

[BibT_eX]

[DOI]

Inform. Spektrum, 2014

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

[BibT_eX]

[DOI]

Dagstuhl Reports, 2014

Handling Infinitely Branching WSTS.

[BibT_eX]

[DOI]

Michael Blondin

Proceedings of the Automata, Languages, and Programming - 41st International Colloquium, 2014

2013

Unambiguous constrained Automata.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2013

Ordinal theory for expressiveness of well-structured transition systems.

[BibT_eX]

[DOI]

Rémi Bonnet

Serge Haddad

Fernando Rosa-Velardo

Inf. Comput., 2013

Reachability in Register Machines with Polynomial Updates.

[BibT_eX]

[DOI]

Stefan Göller

Christoph Haase

Proceedings of the Mathematical Foundations of Computer Science 2013, 2013

2012

Affine Parikh automata.

[BibT_eX]

[DOI]

RAIRO Theor. Informatics Appl., 2012

Forward Analysis for WSTS, Part II: Complete WSTS

[BibT_eX]

[DOI]

Jean Goubault-Larrecq

Log. Methods Comput. Sci., 2012

Model Checking Vector Addition Systems with one zero-test

[BibT_eX]

[DOI]

Log. Methods Comput. Sci., 2012

Extending the Rackoff technique to Affine nets.

[BibT_eX]

[DOI]

Rémi Bonnet

M. Praveen

Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2012

The Theory of WSTS: The Case of Complete WSTS.

[BibT_eX]

[DOI]

Jean Goubault-Larrecq

Proceedings of the Application and Theory of Petri Nets - 33rd International Conference, 2012

2011

Bounded Parikh Automata

[BibT_eX]

[DOI]

Proceedings of the Proceedings 8th International Conference Words 2011, 2011

Storming the Parikh Automaton

[BibT_eX]

[DOI]

CoRR, 2011

On the Expressiveness of Parikh Automata and Related Models.

[BibT_eX]

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

2010

Model-checking CTL* over flat Presburger counter systems.

[BibT_eX]

[DOI]

J. Appl. Non Class. Logics, 2010

Forward Analysis and Model Checking for Bounded WSTS

[BibT_eX]

[DOI]

Pierre Chambart

Sylvain Schmitz

CoRR, 2010

Mixing Coverability and Reachability to Analyze VASS with One Zero-Test.

[BibT_eX]

[DOI]

Proceedings of the SOFSEM 2010: Theory and Practice of Computer Science, 2010

Place-Boundedness for Vector Addition Systems with one zero-test.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Emmanuelle Encrenaz

Proceedings of the Joint Proceedings of the 8th, 2009

Reachability in Timed Counter Systems.

[BibT_eX]

[DOI]

Florent Bouchy

Proceedings of the Joint Proceedings of the 8th, 2009

2008

FAST: acceleration from theory to practice.

[BibT_eX]

[DOI]

Int. J. Softw. Tools Technol. Transf., 2008

Decomposition of Decidable First-Order Logics over Integers and Reals.

[BibT_eX]

[DOI]

Florent Bouchy

Proceedings of the 15th International Symposium on Temporal Representation and Reasoning, 2008

Reversal-Bounded Counter Machines Revisited.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2008, 2008

2007

Towards Model-Checking Programs with Lists.

[BibT_eX]

[DOI]

Étienne Lozes

Proceedings of the Infinity in Logic and Computation, International Conference, 2007

2006

On the <i>omega</i>-language expressive power of extended Petri nets.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2006

Towards a Model-Checker for Counter Systems.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2005

Verification of programs with half-duplex communication.

[BibT_eX]

[DOI]

Inf. Comput., 2005

Flat Acceleration in Symbolic Model Checking.

[BibT_eX]

[DOI]

Proceedings of the Automated Technology for Verification and Analysis, 2005

2004

A well-structured framework for analysing petri net extensions.

[BibT_eX]

[DOI]

Claudine Picaronny

Inf. Comput., 2004

On the omega-language Expressive Power of Extended Petri Nets.

[BibT_eX]

[DOI]

Proceedings of the 11th International Workshop on Expressiveness in Concurrency, 2004

About Fast and TReX Accelerations.

[BibT_eX]

[DOI]

Christophe Darlot

Laurent Van Begin

Proceedings of the Fouth International Workshop on Automated Verification of Critical Systems, 2004

FASTer Acceleration of Counter Automata in Practice.

[BibT_eX]

[DOI]

Sébastien Bardin

Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2004

Polynomial Time Image Computation with Interval-Definable Counters Systems.

[BibT_eX]

[DOI]

Proceedings of the Model Checking Software, 2004

Image Computation in Infinite State Model Checking.

[BibT_eX]

[DOI]

Proceedings of the Computer Aided Verification, 16th International Conference, 2004

Composition of Accelerations to Verify Infinite Heterogeneous Systems.

[BibT_eX]

[DOI]

Sébastien Bardin

Proceedings of the Automated Technology for Verification and Analysis: Second International Conference, 2004

2003

Well-abstracted transition systems: application to FIFO automata.

[BibT_eX]

[DOI]

Inf. Comput., 2003

FAST: Fast Acceleration of Symbolikc Transition Systems.

[BibT_eX]

[DOI]

Proceedings of the Computer Aided Verification, 15th International Conference, 2003

2002

Monotonic Extensions of Petri Nets: Forward and Backward Search Revisited.

[BibT_eX]

[DOI]

Proceedings of the 4th International Workshop on Verification of Infinite-State Systems (CONCUR 2002 Satellite Workshop), 2002

Verification of Embedded Reactive Fiffo Systems.

[BibT_eX]

[DOI]

Proceedings of the LATIN 2002: Theoretical Informatics, 2002

How to Compose Presburger-Accelerations: Applications to Broadcast Protocols.

[BibT_eX]

[DOI]

Proceedings of the FST TCS 2002: Foundations of Software Technology and Theoretical Computer Science, 2002

2001

Well-structured transition systems everywhere!

[BibT_eX]

[DOI]

Philippe Schnoebelen

Theor. Comput. Sci., 2001

Systems and Software Verification, Model-Checking Techniques and Tools.

[BibT_eX]

[DOI]

Springer, ISBN: 9783540415237, 2001

2000

An efficient automata approach to some problems on context-free grammars.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2000

Decidability of Reachability Problems for Classes of Two Counters Automata.

[BibT_eX]

[DOI]

Proceedings of the STACS 2000, 2000

An Algorithm Constructing the Semilinear Post<sup>*</sup> for 2-Dim Reset/Transfer VASS.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2000, 2000

Well-Abstracted Transition Systems.

[BibT_eX]

[DOI]

Proceedings of the CONCUR 2000, 2000

1999

A Polynomial-Bisimilar Normalization for Reset Petri Nets.

[BibT_eX]

[DOI]

Catherine Dufourd

Theor. Comput. Sci., 1999

On the Verification of Broadcast Protocols.

[BibT_eX]

[DOI]

Javier Esparza

Richard Mayr

Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science, 1999

1998

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

[BibT_eX]

[DOI]

Christophe Collet

Rachid Gherbi

J. Adv. Comput. Intell. Intell. Informatics, 1998

Fundamental Structures in Well-Structured Infinite Transition Systems.

[BibT_eX]

[DOI]

Philippe Schnoebelen

Proceedings of the LATIN '98: Theoretical Informatics, 1998

Reset Nets Between Decidability and Undecidability.

[BibT_eX]

[DOI]

Catherine Dufourd

Philippe Schnoebelen

Proceedings of the Automata, Languages and Programming, 25th International Colloquium, 1998

Effective Recognizability and Model Checking of Reactive Fiffo Automata.

[BibT_eX]

[DOI]

Proceedings of the Algebraic Methodology and Software Technology, 1998

1997

Verifying Identical Communicating Processes is Undecidable.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1997

A direct symbolic approach to model checking pushdown systems.

[BibT_eX]

[DOI]

Bernard Willems

Pierre Wolper

Proceedings of the Second International Workshop on Verification of Infinite State Systems, 1997

Cyclic Petri net reachability sets are semi-linear effectively constructible.

[BibT_eX]

[DOI]

Zakaria Bouziane

Proceedings of the Second International Workshop on Verification of Infinite State Systems, 1997

Polynomial-Time Manz-One Reductions for Petri Nets.

[BibT_eX]

[DOI]

Catherine Dufourd

Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1997

Programs with Quasi-Stable Channels are Effectively Recognizable (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Computer Aided Verification, 9th International Conference, 1997

1996

A Polynomial Algorithm for the Membership Problem with Categorial Grammars.

[BibT_eX]

[DOI]

Isabelle Tellier

Theor. Comput. Sci., 1996

Unreliable Channels are Easier to Verify Than Perfect Channels.

[BibT_eX]

[DOI]

Inf. Comput., 1996

1994

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

[BibT_eX]

[DOI]

Laure Petrucci

RAIRO Theor. Informatics Appl., 1994

Decidability of the Termination Problem for Completely Specified Protocols.

[BibT_eX]

[DOI]

Distributed Comput., 1994

Duplication, Insertion and Lossiness Errors in Unreliable Communication Channels.

[BibT_eX]

[DOI]

Proceedings of the Second ACM SIGSOFT Symposium on Foundations of Software Engineering, 1994

1991

Avoiding State Exposion by Composition of Minimal Covering Graphs.

[BibT_eX]

[DOI]

Laure Petrucci

Proceedings of the Computer Aided Verification, 3rd International Workshop, 1991

The Minimal Coverability Graph for Petri Nets.

[BibT_eX]

[DOI]

Proceedings of the Advances in Petri Nets 1993, 1991

1990

Reduction and covering of infinite reachability trees

[BibT_eX]

[DOI]

Inf. Comput., December, 1990

1988

Fifo Nets Without Order Deadlock.

[BibT_eX]

[DOI]

Annie Choquet

Acta Informatica, 1988

1987

A Generalization of the Procedure of Karp and Miller to Well Structured Transition Systems.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 14th International Colloquium, 1987

A Survey on the Decidability Questions for Classes of FIFO Nets.

[BibT_eX]

[DOI]

Louis E. Rosier

Proceedings of the Advances in Petri Nets 1988, 1987

1986

Applications of residues for the analysis of parallel systems communicating by fifo channels.

[BibT_eX]

Annie Choquet

Bull. EATCS, 1986

1985

An Introduction to Fifo Nets-Monogeneous Nets: A Subclass of Fifo Nets.

[BibT_eX]

[DOI]

Gérard Memmi

Theor. Comput. Sci., 1985

Une Généralisation des Théorème de Higman et de Simon aux Mots Infinis.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1985

1984

Petri Nets and monogenous FIFO nets.

[BibT_eX]

Bull. EATCS, 1984

Blocage et vivacité dans les réseaux a pile-file.

[BibT_eX]

[DOI]

Proceedings of the STACS 84, 1984

1983

Fifo nets: a new model of parallel computation.

[BibT_eX]

[DOI]