| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Benedikt Bollig, Aiswarya Cyriac, Paul Gastin, K. Narayan Kumar |
Model Checking Languages of Data Words.  |
FoSSaCS  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Benedikt Bollig, Aiswarya Cyriac, Paul Gastin, Marc Zeitoun |
Temporal Logics for Concurrent Recursive Programs: Satisfiability and Model Checking. |
MFCS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Paul Gastin, Dietrich Kuske |
Uniform satisfiability problem for local temporal logics over Mazurkiewicz traces. |
Inf. Comput. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Paul Gastin, François Laroussinie (eds.) |
CONCUR 2010 - Concurrency Theory, 21th International Conference, CONCUR 2010, Paris, France, August 31-September 3, 2010. Proceedings |
CONCUR |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Benedikt Bollig, Paul Gastin, Benjamin Monmege, Marc Zeitoun |
Pebble Weighted Automata and Transitive Closure Logics. |
ICALP |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | S. Akshay, Paul Gastin, Madhavan Mukund, K. Narayan Kumar |
Model checking time-constrained scenario-based specifications. |
FSTTCS |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Paul Gastin, Nathalie Sznajder, Marc Zeitoun |
Distributed synthesis for well-connected architectures. |
Formal Methods in System Design |
2009 |
DBLP DOI BibTeX RDF |
Synthesis problem, Synchronous architectures, Distributed systems |
| 1 | Benedikt Bollig, Paul Gastin |
Weighted versus Probabilistic Logics. |
Developments in Language Theory |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Thomas Chatain, Paul Gastin, Nathalie Sznajder |
Natural Specifications Yield Decidability for Distributed Synthesis of Asynchronous Systems. |
SOFSEM |
2009 |
DBLP DOI BibTeX RDF |
Distributed synthesis, Asynchronous systems |
| 1 | Volker Diekert, Paul Gastin, Manfred Kufleitner |
A Survey on Small Fragments of First-Order Logic over Finite Words. |
Int. J. Found. Comput. Sci. |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Manfred Droste, Paul Gastin |
On Aperiodic and Star-Free Formal Power Series in Partially Commuting Variables. |
Theory Comput. Syst. |
2008 |
DBLP DOI BibTeX RDF |
Aperiodic languages, Star-free languages, Traces, Semiring, Formal power series, Weighted automata |
| 1 | S. Akshay, Benedikt Bollig, Paul Gastin, Madhavan Mukund, K. Narayan Kumar |
Distributed Timed Automata with Independently Evolving Clocks. |
CONCUR |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Volker Diekert, Paul Gastin |
First-order definable languages. |
Logic and Automata |
2008 |
DBLP BibTeX RDF |
|
| 1 | Manfred Droste, Paul Gastin |
Weighted automata and weighted logics. |
Theor. Comput. Sci. |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Paul Gastin, Dietrich Kuske |
Uniform Satisfiability in PSPACE for Local Temporal Logics Over Mazurkiewicz Traces. |
Fundam. Inform. |
2007 |
DBLP BibTeX RDF |
|
| 1 | Béatrice Bérard, Paul Gastin, Antoine Petit |
Timed substitutions for regular signal-event languages. |
Formal Methods in System Design |
2007 |
DBLP DOI BibTeX RDF |
Signal-event word, Refinement, Abstraction, Timed automata, Substitution |
| 1 | Paul Gastin, Pierre Moro |
Minimal Counterexample Generation for SPIN. |
SPIN |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Puneet Bhateja, Paul Gastin, Madhavan Mukund, K. Narayan Kumar |
Local Testing of Message Sequence Charts Is Difficult. |
FCT |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | S. Akshay, Benedikt Bollig, Paul Gastin |
Automata and Logics for Timed Message Sequence Charts. |
FSTTCS |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Volker Diekert, Paul Gastin |
From local to global temporal logics over Mazurkiewicz traces. |
Theor. Comput. Sci. |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Volker Diekert, Paul Gastin |
Pure future local temporal logics are expressively complete for Mazurkiewicz traces. |
Inf. Comput. |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Béatrice Bérard, Paul Gastin, Antoine Petit |
Refinements and Abstractions of Signal-Event (Timed) Languages. |
FORMATS |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Béatrice Bérard, Paul Gastin, Antoine Petit |
Intersection of Regular Signal-Event (Timed) Languages. |
FORMATS |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Puneet Bhateja, Paul Gastin, Madhavan Mukund |
A Fresh Look at Testing for Asynchronous Communication. |
ATVA |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Paul Gastin, Nathalie Sznajder, Marc Zeitoun |
Distributed Synthesis for Well-Connected Architectures. |
FSTTCS |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Paul Gastin, Dietrich Kuske |
Uniform Satisfiability Problem for Local Temporal Logics over Mazurkiewicz Traces. |
CONCUR |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Manfred Droste, Paul Gastin |
Weighted Automata and Weighted Logics. |
ICALP |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Paul Gastin, Michael W. Mislove |
A simple process algebra based on atomic actions with resources. |
Mathematical Structures in Computer Science |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Volker Diekert, Paul Gastin |
Local temporal logic is expressively complete for cograph dependence alphabets. |
Inf. Comput. |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Volker Diekert, Paul Gastin |
Pure Future Local Temporal Logics Are Expressively Complete for Mazurkiewicz Traces. |
LATIN |
2004 |
DBLP DOI BibTeX RDF |
concurrency, Temporal logics, Mazurkiewicz traces |
| 1 | Paul Gastin, Benjamin Lerman, Marc Zeitoun |
Distributed Games and Distributed Control for Asynchronous Systems. |
LATIN |
2004 |
DBLP DOI BibTeX RDF |
Distributed game, distributed control, distributed strategy |
| 1 | Paul Gastin, Pierre Moro, Marc Zeitoun |
Minimization of Counterexamples in SPIN. |
SPIN |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Paul Gastin, Benjamin Lerman, Marc Zeitoun |
Distributed Games with Causal Memory Are Decidable for Series-Parallel Systems. |
FSTTCS |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Paul Gastin, Dietrich Kuske |
Satisfiability and Model Checking for MSO-definable Temporal Logics are in PSPACE. |
CONCUR |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Paul Gastin, Denis Oddoux |
LTL with Past and Two-Way Very-Weak Alternating Automata. |
MFCS |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Paul Gastin, Madhavan Mukund, K. Narayan Kumar |
Local LTL with Past Constants Is Expressively Complete for Mazurkiewicz Traces. |
MFCS |
2003 |
DBLP DOI BibTeX RDF |
concurrency, Temporal logics, Mazurkiewicz traces |
| 1 | Paul Gastin, Michael W. Mislove |
A truly concurrent semantics for a process algebra using resource pomsets. |
Theor. Comput. Sci. |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Paul Gastin, Dan Teodosiu |
Resource traces: a domain for processes sharing exclusive resources. |
Theor. Comput. Sci. |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Volker Diekert, Paul Gastin |
LTL Is Expressively Complete for Mazurkiewicz Traces. |
J. Comput. Syst. Sci. |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Paul Gastin, Madhavan Mukund |
An Elementary Expressively Complete Temporal Logic for Mazurkiewicz Traces. |
ICALP |
2002 |
DBLP DOI BibTeX RDF |
concurrency, Temporal logics, Mazurkiewicz traces |
| 1 | Volker Diekert, Paul Gastin |
Safety and Liveness Properties for Real Traces and a Direct Translation from LTL to Monoids. |
Formal and Natural Computing |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Volker Diekert, Paul Gastin |
Local Temporal Logic is Expressively Complete for Cograph Dependence Alphabets. |
LPAR |
2001 |
DBLP DOI BibTeX RDF |
concurrency, Temporal logics, Mazurkiewicz traces |
| 1 | Fabrice Derepas, Paul Gastin |
Model Checking Systems of Replicated Processes with Spin. |
SPIN |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Fabrice Derepas, Paul Gastin, David Plainfossé |
Avoiding State Explosion for Distributed Systems with Timestamps. |
FME |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Paul Gastin, Denis Oddoux |
Fast LTL to Büchi Automata Translation. |
CAV |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Manfred Droste, Paul Gastin, Dietrich Kuske |
Asynchronous cellular automata for pomsets. |
Theor. Comput. Sci. |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Volker Diekert, Paul Gastin |
LTL Is Expressively Complete for Mazurkiewicz Traces. |
ICALP |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Manfred Droste, Paul Gastin |
The Kleene-Schützenberger Theorem for Formal Power Series in Partially Commuting Variables. |
Inf. Comput. |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Volker Diekert, Paul Gastin |
An Expressively Complete Temporal Logic without Past Tense Operators for Mazurkiewicz Traces. |
CSL |
1999 |
DBLP DOI BibTeX RDF |
concurrency, Temporal logics, Mazurkiewicz traces |
| 1 | Paul Gastin, Michael W. Mislove |
A Truly Concurrent Semantics for a Simple Parallel Programming Language. |
CSL |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Volker Diekert, Paul Gastin |
Approximating Traces. |
Acta Inf. |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Béatrice Bérard, Antoine Petit, Volker Diekert, Paul Gastin |
Characterization of the Expressive Power of Silent Transitions in Timed Automata. |
Fundam. Inform. |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Paul Gastin, Raphaël Meyer, Antoine Petit |
A (Non-elementary) Modular Decision Procedure for LTrL. |
MFCS |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Manfred Droste, Paul Gastin |
On Recognizable and Rational Formal Power Series in Partially Commuting Variables. |
ICALP |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Volker Diekert, Paul Gastin, Antoine Petit |
Removing epsilon-Transitions in Timed Automata. |
STACS |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Manfred Droste, Paul Gastin |
Asynchronous Cellular Automata for Pomsets Without Auto-concurrency. |
CONCUR |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Béatrice Bérard, Paul Gastin, Antoine Petit |
On the Power of Non-Observable Actions in Timed Automata. |
STACS |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Volker Diekert, Paul Gastin, Antoine Petit |
Rational and Recognizable Complex Trace Languages |
Inf. Comput. |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Volker Diekert, Paul Gastin |
A Domain for Concurrent Termination: A Generalization of Mazurkiewicz Traces (Extended Abstract). |
ICALP |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Serge Bauget, Paul Gastin |
On Congruences and Partial Orders. |
MFCS |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Volker Diekert, Paul Gastin, Antoine Petit |
Recent Developments in Trace Theory. |
Developments in Language Theory |
1995 |
DBLP BibTeX RDF |
|
| 1 | Paul Gastin, Antoine Petit, Wieslaw Zielonka |
An Extension of Kleene's and Ochmanski's Theorems to Infinite Traces. |
Theor. Comput. Sci. |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Paul Gastin, Brigitte Rozoy |
The Poset of Infinitary Traces. |
Theor. Comput. Sci. |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Paul Gastin, Vincent Villain |
An Efficient Crash-tolerant Sequential Traversal. |
Parallel Processing Letters |
1993 |
DBLP BibTeX RDF |
|
| 1 | Paul Gastin, Edward Ochmanski, Antoine Petit, Brigitte Rozoy |
Decidability of the Star Problem in A* x {b}*. |
Inf. Process. Lett. |
1992 |
DBLP DOI BibTeX RDF |
|
| 1 | Paul Gastin, Antoine Petit |
A survey of recognizable languages with infinite traces. |
Advances in Petri Nets: The DEMON Project |
1992 |
DBLP DOI BibTeX RDF |
|
| 1 | Paul Gastin, Antoine Petit |
Asynchronous Cellular Automata for Infinite Traces. |
ICALP |
1992 |
DBLP DOI BibTeX RDF |
|
| 1 | Paul Gastin, Antoine Petit |
Poset Properties of Complex Traces. |
MFCS |
1992 |
DBLP DOI BibTeX RDF |
|
| 1 | Paul Gastin, Antoine Petit, Wieslaw Zielonka |
A Kleene Theorem for Infinite Trace Languages. |
ICALP |
1991 |
DBLP DOI BibTeX RDF |
|
| 1 | Volker Diekert, Paul Gastin, Antoine Petit |
Recognizable Complex Trace Languages. |
MFCS |
1991 |
DBLP DOI BibTeX RDF |
|
| 1 | Paul Gastin |
Recognizable and Rational Languages of Finite and Infinite Traces. |
STACS |
1991 |
DBLP DOI BibTeX RDF |
|
| 1 | Paul Gastin |
Un Modèle Asynchrone pour les Systèmes Distribués. |
Theor. Comput. Sci. |
1990 |
DBLP DOI BibTeX RDF |
|
| 1 | Joffroy Beauquier, Paul Gastin, Vincent Villain |
A Linear Fault-Tolerant Naming Algorithm. |
WDAG |
1990 |
DBLP DOI BibTeX RDF |
naming problem, fail-stop, synchronous message passing, fault-tolerance, distributed algorithms |
| 1 | Paul Gastin |
Infinite Traces. |
Semantics of Systems of Concurrent Processes |
1990 |
DBLP DOI BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")