First-order and temporal logics for nested words, Logical Methods in Computer Science, vol.4, issue.11, pp.1-44, 2008. ,
Event-clock message passing automata: A logical characterization and an emptiness checking algorithm . Formal Methods in System Design, pp.262-300, 2013. ,
URL : https://hal.archives-ouvertes.fr/hal-00925745
Distributed Timed Automata with Independently Evolving Clocks, Fundamenta Informaticae, vol.130, issue.4, pp.377-407, 2014. ,
DOI : 10.1007/978-3-540-85361-9_10
URL : https://hal.archives-ouvertes.fr/hal-01089524
Emptiness of multipushdown automata is 2ETIME-complete, DLT'08, pp.121-133, 2008. ,
Linear-time model-checking for multithreaded programs under scopebounding, ATVA'12, pp.152-166 ,
Context-bounded analysis for concurrent programs with dynamic creation of threads, Logical Methods in Computer Science, vol.7, issue.4, 2011. ,
Languages of Nested Trees, CAV'06, pp.329-342, 2006. ,
DOI : 10.1007/11817963_31
A theory of timed automata, Theoretical Computer Science, vol.126, issue.2, pp.183-235, 1994. ,
DOI : 10.1016/0304-3975(94)90010-8
Implementing realistic asynchronous automata, FSTTCS'13, volume 24 of Leibniz International Proceedings in Informatics Schloss Dagstuhl -Leibniz-Zentrum fuer Informatik, pp.213-224, 2013. ,
URL : https://hal.archives-ouvertes.fr/hal-00920776
A Temporal Logic of Nested Calls and Returns, TACAS'04, pp.467-481, 2004. ,
DOI : 10.1007/978-3-540-24730-2_35
Realizability and verification of MSC graphs, Theoretical Computer Science, vol.331, issue.1, pp.97-114, 2005. ,
DOI : 10.1016/j.tcs.2004.09.034
Reasoning about distributed systems: WYSIWYG, FSTTCS'14, volume 29 of Leibniz International Proceedings in Informatics Leibniz-Zentrum für Informatik, pp.11-30, 2014. ,
URL : https://hal.archives-ouvertes.fr/hal-01091168
Controllers for the verification of communicating multi-pushdown systems, CON- CUR'14, pp.297-311, 2014. ,
Verifying communicating multi-pushdown systems via split-width, ATVA'14, pp.1-17, 2014. ,
All for the Price of Few, VMCAI'13, pp.476-495, 2013. ,
DOI : 10.1007/978-3-642-35873-9_28
Verifying programs with unreliable channels, LICS'03, pp.160-170, 1993. ,
Parameterized Model Checking of Token-Passing Systems, VMCAI'14, pp.262-281, 2014. ,
DOI : 10.1007/978-3-642-54013-4_15
Parameterized Model Checking of Rendezvous Systems, CONCUR'14, pp.109-124, 2014. ,
DOI : 10.1007/978-3-662-44584-6_9
Adding nesting structure to words, Journal of the ACM, vol.56, issue.3, pp.1-43, 2009. ,
DOI : 10.1145/1516512.1516518
Adding nesting structure to words, Journal of the ACM, vol.56, issue.3, pp.1-43, 2009. ,
DOI : 10.1145/1516512.1516518
Programming Erlang: Software for a Concurrent World, 2007. ,
Global Model Checking of Ordered Multi-Pushdown Systems, FSTTCS'10 of Leibniz International Proceedings in Informatics Leibniz-Zentrum für Informatik, pp.216-227, 2010. ,
MULTI-PUSH-DOWN LANGUAGES AND GRAMMARS, International Journal of Foundations of Computer Science, vol.07, issue.03, pp.253-292, 1996. ,
DOI : 10.1142/S0129054196000191
Model Checking Languages of Data Words, FoSSaCS'12, pp.391-405, 2012. ,
DOI : 10.1007/978-3-642-28729-9_26
URL : https://hal.archives-ouvertes.fr/hal-00658333
Temporal logics for concurrent recursive programs: Satisfiability and model checking, Journal of Applied Logic, 2014. ,
URL : https://hal.archives-ouvertes.fr/hal-00591139
A concurrency-preserving translation from time petri nets to networks of timed automata. Formal Methods in System Design, pp.330-355, 2012. ,
URL : https://hal.archives-ouvertes.fr/hal-00776605
Dynamic communicating automata and branching high-level MSCs, LATA'13, pp.177-189, 2013. ,
Model-Checking Bounded Multi-Pushdown Systems, CSR'13, pp.405-417, 2013. ,
DOI : 10.1007/978-3-642-38536-0_35
Two-variable logic on data words, ACM Trans. Comput. Log, vol.12, issue.4, p.27, 2011. ,
A Generic Approach to the Static Analysis of Concurrent Programs with Procedures, International Journal of Foundations of Computer Science, vol.14, issue.04, pp.551-582, 2003. ,
DOI : 10.1142/S0129054103001893
URL : https://hal.archives-ouvertes.fr/hal-00161121
Realizability of Concurrent Recursive Programs, FoSSaCS'09, pp.410-424, 2009. ,
DOI : 10.1007/11817963_29
URL : https://hal.archives-ouvertes.fr/hal-00772771
Parameterized communicating automata: Complementation and model checking, FSTTCS'14, volume 29 of Leibniz International Proceedings in Informatics Leibniz-Zentrum für Informatik, pp.625-637, 2014. ,
URL : https://hal.archives-ouvertes.fr/hal-01030765
A Chart Semantics for the Pi-Calculus, Electronic Notes in Theoretical Computer Science, vol.194, issue.2, pp.3-29, 2008. ,
DOI : 10.1016/j.entcs.2007.11.002
Parameterized Verification of Communicating Automata under Context Bounds, LNCS, vol.14, issue.8762, pp.45-57, 2014. ,
DOI : 10.1007/978-3-319-11439-2_4
URL : https://hal.archives-ouvertes.fr/hal-00984421
A Robust Class of Data Languages and an Application to Learning, Logical Methods in Computer Science, vol.10, issue.4, 2014. ,
DOI : 10.2168/LMCS-10(4:19)2014
URL : https://hal.archives-ouvertes.fr/hal-00920945
Timed Unfoldings for Networks of Timed Automata, ATVA'06, pp.292-306, 2006. ,
DOI : 10.1007/11901914_23
Partial order reductions for timed systems, CONCUR'98, pp.485-500, 1998. ,
DOI : 10.1007/BFb0055643
Muller message-passing automata and logics. Information and Computation, pp.1084-1094, 2008. ,
An optimal construction of Hanf sentences, Journal of Applied Logic, vol.10, issue.2, pp.179-186, 2012. ,
DOI : 10.1016/j.jal.2012.01.002
URL : https://hal.archives-ouvertes.fr/hal-00776607
Propositional dynamic logic for message-passing systems, Logical Methods in Computer Science, vol.6, issue.3, p.16, 2010. ,
URL : https://hal.archives-ouvertes.fr/hal-00779914
The complexity of model checking multi-stack systems, LICS'13, pp.163-170, 2013. ,
URL : https://hal.archives-ouvertes.fr/hal-00926182
Message-passing automata are expressively equivalent to EMSO logic, Theoretical Computer Science, vol.358, issue.2-3, pp.150-172, 2006. ,
DOI : 10.1016/j.tcs.2006.01.014
An extension of data automata that captures XPath, LICS'10, pp.243-252, 2010. ,
DOI : 10.2168/LMCS-8(1:5)2012
Twovariable logic on data trees and applications to XML reasoning, Journal of the ACM, vol.56, issue.3, 2009. ,
Nominal monoids. Theory of Computing Systems, pp.194-222, 2013. ,
On the expressive power of 2-stack visibly pushdown automata, Logical Methods in Computer Science, vol.4, issue.4, p.16, 2008. ,
An automaton over data words that captures EMSO logic, CONCUR'11, pp.171-186, 2011. ,
Logic for communicating automata with parameterized topology, Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), CSL-LICS '14, 2014. ,
DOI : 10.1145/2603088.2603093
URL : https://hal.archives-ouvertes.fr/hal-00872807
An algebraic approach to data languages and timed languages, Information and Computation, vol.182, issue.2, pp.137-162, 2003. ,
DOI : 10.1016/S0890-5401(03)00038-5
On notions of regularity for data languages, Theoretical Computer Science, vol.411, issue.4-5, pp.702-715, 2010. ,
DOI : 10.1016/j.tcs.2009.10.009
Visibly rational expressions, FSTTCS'12 of Leibniz International Proceedings in Informatics Leibniz-Zentrum für Informatik, pp.211-223, 2012. ,
DOI : 10.1007/s00236-013-0190-6
Visibly linear temporal logic, IJ- CAR'14, pp.418-433, 2014. ,
Weak second order logic and finite automata, Z. Math. Logik, Grundlag. Math, vol.5, pp.66-62, 1960. ,
On Communicating Finite-State Machines, Journal of the ACM, vol.30, issue.2, 1983. ,
DOI : 10.1145/322374.322380
Symbolic Unfoldings for Networks of Timed Automata, ATVA'06, pp.307-321, 2006. ,
DOI : 10.1007/11901914_24
URL : https://hal.archives-ouvertes.fr/inria-00363033
Constructing a Map of an Anonymous Graph: Applications of Universal Sequences, OPODIS'10, pp.119-134, 2010. ,
DOI : 10.1007/3-540-61440-0_163
URL : https://hal.archives-ouvertes.fr/hal-00726071
Design and synthesis of synchronization skeletons using branching time temporal logic, Proceedings of the Workshop on Logics of Programs, pp.52-71, 1981. ,
MSO Decidability of Multi-Pushdown Systems via Split-Width, CONCUR'12, pp.547-561, 2012. ,
DOI : 10.1007/978-3-642-32940-1_38
URL : https://hal.archives-ouvertes.fr/hal-00776596
A succinct canonical register automaton model, ATVA'11, pp.366-380, 2011. ,
URL : https://hal.archives-ouvertes.fr/hal-00647724
On the Use of Guards for Logics with Data, MFCS'11, pp.243-255, 2011. ,
DOI : 10.1007/978-3-642-22993-0_24
URL : https://hal.archives-ouvertes.fr/hal-00638611
Temporal logics for concurrent recursive programs, Master Parisien de Recherche en Informatique, 2010. ,
Verification of Communicating Recursive Programs via Split-width, 2014. ,
URL : https://hal.archives-ouvertes.fr/tel-01015561
Robustness and Implementability of Timed Automata, FORMATS and FTRTFT, pp.118-133, 2004. ,
DOI : 10.1007/978-3-540-30206-3_10
LTL Is Expressively Complete for Mazurkiewicz Traces, Journal of Computer and System Sciences, vol.64, issue.2, pp.396-418, 2002. ,
DOI : 10.1006/jcss.2001.1817
Pure future local temporal logics are expressively complete for Mazurkiewicz traces, Information and Computation, vol.204, issue.11, pp.1597-1619, 2006. ,
DOI : 10.1016/j.ic.2006.07.002
URL : https://hal.archives-ouvertes.fr/hal-00130678
Rational and Recognizable Complex Trace Languages, Information and Computation, vol.116, issue.1, pp.134-153, 1995. ,
DOI : 10.1006/inco.1995.1010
Distributed Time-Asynchronous Automata, ICTAC'07, pp.185-200, 2007. ,
DOI : 10.1007/978-3-540-75292-9_13
LTL with the freeze quantifier and register automata, ACM Transactions on Computational Logic, vol.10, issue.3, 2009. ,
Deterministic asynchronous automata for infinite traces, Acta Informatica, vol.21, issue.4, pp.379-397, 1994. ,
DOI : 10.1007/BF01178512
The Book of Traces, World Scientific, 1995. ,
DOI : 10.1142/2563
Parameterized Verification of Broadcast Networks of Register Automata, RP'13, pp.109-121, 2013. ,
DOI : 10.1007/978-3-642-41036-9_11
Parameterized Verification of Ad Hoc Networks, CONCUR'10, 2010. ,
DOI : 10.1007/978-3-642-15375-4_22
On the Power of Cliques in the Parameterized Verification of Ad Hoc Networks, FoSSaCS'11, pp.441-455, 2011. ,
DOI : 10.1007/978-3-642-19805-2_30
Parameterized verification of asynchronous shared-memory systems, CAV'13, pp.124-140, 2013. ,
Parameterized model checking of ringbased message passing systems, CSL'04, pp.325-339, 2004. ,
Decision problems of finite automata design and related arithmetics. Transactions of the, pp.21-52, 1961. ,
On Reasoning About Rings, International Journal of Foundations of Computer Science, vol.14, issue.04, pp.527-550, 2003. ,
DOI : 10.1142/S0129054103001881
Keeping a crowd safe: On the complexity of parameterized verification, STACS'14, volume 25 of Leibniz International Proceedings in Informatics Leibniz-Zentrum für Informatik, pp.1-10, 2014. ,
Reasoning on Words and Trees with Data, 2010. ,
URL : https://hal.archives-ouvertes.fr/tel-00718605
An algebraic characterization of deterministic regular languages over infinite alphabets, Theoretical Computer Science, vol.306, issue.1-3, pp.155-175, 2003. ,
DOI : 10.1016/S0304-3975(03)00246-9
On implementation of global concurrent systems with local asynchronous controllers, CONCUR'05, pp.443-457, 2005. ,
Optimal Zielonka-Type Construction of Deterministic Asynchronous Automata, ICALP'10, pp.52-63, 2010. ,
DOI : 10.1007/978-3-642-14162-1_5
URL : https://hal.archives-ouvertes.fr/hal-00672834
Asynchronous Games over Tree Architectures, ICALP'13, pp.275-286, 2013. ,
DOI : 10.1007/978-3-642-39212-2_26
URL : https://hal.archives-ouvertes.fr/hal-00916615
Uniform satisfiability in PSPACE for local temporal logics over Mazurkiewicz traces, Fundamenta Informaticae, vol.80, issue.1-3, pp.169-197, 2007. ,
Uniform satisfiability problem for local temporal logics over Mazurkiewicz traces, Information and Computation, vol.208, issue.7, pp.797-816, 2010. ,
DOI : 10.1016/j.ic.2009.12.003
URL : https://hal.archives-ouvertes.fr/hal-00779916
A Kleene theorem and model checking algorithms for existentially bounded communicating automata, Information and Computation, vol.204, issue.6, pp.920-956, 2006. ,
DOI : 10.1016/j.ic.2006.01.005
URL : https://hal.archives-ouvertes.fr/hal-00306261
On communicating automata with bounded channels, Fundamenta Informaticae, vol.80, issue.1-3, pp.147-167, 2007. ,
URL : https://hal.archives-ouvertes.fr/hal-00306256
Network invariants for real-time systems, Formal Aspects of Computing, vol.2, issue.4, pp.619-635, 2008. ,
DOI : 10.1007/s00165-008-0089-0
Constructing Exponential-Size Deterministic Zielonka Automata, ICALP'06, pp.565-576, 2006. ,
DOI : 10.1007/11787006_48
URL : https://hal.archives-ouvertes.fr/hal-00306257
Compositional message sequence charts, International Journal on Software Tools for Technology Transfer, vol.21, issue.1, pp.78-89, 2003. ,
DOI : 10.1007/s10009-002-0085-2
Infinite-state high-level MSCs: Model-checking and realizability, Journal of Computer and System Sciences, vol.72, issue.4, pp.617-647, 2006. ,
DOI : 10.1016/j.jcss.2005.09.007
URL : https://hal.archives-ouvertes.fr/hal-00306255
Fair Synthesis for Asynchronous Distributed Systems, ACM Transactions on Computational Logic, vol.14, issue.2, p.2013 ,
DOI : 10.1145/2480759.2480761
URL : https://hal.archives-ouvertes.fr/hal-00925735
Logical Locality Entails Frugal Distributed Computation over Graphs (Extended Abstract), WG'09, pp.154-165, 2010. ,
DOI : 10.1007/978-3-642-11409-0_14
Model-theoretic methods in the study of elementary logic The Theory of Models, 1965. ,
Mona: Monadic second-order logic in practice, TACAS'95, pp.89-110 ,
Reachability analysis of communicating pushdown systems, Logical Methods in Computer Science, vol.8, issue.323, pp.1-20, 2012. ,
A theory of regular MSC languages, Information and Computation, vol.202, issue.1, pp.1-38, 2005. ,
The model checker SPIN, IEEE Transactions on Software Engineering, vol.23, issue.5, 2003. ,
DOI : 10.1109/32.588521
Parameterized synthesis, Logical Methods in Computer Science, vol.10, issue.1, p.2014 ,
Tense Logic and the Theory of Linear Order, 1968. ,
Finite-memory automata, Theoretical Computer Science, vol.134, issue.2, pp.329-363, 1994. ,
DOI : 10.1016/0304-3975(94)90242-9
Feasible automata for twovariable logic with successor on data words, LATA'12, pp.351-362, 2012. ,
Regular sets of infinite message sequence charts, Information and Computation, vol.187, pp.80-109, 2003. ,
FINITE-MEMORY AUTOMATA WITH NON-DETERMINISTIC REASSIGNMENT, International Journal of Foundations of Computer Science, vol.21, issue.05, pp.741-760, 2010. ,
DOI : 10.1142/S0129054110007532
Elements of Finite Model Theory, 2004. ,
Bounded MSC communication, Information and Computation, vol.189, issue.2, pp.160-181, 2004. ,
DOI : 10.1016/j.ic.2003.10.002
URL : https://hal.archives-ouvertes.fr/hal-00306245
Dynamic Message Sequence Charts, FSTTCS 2002, pp.253-264, 2002. ,
DOI : 10.1007/3-540-36206-1_23
A Robust Class of Context-Sensitive Languages, 22nd Annual IEEE Symposium on Logic in Computer Science (LICS 2007), pp.161-170, 2007. ,
DOI : 10.1109/LICS.2007.9
Context-bounded analysis of concurrent queue systems, Proceedings of TACAS'08, pp.299-314, 2008. ,
An infinite automaton characterization of double exponential time, CSL'08, pp.33-48, 2008. ,
The language theory of bounded context-switching, LATIN'08, pp.96-107, 2010. ,
Model-checking parameterized concurrent programs using linear interfaces, CAV'10, pp.629-644, 2010. ,
Reachability of Multistack Pushdown Systems with Scope-Bounded Matching Relations, CONCUR'11, pp.203-218, 2011. ,
DOI : 10.1007/978-3-540-85114-1_19
Scope-bounded pushdown languages, DLT'14, pp.116-128 ,
A unifying approach for multistack pushdown automata, MFCS'14, pp.377-389, 2014. ,
A partial order semantics approach to the clock explosion problem of timed automata, Theoretical Computer Science, vol.345, issue.1, pp.27-59, 2005. ,
DOI : 10.1016/j.tcs.2005.07.023
Scope-bounded Multistack Pushdown Systems: Fixed-Point, Sequentialization, and Tree-Width, FSTTCS'12 of Leibniz International Proceedings in Informatics Leibniz-Zentrum für Informatik, pp.173-184, 2012. ,
Compositional and symbolic model-checking of real-time systems, RTSS'95, pp.76-89, 1995. ,
Logics for context-free languages, CSL'94, pp.205-216, 1995. ,
DOI : 10.1007/BFb0022257
Interprocedural Analysis of Concurrent Programs Under a Context Bound, TACAS'08, pp.282-298, 2008. ,
DOI : 10.1007/978-3-540-78800-3_20
A Temporal Logic for Multi-threaded Programs, IFIP-TCS'12, pp.225-239 ,
DOI : 10.1007/978-3-642-33475-7_16
Series???parallel languages and the bounded-width property, Theoretical Computer Science, vol.237, issue.1-2, pp.347-380, 2000. ,
DOI : 10.1016/S0304-3975(00)00031-1
Rationality in Algebras with a Series Operation, Information and Computation, vol.171, issue.2, pp.269-293, 2001. ,
DOI : 10.1006/inco.2001.3077
Reasoning about sequential and branching behaviours of message sequence graphs, ICALP'01, pp.809-820, 2001. ,
Model-checking trace event structures, LICS'03, pp.371-380, 2003. ,
Model Checking Concurrent Recursive Programs Using Temporal Logics, MFCS'14, pp.438-450 ,
DOI : 10.1007/978-3-662-44522-8_37
On boundedness in depth in the ?-calculus, IFIP TCS'08, pp.477-489, 2008. ,
Beyond Message Sequence Graphs, FSTTCS 2001, pp.256-267, 2001. ,
DOI : 10.1007/3-540-45294-X_22
Walking on data words, CSR'13, pp.64-75, 2013. ,
URL : https://hal.archives-ouvertes.fr/hal-00877065
The tree width of auxiliary storage, POPL'11, pp.283-294, 2011. ,
The Monadic Quantifier Alternation Hierarchy over Grids and Graphs, Information and Computation, vol.179, issue.2, pp.356-383, 2002. ,
DOI : 10.1006/inco.2002.2955
The MSO Theory of Connectedly Communicating Processes, FSTTCS'05, pp.201-212, 2005. ,
DOI : 10.1007/11590156_16
Über die Erkennbarkeit unendlicher Spuren, 1994. ,
Distributed Synthesis for Acyclic Architectures, FSTTCS'14 of Leibniz International Proceedings in Informatics Leibniz-Zentrum für Informatik, pp.639-651, 2014. ,
URL : https://hal.archives-ouvertes.fr/hal-00946554
Finite state machines for strings over infinite alphabets, ACM Transactions on Computational Logic, vol.5, issue.3, pp.403-435, 2004. ,
DOI : 10.1145/1013560.1013562
Recognizable Trace Languages, Diekert and Rozenberg [DR95], chapter 6, pp.167-204 ,
DOI : 10.1142/9789814261456_0006
Model-checking for a subclass of event structures, TACAS'97, pp.145-164, 1997. ,
Multiple-person alternation, 20th Annual Symposium on Foundations of Computer Science (sfcs 1979), pp.348-363, 1979. ,
DOI : 10.1109/SFCS.1979.25
Lower bounds for multiplayer noncooperative games of incomplete information, Computers & Mathematics with Applications, vol.41, issue.7-8, pp.957-992, 2001. ,
DOI : 10.1016/S0898-1221(00)00333-3
Dynamical properties of timed automata. Discrete Event Dynamic Systems, pp.87-113, 2000. ,
An algorithmic approach for checking closure properties of temporal logic specifications and ??-regular languages, Theoretical Computer Science, vol.195, issue.2, pp.183-203, 1998. ,
DOI : 10.1016/S0304-3975(97)00219-3
Context-Bounded Model Checking of Concurrent Software, TACAS'05, pp.93-107 ,
DOI : 10.1007/978-3-540-31980-1_7
Specification and verification of concurrent systems in CESAR, International Symposium on Programming, pp.337-351, 1982. ,
DOI : 10.1007/3-540-11494-7_22
Context-sensitive synchronization-sensitive analysis is undecidable, ACM Transactions on Programming Languages and Systems, vol.22, issue.2, pp.416-430, 2000. ,
Local normal forms for first-order logic with applications to games and automata, Discrete Mathematics & Theoretical Computer Science, vol.3, issue.3, pp.109-124, 1999. ,
DOI : 10.1007/BFb0028580
URL : https://hal.archives-ouvertes.fr/hal-00958930
Automata and logics for words and trees over an infinite alphabet, CSL'06, pp.41-57, 2006. ,
Synthesis of distributed algorithms using asynchronous automata, CONCUR'03, pp.27-41, 2003. ,
SEMI-AUTOMATIC DISTRIBUTED SYNTHESIS, International Journal of Foundations of Computer Science, vol.18, issue.01, pp.113-138, 2007. ,
DOI : 10.1142/S0129054107004590
The Surprising Robustness of (Closed) Timed Automata against Clock-Drift, IFIP- TCS'08, pp.537-553, 2008. ,
DOI : 10.1007/978-0-387-09680-3_36
On logical definability of trace languages, Proceedings of Algebraic and Syntactic Methods in Computer Science (ASMICS), pp.172-182, 1990. ,
Elements of an automata theory over partial orders, POMIV'96, 1996. ,
Languages, automata and logic, Handbook of Formal Languages, pp.389-455, 1997. ,
Finite automata and monadic second order logic. Siberian Math In Russian; English translation in Amer, J Math. Soc. Transl, vol.3, issue.59, pp.103-131, 1962. ,
An expressively complete linear time temporal logic for Mazurkiewicz traces, LICS'97, pp.183-194, 1997. ,
Fresh-register automata, POPL'11, pp.295-306, 2011. ,
Models for concurrency, In Handbook of Logic in Computer Science, vol.4, pp.1-148, 1995. ,
Notes on finite asynchronous automata, RAIRO - Theoretical Informatics and Applications, vol.21, issue.2, pp.99-135, 1987. ,
DOI : 10.1051/ita/1987210200991