Paul Gastin

Proceedings of the CONCUR 2014 - Concurrency Theory - 25th International Conference, 2014

Verifying Communicating Multi-pushdown Systems via Split-Width.

[BibT_eX]

[DOI]

C. Aiswarya

Proceedings of the Automated Technology for Verification and Analysis, 2014

2013

Fair Synthesis for Asynchronous Distributed Systems.

[BibT_eX]

[DOI]

ACM Trans. Comput. Log., 2013

Event clock message passing automata: a logical characterization and an emptiness checking algorithm.

[BibT_eX]

[DOI]

S. Akshay

Formal Methods Syst. Des., 2013

Weighted Specifications over Nested Words.

[BibT_eX]

[DOI]

Benjamin Monmege

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

2012

Decidability of well-connectedness for distributed synthesis.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2012

Adding Pebbles to Weighted Automata.

[BibT_eX]

[DOI]

Benjamin Monmege

Proceedings of the Implementation and Application of Automata, 2012

Model Checking Languages of Data Words.

[BibT_eX]

[DOI]

Proceedings of the Foundations of Software Science and Computational Structures, 2012

MSO Decidability of Multi-Pushdown Systems via Split-Width.

[BibT_eX]

[DOI]

Aiswarya Cyriac

Proceedings of the CONCUR 2012 - Concurrency Theory - 23rd International Conference, 2012

A Probabilistic Kleene Theorem.

[BibT_eX]

[DOI]

Proceedings of the Automated Technology for Verification and Analysis, 2012

Specification and Verification using Temporal Logics.

[BibT_eX]

[DOI]

Stéphane Demri

Proceedings of the Modern Applications of Automata Theory., 2012

2010

Uniform satisfiability problem for local temporal logics over Mazurkiewicz traces.

[BibT_eX]

[DOI]

Inf. Comput., 2010

Pebble Weighted Automata and Transitive Closure Logics.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 37th International Colloquium, 2010

Model checking time-constrained scenario-based specifications.

[BibT_eX]

[DOI]

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

10031 Executive Summary - Quantitative Models: Expressiveness and Analysis.

[BibT_eX]

[DOI]

Christel Baier

Kim Guldstrand Larsen

Proceedings of the Quantitative Models: Expressiveness and Analysis, 17.01. - 22.01.2010, 2010

10031 Abstracts Collection - Quantitative Models: Expressiveness and Analysis.

[BibT_eX]

[DOI]

Christel Baier

Kim Guldstrand Larsen

Proceedings of the Quantitative Models: Expressiveness and Analysis, 17.01. - 22.01.2010, 2010

2009

Distributed synthesis for well-connected architectures.

[BibT_eX]

[DOI]

Formal Methods Syst. Des., 2009

Natural Specifications Yield Decidability for Distributed Synthesis of Asynchronous Systems.

[BibT_eX]

[DOI]

Thomas Chatain

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

Weighted versus Probabilistic Logics.

[BibT_eX]

[DOI]

Proceedings of the Developments in Language Theory, 13th International Conference, 2009

2008

On Aperiodic and Star-Free Formal Power Series in Partially Commuting Variables.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2008

A Survey on Small Fragments of First-Order Logic over Finite Words.

[BibT_eX]

[DOI]

Manfred Kufleitner

Int. J. Found. Comput. Sci., 2008

First-order definable languages.

[BibT_eX]

Proceedings of the Logic and Automata: History and Perspectives [in Honor of Wolfgang Thomas]., 2008

2007

Weighted automata and weighted logics.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2007

Uniform Satisfiability in PSPACE for Local Temporal Logics Over Mazurkiewicz Traces.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2007

Timed substitutions for regular signal-event languages.

[BibT_eX]

[DOI]

Formal Methods Syst. Des., 2007

Minimal Counterexample Generation for SPIN.

[BibT_eX]

[DOI]

Pierre Moro

Proceedings of the Model Checking Software, 2007

Automata and Logics for Timed Message Sequence Charts.

[BibT_eX]

[DOI]

S. Akshay

Proceedings of the FSTTCS 2007: Foundations of Software Technology and Theoretical Computer Science, 2007

Local Testing of Message Sequence Charts Is Difficult.

[BibT_eX]

[DOI]

Proceedings of the Fundamentals of Computation Theory, 16th International Symposium, 2007

2006

From local to global temporal logics over Mazurkiewicz traces.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2006

Editorial.

[BibT_eX]

[DOI]

J. Autom. Lang. Comb., 2006

Pure future local temporal logics are expressively complete for Mazurkiewicz traces.

[BibT_eX]

[DOI]

Inf. Comput., 2006

Refinements and Abstractions of Signal-Event (Timed) Languages.

[BibT_eX]

[DOI]

Proceedings of the Formal Modeling and Analysis of Timed Systems, 2006

Intersection of Regular Signal-Event (Timed) Languages.

[BibT_eX]

[DOI]

Proceedings of the Formal Modeling and Analysis of Timed Systems, 2006

A Fresh Look at Testing for Asynchronous Communication.

[BibT_eX]

[DOI]

Puneet Bhateja

Madhavan Mukund

Proceedings of the Automated Technology for Verification and Analysis, 2006

2004

A simple process algebra based on atomic actions with resources.

[BibT_eX]

[DOI]

Michael W. Mislove

Math. Struct. Comput. Sci., 2004

Local temporal logic is expressively complete for cograph dependence alphabets.

[BibT_eX]

[DOI]

Inf. Comput., 2004

Minimization of Counterexamples in SPIN.

[BibT_eX]

[DOI]

Pierre Moro

Proceedings of the Model Checking Software, 2004

Distributed Games and Distributed Control for Asynchronous Systems.

[BibT_eX]

[DOI]

Benjamin Lerman

Proceedings of the LATIN 2004: Theoretical Informatics, 2004

Distributed Games with Causal Memory Are Decidable for Series-Parallel Systems.

[BibT_eX]

[DOI]

Benjamin Lerman

Proceedings of the FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science, 2004

2003

LTL with Past and Two-Way Very-Weak Alternating Automata.

[BibT_eX]

[DOI]

Denis Oddoux

Proceedings of the Mathematical Foundations of Computer Science 2003, 2003

Local LTL with Past Constants Is Expressively Complete for Mazurkiewicz Traces.

[BibT_eX]

[DOI]

Madhavan Mukund

Proceedings of the Mathematical Foundations of Computer Science 2003, 2003

Satisfiability and Model Checking for MSO-definable Temporal Logics are in PSPACE.

[BibT_eX]

[DOI]

Proceedings of the CONCUR 2003, 2003

2002

Resource traces: a domain for processes sharing exclusive resources.

[BibT_eX]

[DOI]

Dan Teodosiu

Theor. Comput. Sci., 2002

A truly concurrent semantics for a process algebra using resource pomsets.

[BibT_eX]

[DOI]

Michael W. Mislove

Theor. Comput. Sci., 2002

LTL Is Expressively Complete for Mazurkiewicz Traces.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2002

Editorial.

[BibT_eX]

[DOI]

J. Autom. Lang. Comb., 2002

An Elementary Expressively Complete Temporal Logic for Mazurkiewicz Traces.

[BibT_eX]

[DOI]

Madhavan Mukund

Proceedings of the Automata, Languages and Programming, 29th International Colloquium, 2002

Safety and Liveness Properties for Real Traces and a Direct Translation from LTL to Monoids.

[BibT_eX]

[DOI]

Proceedings of the Formal and Natural Computing, 2002

2001

Model Checking Systems of Replicated Processes with Spin.

[BibT_eX]

[DOI]

Fabrice Derepas

Proceedings of the Model Checking Software, 2001

Avoiding State Explosion for Distributed Systems with Timestamps.

[BibT_eX]

[DOI]

Fabrice Derepas

David Plainfossé

Proceedings of the FME 2001: Formal Methods for Increasing Software Productivity, 2001

Fast LTL to Büchi Automata Translation.

[BibT_eX]

[DOI]

Denis Oddoux

Proceedings of the Computer Aided Verification, 13th International Conference, 2001

2000

Asynchronous cellular automata for pomsets.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2000

1999

The Kleene-Schützenberger Theorem for Formal Power Series in Partially Commuting Variables.

[BibT_eX]

[DOI]

Inf. Comput., 1999

A Truly Concurrent Semantics for a Simple Parallel Programming Language.

[BibT_eX]

[DOI]

Michael W. Mislove

Proceedings of the Computer Science Logic, 13th International Workshop, 1999

An Expressively Complete Temporal Logic without Past Tense Operators for Mazurkiewicz Traces.

[BibT_eX]

[DOI]

Proceedings of the Computer Science Logic, 13th International Workshop, 1999

1998

Characterization of the Expressive Power of Silent Transitions in Timed Automata.

[BibT_eX]

[DOI]

Fundam. Informaticae, 1998

Approximating Traces.

[BibT_eX]

[DOI]

Acta Informatica, 1998

A (Non-elementary) Modular Decision Procedure for LTrL.

[BibT_eX]

[DOI]

Raphaël Meyer

Proceedings of the Mathematical Foundations of Computer Science 1998, 1998

1997

Removing epsilon-Transitions in Timed Automata.

[BibT_eX]

[DOI]

Proceedings of the STACS 97, 14th Annual Symposium on Theoretical Aspects of Computer Science, Lübeck, Germany, February 27, 1997

On Recognizable and Rational Formal Power Series in Partially Commuting Variables.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 24th International Colloquium, 1997

1996

On the Power of Non-Observable Actions in Timed Automata.

[BibT_eX]

[DOI]

Proceedings of the STACS 96, 1996

Asynchronous Cellular Automata for Pomsets Without Auto-concurrency.

[BibT_eX]

[DOI]

Proceedings of the CONCUR '96, 1996

1995

Rational and Recognizable Complex Trace Languages

[BibT_eX]

[DOI]

Inf. Comput., January, 1995

On Congruences and Partial Orders.

[BibT_eX]

[DOI]

Serge Bauget

Proceedings of the Mathematical Foundations of Computer Science 1995, 1995

A Domain for Concurrent Termination: A Generalization of Mazurkiewicz Traces (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 22nd International Colloquium, 1995

Recent Developments in Trace Theory.

[BibT_eX]

Proceedings of the Developments in Language Theory II, 1995

Infinite Traces.

[BibT_eX]

[DOI]

Proceedings of the Book of Traces, 1995

1994

An Extension of Kleene's and Ochmanski's Theorems to Infinite Traces.

[BibT_eX]

[DOI]

Wieslaw Zielonka

Theor. Comput. Sci., 1994

1993

The Poset of Infinitary Traces.

[BibT_eX]

[DOI]

Brigitte Rozoy

Theor. Comput. Sci., 1993

An Efficient Crash-tolerant Sequential Traversal.

[BibT_eX]

[DOI]

Vincent Villain

Parallel Process. Lett., 1993

1992

Decidability of the Star Problem in A* x {b}*.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1992

Poset Properties of Complex Traces.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 1992, 1992

Asynchronous Cellular Automata for Infinite Traces.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 19th International Colloquium, 1992

A survey of recognizable languages with infinite traces.

[BibT_eX]

[DOI]

Proceedings of the Advances in Petri Nets 1992, The DEMON Project, 1992

1991

Recognizable and Rational Languages of Finite and Infinite Traces.

[BibT_eX]

[DOI]

Proceedings of the STACS 91, 1991

Recognizable Complex Trace Languages.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 1991, 1991

A Kleene Theorem for Infinite Trace Languages.

[BibT_eX]

[DOI]

Wieslaw Zielonka

Proceedings of the Automata, Languages and Programming, 18th International Colloquium, 1991

1990

Un Modèle Asynchrone pour les Systèmes Distribués.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1990

A Linear Fault-Tolerant Naming Algorithm.

[BibT_eX]

[DOI]

Joffroy Beauquier

Vincent Villain

Proceedings of the Distributed Algorithms, 4th International Workshop, 1990

Infinite Traces.

[BibT_eX]

[DOI]