Team MExICo

Members
Overall Objectives
Scientific Foundations
Application Domains
Software
New Results
Contracts and Grants with Industry
Other Grants and Activities
Dissemination
Bibliography

Bibliography

Publications of the year

Articles in International Peer-Reviewed Journal

[1]
É. André, Th. Chatain, E. Encrenaz, L. Fribourg.
An Inverse Method for Parametric Timed Automata, in: International Journal of Foundations of Computer Science, October 2009, vol. 20, no 5, p. 819-836
http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/ACEF-ijfcs09.pdf.
[2]
B. Bollig, J.-P. Katoen, C. Kern, M. Leucker.
Learning Communicating Automata from MSCs, in: IEEE Transactions on Software Engineering, 2009
http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BKKL-tse09.pdf, To appear.
[3]
C. Boutrous-Saab, D. Coulibaly, S. Haddad, T. Melliti, P. Moreaux, S. Rampacek.
An Integrated Framework for Web Services Orchestration, in: International Journal of Web Services Research, September 2009, vol. 6, no 4, p. 1-29.
[4]
P. Bouyer, S. Haddad, P.-A. Reynier.
Undecidability Results for Timed Automata with Silent Transitions, in: Fundamenta Informaticae, 2009, vol. 92, no 1-2, p. 1-25
http://www.lsv.ens-cachan.fr/Publis/RAPPORTS_LSV/PDF/rr-lsv-2007-12.pdf.
[5]
S. Donatelli, S. Haddad, J. Sproston.
Model Checking Timed and Stochastic Properties with CSLTA, in: IEEE Transactions on Software Engineering, March-April 2009, vol. 35, no 2, p. 224-240
http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/DHS-tose09.pdf.
[6]
P. Gastin, N. Sznajder, M. Zeitoun.
Distributed synthesis for well-connected architectures, in: Formal Methods in System Design, June 2009, vol. 34, no 3, p. 215-237
http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/GSZ-fmsd09.pdf.

Invited Conferences

[7]
B. Bollig, P. Gastin.
Weighted versus Probabilistic Logics, in: Proceedings of the 13th International Conference on Developments in Language Theory (DLT'09), Stuttgart, Germany, V. Diekert, D. Nowotka (editors), Lecture Notes in Computer Science, Springer, June-July 2009, vol. 5583, p. 18-38
http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BG-dlt09.pdf.

International Peer-Reviewed Conference/Proceedings

[8]
É. André, Th. Chatain, O. De Smet, L. Fribourg, S. Ruel.
Synthèse de contraintes temporisées pour une architecture d'automatisation en réseau, in: Actes du 7ème Colloque sur la Modélisation des Systèmes Réactifs (MSR'09), Nantes, France, O. H. Roux (editor), Hermès, November 2009
http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/ACDFR-msr09.pdf, To appear.
[9]
B. Bérard, S. Haddad.
Interrupt Timed Automata, in: Proceedings of the 12th International Conference on Foundations of Software Science and Computation Structures (FoSSaCS'09), York, UK, L. de Alfaro (editor), Lecture Notes in Computer Science, Springer, March 2009, vol. 5504, p. 197-211
http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BH-fossacs09.pdf.
[10]
B. Bollig, M.-L. Grindei, P. Habermehl.
Realizability of Concurrent Recursive Programs, in: Proceedings of the 12th International Conference on Foundations of Software Science and Computation Structures (FoSSaCS'09), York, UK, L. de Alfaro (editor), Lecture Notes in Computer Science, Springer, March 2009, vol. 5504, p. 410-424
http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BGH-fossacs09.pdf.
[11]
B. Bollig, P. Habermehl, C. Kern, M. Leucker.
Angluin-Style Learning of NFA, in: Proceedings of the 21st International Joint Conference on Artificial Intelligence (IJCAI'09), Pasadena, CA, USA, C. Boutilier (editor), AAAI Press, July 2009, p. 1004-1009
http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BHKL-ijcai09.pdf.
[12]
B. Bollig, J.-P. Katoen, C. Kern, M. Leucker.
SMA—The Smyle Modeling Approach, in: Proceedings of the 3rd IFIP TC2 Central and East European Conference on Software Engineering Techniques (CEE-SET'08), Brno, Czech Republic, Z. Huzar, B. Meyer (editors), Lecture Notes in Computer Science, Springer, 2009
http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BKKL-ceeset2008.pdf, To appear.
[13]
A. Bouillard, S. Haar, S. Rosario.
Critical paths in the Partial Order Unfolding of a Stochastic Petri Net, in: Proceedings of the 7th International Conference on Formal Modelling and Analysis of Timed Systems (FORMATS'09), Budapest, Hungary, J. Ouaknine, F. Vaandrager (editors), Lecture Notes in Computer Science, Springer, September 2009, vol. 5813, p. 43-57
http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BHR-formats09.pdf.
[14]
A. Bouillard, S. Rosario, A. Benveniste, S. Haar.
Monotonicity in Service Orchestrations, in: Proceedings of the 30th International Conference on Applications and Theory of Petri Nets (ICATPN'09), Paris, France, G. Franceschinis, K. Wolf (editors), Lecture Notes in Computer Science, Springer, June 2009, vol. 5606, p. 263-282
http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BRBH-atpn09.pdf.
[15]
P. Bulychev, Th. Chatain, A. David, K. G. Larsen.
Checking simulation relation between timed game automata, in: Proceedings of the 7th International Conference on Formal Modelling and Analysis of Timed Systems (FORMATS'09), Budapest, Hungary, J. Ouaknine, F. Vaandrager (editors), Lecture Notes in Computer Science, Springer, September 2009, vol. 5813, p. 73-87
http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BCDL-formats09.pdf.
[16]
Th. Chatain, A. David, K. G. Larsen.
Playing Games with Timed Games, in: Proceedings of the 3rd IFAC Conference on Analysis and Design of Hybrid Systems (ADHS'09), Zaragoza, Spain, A. Giua, M. Silva, J. Zaytoon (editors), September 2009
http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/CDL-adhs09.pdf.
[17]
Th. Chatain, P. Gastin, N. Sznajder.
Natural Specifications Yield Decidability for Distributed Synthesis of Asynchronous Systems, in: Proceedings of the 35th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM'09), Špindlerův Mlýn, Czech Republic, M. Nielsen, A. Kučera, P. Bro Miltersen, C. Palamidessi, P. Tůma, F. Valencia (editors), Lecture Notes in Computer Science, Springer, January 2009, vol. 5404, p. 141-152
http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/CGS-sofsem09.pdf.
[18]
A. Gaiser, S. Schwoon.
Comparison of Algorithms for Checking Emptiness on Büchi Automata, in: Proceedings of the 5th Annual Doctoral Workshop on Mathematical and Engineering Methods in Computer Science (MEMICS), Znojmo, Czechia, November 2009
http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/GS-memics09.pdf.
[19]
S. Haar.
Qualitative Diagnosability of Labeled Petri Nets Revisited, in: 48th IEEE Conference on Decision and Control, 2009.
[20]
S. Haddad, F. Kordon, L. Petrucci, J.-F. Pradat-Peyre, N. Trèves.
Efficient State-Based Analysis by Introducing Bags in Petri Nets Color Domains, in: Proceedings of the 28th American Control Conference (ACC'09), Saint Louis, MO, USA, June 2009, p. 5018-5025
http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/HKPPT-acc09.pdf.
[21]
S. Haddad, N. Pekergin.
Using Stochastic Comparison for Efficient Model Checking of Uncertain Markov Chains, in: Proceedings of the 6th International Conference on Quantitative Evaluation of Systems (QEST'09), Budapest, Hungary, IEEE Computer Society Press, September 2009, p. 177-186
http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/HP-qest09.pdf.
[22]
M. Kühnrich, S. Schwoon, J. Srba, S. Kiefer.
Interprocedural Dataflow Analysis over Weight Domains with Infinite Descending Chains, in: Proceedings of the 12th International Conference on Foundations of Software Science and Computational Structures (FOSSACS), York, UK, L. de Alfaro (editor), Lecture Notes in Computer Science, Springer, March 2009, vol. 5504, p. 440–455
http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/KSSK-fossacs09.pdf.
[23]
H. M. Zargayouna, F. Balbo, S. Haddad.
Agents Secure Interaction in Data Driven Languages, in: Preliminary Proceedings of the 2nd Workshop on LAnguages, methodologies and Development tools for multi-agent systemS (LADS'09), Torino, Italy, M. Dastani, A. El Fallah Seghrouchni, J. Leite, P. Torroni (editors), September 2009
http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/ZBH-lads09.pdf.

National Peer-Reviewed Conference/Proceedings

[24]
S. Haddad, L. Mokdad, S. Youcef.
Bornes du temps de réponse des services Web composites, in: Actes du 7ème Colloque sur la Modélisation des Systèmes Réactifs (MSR'09), Nantes, France, O. H. Roux (editor), Hermès, November 2009
http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/HMY-msr09.pdf, To appear.

Scientific Books (or Scientific Book chapters)

[25]
S. Demri, P. Gastin.
Specification and Verification using Temporal Logics, in: Modern applications of automata theory, D. D'Souza, P. Shankar (editors), IISc Research Monographs, World Scientific, 2009, vol. 2
http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/DG-iis09.pdf, To appear.
[26]
V. Diekert, P. Gastin.
Local safety and local liveness for distributed systems, in: Perspectives in Concurrency Theory, K. Lodaya, M. Mukund, R. Ramanujam (editors), IARCS-Universities, Universities Press, January 2009, p. 86-106
http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/DG-pct08.pdf.
[27]
M. Droste, P. Gastin.
Weighted automata and weighted logics, in: Handbook of Weighted Automata, W. Kuich, H. Vogler, M. Droste (editors), EATCS Monographs in Theoretical Computer Science, Springer, 2009, chap. 5, p. 175-211
http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/DG-hwa08.pdf.
[28]
P. Gastin, M. Mukund, K. Narayan Kumar.
Reachability and boundedness in time-constrained MSC graphs, in: Perspectives in Concurrency Theory, K. Lodaya, M. Mukund, R. Ramanujam (editors), IARCS-Universities, Universities Press, January 2009, p. 157-183
http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/GMN-pct08.pdf.

Internal Reports

[29]
B. Bérard, S. Haddad, M. Sassolas.
Verification on Interrupt Timed Automata, Laboratoire Spécification et Vérification, ENS Cachan, France, July 2009, no LSV-09-16
http://www.lsv.ens-cachan.fr/Publis/RAPPORTS_LSV/PDF/rr-lsv-2009-16.pdf, 16 pages.
[30]
A. Gaiser, S. Schwoon.
Comparison of Algorithms for Checking Emptiness on Büchi Automata, Computing Research Repository, 2009, no 0910.3766, Technical report.
[31]
M. Kühnrich, S. Schwoon, J. Srba, S. Kiefer.
Interprocedural Dataflow Analysis over Weight Domains with Infinite Descending Chains, Computing Research Repository, 2009, no 0901.0501, Technical report.

References in notes

[32]
W. Kuich, H. Vogler, M. Droste (editors)
Handbook of Weighted Automata, EATCS Monographs in Theoretical Computer Science, Springer, 2009.
[33]
S. Abbes, A. Benveniste, S. Haar.
A Petri net model for distributed estimation, in: Proc. MTNS 2004, Sixteenth International Symposium on Mathematical Theory of Networks and Systems, Louvain (Belgium), ISBN 90-5682-517-8, 2004.
[34]
S. Akshay, B. Bollig, P. Gastin, M. Mukund, K. Narayan Kumar.
Distributed Timed Automata with Independently Evolving Clocks, in: Proceedings of the 19th International Conference on Concurrency Theory (CONCUR'08), Toronto, Canada, F. van Breugel, M. Chechik (editors), Lecture Notes in Computer Science, Springer, August 2008, vol. 5201, p. 82-97
http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/ABGMN-concur08.pdf.
[35]
R. Alur, K. Etessami, M. Yannakakis.
Realizability and Verification of MSC Graphs, in: Theor. Comput. Sci., 2005, vol. 331, no 1, p. 97–114.
[36]
P. Baldan, Th. Chatain, S. Haar, B. Koenig.
Unfolding-based Diagnosis of Systems with an Evolving Topology, in: Proceedings of the 19th International Conference on Concurrency Theory (CONCUR'08), Toronto, Canada, F. van Breugel, M. Chechik (editors), Lecture Notes in Computer Science, Springer, August 2008, vol. 5201, p. 203-217
http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BCHK-concur08.pdf, Extended version accepted for publication in: Information and Computation.
[37]
P. Baldan, S. Haar, B. Koenig..
Distributed Unfolding of Petri Nets, in: Proc.FOSSACS 2006, LNCS, Springer, 2006, vol. 3921, p. 126-141, Extended version: Technical Report CS-2006-1. Department of Computer Science, University Ca' Foscari of Venice..
[38]
A. Benveniste, E. Fabre, S. Haar..
Markov Nets: Probabilistic Models for distributed and concurrent Systems, in: IEEE Transactions on Automatic Control, 2003, vol. 48 (11), p. 1936-1950, Extended version: IRISA Research Report 1538..
[39]
B. Bérard, F. Cassez, S. Haddad, D. Lime, O. H. Roux.
Comparison of Different Semantics for Time Petri Nets, in: Proceedings of the 3rd International Symposium on Automated Technology for Verification and Analysis (ATVA'05), Taipei, Taiwan, ROC, D. A. Peled, Y.-K. Tsay (editors), Lecture Notes in Computer Science, Springer, October 2005, vol. 3707, p. 293-307
http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BCHLR05-atva.pdf.
[40]
B. Bérard, F. Cassez, S. Haddad, D. Lime, O. H. Roux.
Comparison of the Expressiveness of Timed Automata and Time Petri Nets, in: Proceedings of the 3rd International Conference on Formal Modelling and Analysis of Timed Systems (FORMATS'05), Uppsala, Sweden, P. Pettersson, W. Yi (editors), Lecture Notes in Computer Science, Springer, November 2005, vol. 3829, p. 211-225
http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BCHLR-formats2005.pdf.
[41]
B. Bérard, F. Cassez, S. Haddad, D. Lime, O. H. Roux.
When are Timed Automata Weakly Timed Bisimilar to Time Petri Nets?, in: Proceedings of the 25th Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS'05), Hyderabad, India, R. Ramanujam, S. Sen (editors), Lecture Notes in Computer Science, Springer, December 2005, vol. 3821, p. 273-284
http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BCHLR-fsttcs05.pdf.
[42]
P. Bhateja, P. Gastin, M. Mukund, K. Narayan Kumar.
Local testing of message sequence charts is difficult, in: Proceedings of the 16th International Symposium on Fundamentals of Computation Theory (FCT'07), Budapest, Hungary, E. Csuhaj-Varjú, Z. Ésik (editors), Lecture Notes in Computer Science, Springer, August 2007, vol. 4639, p. 76-87
http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BGMN-fct07.pdf.
[43]
R. Bishop.
Intelligent Vehicle R&D: a review and contrast of programs worldwide and emerging trends., in: Annals of Telecommunications - Intelligent Transportation Systems, J. Ehrlich (editor), GET-Lavoisier, March-April 2005, vol. 60, no 3-4, p. 228–263.
[44]
J.-M. Blosseville.
Driving assistance systems and road safety: State-of-the-art and outlook, in: Annals of Telecommunications - Intelligent Transportation Systems, J. Ehrlich (editor), GET-Lavoisier, March-April 2005, vol. 60, no 3-4, p. 281–298.
[45]
P. Bly.
e-Safety - Co-operative Systems for Road Transport (IST Work Progamme 2005-2006), European Commission, 2004, Technical report.
[46]
G. V. Bochmann, S. Haar, C. Jard, G.-V. Jourdan.
Testing Systems Specified as Partial Order Input/Output Automata., in: Proc. TESTCOM/Fates 08, 20th IFIP International Conference on Testing of Communicating Systems and 8th International Workshop on Formal Approaches to Testing of Software, LNCS, Springer, 2008, vol. 5047, p. 169-183.
[47]
P. Bouyer, S. Haddad, P.-A. Reynier.
Extended Timed Automata and Time Petri Nets, in: Proceedings of the 6th International Conference on Application of Concurrency to System Design (ACSD'06), Turku, Finland, K. Goossens, L. Petrucci (editors), IEEE Computer Society Press, June 2006, p. 91-100
http://www.lsv.ens-cachan.fr/Publis/RAPPORTS_LSV/PDF/rr-lsv-2006-01.pdf.
[48]
P. Bouyer, S. Haddad, P.-A. Reynier.
Timed Petri Nets and Timed Automata: On the Discriminating Power of Zeno Sequences, in: Proceedings of the 33rd International Colloquium on Automata, Languages and Programming (ICALP'06) — Part II, Venice, Italy, M. Buglesi, B. Preneel, V. Sassone, I. Wegener (editors), Lecture Notes in Computer Science, Springer, July 2006, vol. 4052, p. 420-431
http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BHR-icalp06.pdf.
[49]
P. Bouyer, S. Haddad, P.-A. Reynier.
Timed Unfoldings for Networks of Timed Automata, in: Proceedings of the 4th International Symposium on Automated Technology for Verification and Analysis (ATVA'06), Beijing, ROC, S. Graf, W. Zhang (editors), Lecture Notes in Computer Science, Springer, October 2006, vol. 4218, p. 292-306
http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BHR-atva06.pdf.
[50]
M. Boyer, M. Diaz.
Non equivalence between time Petri nets and time stream Petri nets, in: PNPM, IEEE Computer Society, 1999, p. 198-207.
[51]
M. Boyer, O. H. Roux.
Comparison of the Expressiveness of Arc, Place and Transition Time Petri Nets, in: ICATPN, J. Kleijn, A. Yakovlev (editors), Lecture Notes in Computer Science, Springer, 2007, vol. 4546, p. 63-82.
[52]
A. Church.
Logic, arithmetics, and automata, in: Proc. of Int. Congr. of Mathematicians, 1962, p. 23–35.
[53]
R. Debouk, D. Teneketzis.
Coordinated decentralized protocols for failure diagnosis of discrete-event systems, in: Journal of Discrete Event Dynamical Systems: Theory and Application, 2000, vol. 10, p. 33–86.
[54]
E. Fabre, A. Benveniste, C. Jard, S. Haar.
Diagnosis of Asynchronous Discrete Event Systems, a Net Unfolding Approach., in: IEEE Trans. Aut. Control, 2003, vol. 48 (5), p. 714-727.
[55]
E. Fabre, A. Benveniste, C. Jard, S. Haar.
Distributed monitoring of concurrent and asynchronous systems., in: Discrete Event Dynamic Systems: theory and application, 2005, vol. 15 (1), p. 33-84, Preliminary version: Proc. CONCUR 2003, LNCS 2761, pp.1–28, Springer..
[56]
B. Finkbeiner, S. Schewe.
Uniform distributed synthesis, in: Proc. of the 20th IEEE Annual Symposium on Logic in Computer Science (LICS'05), IEEE Computer Society Press, 2005, p. 321–330.
[57]
P. Gastin, B. Lerman, M. Zeitoun.
Distributed games with causal memory are decidable for series-parallel systems, in: Proceedings of the 24th Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS'04), Chennai, India, K. Lodaya, M. Mahajan (editors), Lecture Notes in Computer Science, Springer, December 2004, vol. 3328, p. 275-286
http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/GLZ-fsttcs04.pdf.
[58]
P. Gastin, N. Sznajder, M. Zeitoun.
Distributed synthesis for well-connected architectures, in: Proceedings of the 26th Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS'06), Kolkata, India, N. Garg, S. Arun-Kumar (editors), Lecture Notes in Computer Science, Springer, December 2006, vol. 4337, p. 321-332
http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/GSZ-fsttcs2006.pdf.
[59]
S. Haar, A. Benveniste, E. Fabre, C. Jard.
Partial Order Diagnosability Of Discrete Event Systems Using Petri Net Unfoldings., in: 42nd IEEE Conference on Decision and Control (CDC), 2003.
[60]
S. Haar.
Probabilistic Cluster Unfoldings, in: Fundamenta Informaticae, 2003, vol. 53 (3-4), p. 281-314.
[61]
S. Haar, C. Jard, G.-V. Jourdan.
Testing Input/Output Partial Order Automata., in: Proc. TESTCOM/FATES, LNCS, SpringerLNCS 4581, pp. 171–185., 2007, vol. 4581, p. 171-185.
[62]
S. Haddad, P. Poizat.
Transactional Reduction of Component Compositions, in: Proceedings of 27th IFIP WG6.1 International Conference on Formal Techniques for Networked and Distributed Systems (FORTE'07), Tallinn, Estonia, J. Derrick, J. Vain (editors), Lecture Notes in Computer Science, Springer, June 2007, vol. 4574, p. 341-357
http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/HP-forte07.pdf.
[63]
R. Horowitz, P. Varaiya.
Control Design of an Automated Highway System, in: Proc. of the IEEE 88(7), 2000.
[64]
Intelligent Vehicle Initiative.
Saving Lives through advanced vehicle safety technology, September 2005.
[65]
D. König, N. Lohmann, S. Moser, C. Stahl, K. Wolf.
Extending the compatibility notion for abstract WS-BPEL processes, in: WWW, ACM, 2008, p. 785-794.
[66]
O. Kupferman, M. Y. Vardi.
Synthesizing Distributed Systems, in: Proc. of the 16th IEEE Annual Symposium on Logic in Computer Science (LICS'01), IEEE Computer Society Press, 2001.
[67]
S. Lafortune, Y. Wang, T.-S. Yoo.
Diagnostic Decentralisé Des Systèmes A Evénements Discrets, in: Journal Europeen des Systèmes Automatisés (RS-JESA), August 2005, vol. 99, no 99, p. 95–110.
[68]
K. G. Larsen, P. Pettersson, W. Yi.
Compositional and symbolic model-checking of real-time systems, in: Proc. of RTSS 1995, IEEE Computer Society, 1995, p. 76-89.
[69]
S. Mohalik, I. Walukiewicz.
Distributed Games, in: Proc. of the 23rd Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS'03), LNCS, Springer, 2003, vol. 2914, p. 338–351.
[70]
A. Pnueli, R. Rosner.
Distributed reactive systems are hard to synthesize, in: Proc. of the 31st Annual IEEE Symposium on Foundations of Computer Science (FOCS'90), IEEE Computer Society Press, 1990, vol. II, p. 746–757.
[71]
W. Reisig.
Towards a Theory of Services, in: UNISCON, Lecture Notes in Business Information Processing, Springer, 2008, vol. 5, p. 271-281.
[72]
L. Ricker, K. Rudie.
Know Means No: Incorporating Knowledge into Discrete-Event Control Systems, in: IEEE Transactions on Automatic Control, September 2000, vol. 45, no 9, p. 1656–1668.
[73]
L. Ricker, K. Rudie.
Knowledge Is a Terrible Thing to Waste: Using Inference in Discrete-Event Control Problems, in: IEEE Transactions on Automatic Control, MarchSeptember 2007, vol. 52, no 3, p. 428–441.
[74]
Y. Robin-Jouan, J. Ehrlich, B. Guillaumin, M. Delarche, M. Dutech.
Transport-specific communication services: Safety-based or critical applications for mobiles and cooperation with infrastructure networks, in: Annals of Telecommunications - Intelligent Transportation Systems, J. Ehrlich (editor), GET-Lavoisier, March-April 2005, vol. 60, no 3–4, p. 405–440.
[75]
J. Srba.
Timed-Arc Petri Nets vs. Networks of Timed Automata, in: ICATPN, Lecture Notes in Computer Science, Springer, 2005, vol. 3536, p. 385-402.
[76]
S. Staab, W. van der Aalst, V. Benjamins, A. Sheth, J. Miller, C. Bussler, A. Maedche, D. Fensel, D. Gannon.
Web Services: Been There, Done That?, in: IEEE Intelligent Systems, 2003, vol. 18, p. 72-85.
[77]
M. B. van Riemsdijk, R. Hennicker, M. Wirsing, A. Schroeder.
Service Specification and Matchmaking Using Description Logic, in: AMAST, Lecture Notes in Computer Science, Springer, 2008, vol. 5140, p. 392-406.

previous
next