Publications : 1998
-
[ABBL98]
-
L. Aceto, P. Bouyer, A. Burgueño, and K. G. Larsen.
The Power of Reachability Testing for Timed Automata.
In Proceedings of the 18th Conference on Foundations of
Software Technology and Theoretical Computer Science (FSTTCS'98),
volume 1530 of Lecture Notes in Computer Science, pages 245--256, Chennai,
India, December 1998. Springer.
[ BibTex |
Web page |
PS ]
-
[CP98c]
-
H. Comon and V. Padovani.
Specifications Consistency Verification. Final Report.
Contract Report MAR/UAO/C/98/0080, December 1998.
280 pages.
[ BibTex ]
-
[BDGP98]
-
B. Bérard, V. Diekert, P. Gastin, and A. Petit.
Characterization of the Expressive Power of Silent Transitions
in Timed Automata.
Fundamenta Informaticae, 36(2):145--182, November 1998.
[ BibTex |
Web page |
PS ]
-
[BH98]
-
M. Bidoit and R. Hennicker.
Modular Correctness Proofs of Behavioural Implementations.
Acta Informatica, 35(11):951--1005, November 1998.
doi:
10.1007/s002360050149.
[ BibTex |
DOI ]
-
[LL98]
-
F. Laroussinie and K. G. Larsen.
CMC: A Tool for Compositional Model-Checking of Real-Time
Systems.
In Proceedings of IFIP TC6 WG6.1 Joint International
Conference on Formal Description Techniques for Distributed
Systems and Communication Protocols (FORTE'XI) and Protocol
Specification, Testing and Verification (PSTV'XVIII), volume 135 of
IFIP Conference Proceedings, pages 439--456, Paris, France, November 1998.
Kluwer Academic Publishers.
[ BibTex |
Web page |
PS ]
-
[CDF98]
-
G. Cécé, P.-É. Deutsch, and A. Finkel.
FORMAashSSCOP --- LSV, bilan de l'année 1998.
Contract report, FORMA, November 1998.
[ BibTex ]
-
[Pet98]
-
A. Petit.
Le model-checking, une technique de vérification en plein
essor. Introduction.
Contract report, EDF/DER/MOS - LSV, October 1998.
[ BibTex ]
-
[LPS98]
-
F. Laroussinie, A. Petit, and Ph. Schnoebelen.
Le model-checking, une technique de vérification en plein
essor. I --- Principes et techniques.
Contract report, EDF/DER/MOS - LSV, October 1998.
[ BibTex ]
-
[Sch98a]
-
Ph. Schnoebelen.
Le model-checking, une technique de vérification en plein
essor. III --- Spécifier pour vérifier.
Contract report, EDF/DER/MOS - LSV, October 1998.
[ BibTex ]
-
[BCD+98]
-
B. Bérard, G. Cécé, C. Dufourd, A. Finkel,
F. Laroussinie, A. Petit, Ph. Schnoebelen, and G. Sutre.
Le model-checking, une technique de vérification en plein
essor. II --- Quelques outils.
Contract report, EDF/DER/MOS - LSV, October 1998.
[ BibTex ]
-
[CP98b]
-
S. Christensen and L. Petrucci.
How to Determine and Use Place Flows in Coloured Petri Nets.
In Proceedings of the IEEE International Conference on
Systems, Man and Cybernetics (SMC 2000), pages 66--71, San Diego,
California, USA, October 1998. Argos Press.
[ BibTex ]
-
[Duf98]
-
C. Dufourd.
Réseaux de Petri avec ResetashTransfert :
décidabilité et indécidabilité.
Thèse de doctorat, Laboratoire Spécification et
Vérification, ENS Cachan, France, October 1998.
[ BibTex |
Web page |
PS ]
-
[GMPW98]
-
G. Guaiana, R. Meyer, A. Petit, and P. Weil.
An Extension of the Wreath Product Principle for Finite
Mazurkiewicz Traces.
Information Processing Letters, 67(6):277--282, September 1998.
[ BibTex |
Web page |
PS ]
-
[CP98d]
-
H. Comon and V. Padovani.
Specifications Consistency Verification. Intermediate Report.
Contract Report MAR/UAO/C/98/0051, September 1998.
[ BibTex ]
-
[LS98]
-
D. Lugiez and Ph. Schnoebelen.
The Regular Viewpoint on PA-Processes.
In Proceedings of the 9th International Conference on
Concurrency Theory (CONCUR'98), volume 1466 of Lecture Notes in
Computer Science, pages 50--66, Nice, France, September 1998. Springer.
doi:
10.1007/BFb0055615.
[ BibTex |
DOI |
Web page |
PS |
PDF ]
-
[DM98]
-
M. Duflot and N. Markey.
Évaluation de l'outil UPPAAL sur le problème de
l'ICC.
Contract report, EDF/DER/MOS - LSV, September 1998.
[ BibTex ]
-
[GMP98]
-
P. Gastin, R. Meyer, and A. Petit.
A (non-elementary) modular decision procedure for LTrL.
In Proceedings of the 23rd International Symposium on
Mathematical Foundations of Computer Science (MFCS'98), volume 1450
of Lecture Notes in Computer Science, pages 356--365, Brno, Czech Republic,
August 1998. Springer.
[ BibTex |
Web page |
PS ]
-
[Fin98]
-
A. Finkel.
Analyse des systèmes infinis bien structurés ou
<< reconnaissables >>.
Invited tutorial, 3ème École d'été Modélisation
et Vérification des Processus Parallèles (MOVEP'98), Nantes,
France, July 1998.
[ BibTex ]
-
[Lab98]
-
A. Labroue.
Conditions de vivacité dans les automates temporisés.
Rapport de DEA, DEA Informatique, Orsay, France, July 1998.
[ BibTex |
Web page |
PS ]
-
[DFS98]
-
C. Dufourd, A. Finkel, and Ph. Schnoebelen.
Reset Nets between Decidability and Undecidability.
In Proceedings of the 25th International Colloquium on
Automata, Languages and Programming (ICALP'98), volume 1443 of
Lecture Notes in Computer Science, pages 103--115, Aalborg, Denmark, July
1998. Springer.
doi:
10.1007/BFb0055044.
[ BibTex |
DOI |
Web page |
PS ]
-
[Sch98b]
-
Ph. Schnoebelen.
Regular Tree Languages for Process Algebra.
Invited lecture, 3rd International Workshop on Verification of
Infinite State Systems (INFINITY'98), Aalborg, Denmark, July 1998.
[ BibTex ]
-
[BP98]
-
K. Barkaoui and L. Petrucci.
Structural Analysis of Workflow Nets with Shared Resources.
In Proceedings of Workflow Management: Net-Based
Concepts, Models, Techniques and Tools (WFM'98), volume 98/7 of
Computing Science Report, pages 82--95, Lisbon, Portugal, June 1998.
Eindhoven University of Technology, Eindhoven, The Netherlands.
[ BibTex |
Web page |
PS ]
-
[AGP+98]
-
L. Albert, P. Gastin, B. Petazzoni, A. Petit, N. Puech, and
P. Weil.
Cours et exercices d'informatique, Classes préparatoires,
premier et second cycles universitaires.
Vuibert, June 1998.
[ BibTex ]
-
[Bou98]
-
P. Bouyer.
Automates temporisés et modularité.
Rapport de DEA, DEA Algorithmique, Paris, France, June 1998.
[ BibTex |
Web page |
PS ]
-
[CJ98b]
-
H. Comon and Y. Jurski.
Multiple Counters Automata, Safety Analysis and Presburger
Arithmetic.
In Proceedings of the 10th International Conference on
Computer Aided Verification (CAV'98), volume 1427 of Lecture Notes in
Computer Science, pages 268--279, Vancouver, British Columbia, Canada, June
1998. Springer.
[ BibTex |
Web page |
PS ]
-
[CNNR98]
-
H. Comon, P. Narendran, R. Nieuwenhuis, and M. Rusinowitch.
Decision Problems in Ordered Rewriting.
In Proceedings of the 13th Annual IEEE Symposium on Logic
in Computer Science (LICS'98), pages 276--286, Indianapolis, Indiana,
USA, June 1998. IEEE Computer Society Press.
[ BibTex |
Web page |
PS ]
-
[Com98b]
-
H. Comon.
Completion of Rewrite Systems with Membership Constraints.
Part I: Deduction Rules.
Journal of Symbolic Computation, 25(4):397--420, April 1998.
[ BibTex |
Web page |
PS ]
-
[Com98c]
-
H. Comon.
Completion of Rewrite Systems with Membership Constraints.
Part II: Constraint Solving.
Journal of Symbolic Computation, 25(4):421--454, April 1998.
[ BibTex |
Web page |
PS ]
-
[FS98]
-
A. Finkel and Ph. Schnoebelen.
Fundamental Structures in Well-Structured Infinite Transition
Systems.
In Proceedings of the 3rd Latin American Symposium on
Theoretical Informatics (LATIN'98), volume 1380 of Lecture Notes in
Computer Science, pages 102--118, Campinas, Brasil, April 1998. Springer.
doi:
10.1007/BFb0054314.
[ BibTex |
DOI |
Web page |
PS ]
-
[VF98]
-
M. Veloso Peixoto and L. Fribourg.
Unfolding Parametric Automata.
In Proceedings of the 3rd Latin American Symposium on
Theoretical Informatics (LATIN'98), volume 1380 of Lecture Notes in
Computer Science, pages 88--101, Campinas, Brasil, April 1998. Springer.
[ BibTex ]
-
[Fri98]
-
L. Fribourg.
A Closed-Form Evaluation for Extended Timed Automata.
Research Report LSV-98-2, Laboratoire Spécification et
Vérification, ENS Cachan, France, March 1998.
[ BibTex |
Web page |
PS ]
-
[Com98a]
-
H. Comon.
About proofs by consistency.
In Proceedings of the 9th International Conference on
Rewriting Techniques and Applications (RTA'98), volume 1379 of
Lecture Notes in Computer Science, pages 136--137, Tsukuba, Japan, March
1998. Springer.
Invited lecture.
[ BibTex ]
-
[Lar98]
-
F. Laroussinie.
Analyse de l'ICC: modélisation.
Contract report, EDF/DER/MOS - LSV, March 1998.
[ BibTex ]
-
[MP98]
-
R. Meyer and A. Petit.
Expressive Completeness of LTrL on Finite Traces: An
Algebraic Proof.
In Proceedings of the 15th Annual Symposium on Theoretical
Aspects of Computer Science (STACS'98), volume 1373 of Lecture Notes
in Computer Science, pages 533--543, Paris, France, February 1998. Springer.
[ BibTex ]
-
[DS98]
-
S. Demri and Ph. Schnoebelen.
The Complexity of Propositional Linear Temporal Logics in Simple
Cases (Extended Abstract).
In Proceedings of the 15th Annual Symposium on Theoretical
Aspects of Computer Science (STACS'98), volume 1373 of Lecture Notes
in Computer Science, pages 61--72, Paris, France, February 1998. Springer.
doi:
10.1007/BFb0028549.
[ BibTex |
DOI |
Web page |
PS ]
-
[BF98]
-
Z. Bouziane and A. Finkel.
The Equivalence Problem for Commutative Semigroups and
Reversible Petri Nets is Complete in Exponential Space under Log-Lin
Reducibility.
In Proceedings of the International Conference in Semigroups
and its Related Topics, pages 63--76, Kunming, China, 1998. Springer.
[ BibTex ]
-
[BBP98]
-
B. Bérard, M. Bidoit, and A. Petit.
Recommandations sur le cahier des charges SRC.
Contract report, EDF/DER/MOS - LSV, 1998.
[ BibTex ]
-
[CFG98]
-
Ch. Collet, A. Finkel, and R. Gherbi.
CapRe: A Gaze Tracking System in Man-Machine Interaction.
Journal of Advanced Computational Intelligence, 2(3):77--81, 1998.
[ BibTex |
Web page |
PS ]
-
[CP98a]
-
Ch. Cérin and A. Petit.
Application of Algebraic Techniques to Compute the Efficiency
Measure for Multithreaded Architecture.
In Proceedings of the Workshop on Multithreaded Execution,
Architecture and Compilation (MTEAC'98), Las Vegas, Nevada, USA,
January 1998.
[ BibTex |
Web page |
PS ]
-
[Céc98]
-
G. Cécé.
Vérification, analyse et approximations symboliques des
automates communicants.
Thèse de doctorat, Laboratoire Spécification et
Vérification, ENS Cachan, France, January 1998.
[ BibTex |
Web page |
PS ]
-
[CJ98a]
-
H. Comon and Y. Jurski.
Higher-order matching and tree automata.
In Selected Papers from the 11th International Workshop on
Computer Science Logic (CSL'97), volume 1414 of Lecture Notes in
Computer Science, pages 157--176, Århus, Denmark, 1998. Springer.
Invited lecture.
[ BibTex |
Web page |
PS ]
-
[Sif98]
-
J. Sifakis.
Action FORMA. Bilan de la première année.
Contract report, DSP-STTC/CNRS/MENRT, January 1998.
[ BibTex ]
This file was generated by
bibtex2html 1.98.