P. A. Abdulla, K. Cerans, and B. Jonsson, 4. q; " ssi " ou q;çç " 5. ++q; 0 " ssi ++q, Yih-Kuen T... í General decidability theorems for inaenite-state systems
URL : https://hal.archives-ouvertes.fr/hal-01416966

N. Ëag85ë-aleksandrov, V. Gorsky, and N. , Logic in Computer Science, Proc. 11th IEEE SympíImage Representation and Processing. í Nauka, p.93, 1985.

P. A. Abdulla and B. Jonsson, í Verifying programs with unreliable channels, Proc. 8th IEEE Symp. Logic in Computer Science
DOI : 10.1109/lics.1993.287591
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.48.9558

P. A. Abdulla and M. Kindahl, í Decidability of simulation and bisimulation between lossy channel systems and aenite state systems, Proc. CONCUR'95, LNCS 962, pp.333-347

H. Baker, .í Petri nets and languages. í CSJ, p.90, 1972.

J. C. Ëbbk87aë-baeten, J. A. Bergstra, and J. W. Klop, í Decidability of bisimulation equivalence for processes generating context-free languages, Proc. PARLE'87, pp.94-111

J. C. Ëbbk87bë-baeten, J. A. Bergstra, and J. W. Klop, í On the consistency of Koomen's fair abstraction rule, Theoretical Computer Science, vol.51, issue.1, 1987.

J. C. Bibliographie-Ëbbk87cë-baeten, J. A. Bergstra, and J. W. Klop, íT erm rewriting systems with priorities, Proc. Rewriting Techniques and Applications, pp.83-94

J. A. Bergstra and J. W. Klop, í Algebra of communicating processes In : CWI Monographs I, Proc. CWI Symp. Math. and Comp. Sci, pp.89-138, 1986.

J. A. Bergstra, J. W. Klop, F. R. Drake, and J. K. Truss, í A complete inference system for regular processes with silentmoves, Proc. Logic Colloquium '86, pp.21-81

J. A. Bergstra and J. W. Klop, Process theory based on bisimulation semantics, pp.50-122
DOI : 10.1007/BFb0013021
URL : http://dspace.library.uu.nl:8080/handle/1874/13709

J. C. Ëbw90ë-baeten, W. P. Weijland, L. Cardelli, J. Donahue, L. Glassman et al., íProcess Algebra. í Cambridge Univ. Press, 1990, Cambridge Tracts in Theoretical Computer Science, 1989.

K. Ëcer94ë-cerans, í Deciding properties of integral relational automata, Proc. 21st ICALP, pp.35-46

C. Ec-e, G. Finkel, A. Purushothaman-iyer, and S. , .í Unreliable channels are easier to verify than perfect channels, Information and Computation, vol.124, issue.1, pp.20-31, 1995.

S. Ëch93ë-christensen and H. , í Decidability issues for inaenite-state processes -a survey, EATCS Bull, vol.51, pp.156-166, 1993.

S. Ëchm94ë-christensen, Y. Hirshfeld, and F. Moller, í Decidable subsets of CCS. The Computer Journal,v ol, pp.233-242, 1994.

S. Ëchr93ë-christensen, S. Ëchs92ë-christensen, H. Hí-uttel, and C. Stirling, íDecidability and Decomposition in Process Algebras.íTh ese de PhD, Univ. Edinburgh, septembre 1993 í Bisimulation equivalence is decidable for all context-free processes, Proc. CONCUR'92, pp.138-147

J. B. Dennis, E. C. Horn, and . Vann, í Programming semantics for multiprogrammed computations, 143í155. ëDH87ë De Nicola R.. & Hennessy M...í CCS without ç 's. In : Proc. CAAP'87, pp.138-151, 1966.

J. Esparza, í More inaenite results, Proc. Int. Workshop Veriaecation of Inaenite State Systems 4í20. ëFF84ë Filman Robert E.. & Friedman Daniel P...í Coordinated Computing. Tools and Techniques for Distributed Software. í McGraw-Hill, 1984.

A. Finkel, í Reduction and covering of inaenite reachability trees. Information and Computation,v ol, pp.144-179, 1990.

R. J. Glabbeek and U. Goltz, í Equivalence notions for concurrent systems and reaenement of actions, Proc. Math. Found. Comp. Sci., Porabka-Kozubnik, LNCS 379, pp.237-248

R. J. Glabbeek and . Vann, The linear time ??? Branching time spectrum II, Proc. CONCUR'90, pp.278-297
DOI : 10.1007/3-540-57208-2_6

R. J. Glabbeek and . Vann, í What is branching time semantics and why to use it ?, EATCS Bull, vol.53, pp.191-198, 1994.

R. Gorrieri, M. Roccetti, and E. Stancampiano, A theory of processes with durational actions, Theoretical Computer Science, vol.140, issue.1, pp.73-94, 1995.
DOI : 10.1016/0304-3975(94)00205-W

M. Ëhac75ë-hack, í Petri net languages. í CSG, 1975.

M. Hennessy, íAlgebraic Theory of Processes, 1988.

T. A. Henziger, í Hybrid automata with aenite bisimulations, Proc. 22nd ICALP

G. Ëhig52ë-higman, í Ordering by divisibility in abstract algebras, Proc. London Math. Soc, 1952.

M. Hennessy and R. Milner, Algebraic laws for nondeterminism and concurrency, Journal of the ACM, vol.32, issue.1, pp.137-161, 1985.
DOI : 10.1145/2455.2460
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.409.1770

C. A. Hoare, Communicating sequential processes, Communications of the ACM, vol.21, issue.8, pp.666-677, 1978.
DOI : 10.1145/359576.359585

H. .. Ëhí-ut91ë-hí-uttel and . Ídecidability, Behavioural Equivalences and Inaenite Transition Graphs, Th ese de PhD, 1991.

P. Inverardi and C. Priami, í Evaluation of tools for the analysis of communicating systems, EATCS Bull.,v ol, vol.45, pp.158-187, 1991.

M. Ëjan86ë-jantzen, Language Theory of Petri Nets, LNCS, vol.254, pp.397-412
DOI : 10.1007/978-3-540-47919-2_15

B. Jonsson, J. Parrow, R. M. Keller, and R. M. Keller, Deciding Bisimulation Equivalences for a Class of Non-Finite-State Programs, Information and Computation, vol.107, issue.2, pp.272-302, 1973.
DOI : 10.1006/inco.1993.1069

R. M. Karp and R. E. Miller, Parallel program schemata, Journal of Computer and System Sciences, vol.3, issue.2, pp.147-195, 1969.
DOI : 10.1016/S0022-0000(69)80011-5

V. Kotov, í Program Scheme Theory, Nauka, p.89, 1991.

I. Kriz, í Well-quasiordering aenite trees with gap-condition

J. B. Kruskal, íWell-quasi-ordering, the Tree Theorem, and Vazsonyi's conjecture, Trans. Amer. Math. Soc.,v ol, vol.95, pp.210-225, 1960.

O. Kouchnarenko and . Schnoebelen-ph, í A model for recursive-parallel programs, Proc. Int. Workshop Veriaecation of Inaenite State Systems, pp.127-138

O. Kouchnarenko and . Schnoebelen-ph, í Mod eles formels pour les programmes r ecursifs-parall eles, Proc. RENPAR'8, pp.85-88

B. Liskov, M. Herlihy, and L. Gilbert, Limitations of synchronous communication with static process structure in languages for distributed computing, Proceedings of the 13th ACM SIGACT-SIGPLAN symposium on Principles of programming languages , POPL '86, pp.150-159
DOI : 10.1145/512644.512658

D. May, O. Sigplan-notices-Ëmil80ë-milner, and R. , íA Calculus of Communicating Systems í A modal characterisation of observable machine-behaviour, Proc. CAAP'81, pp.25-34, 1980.

R. Milner and R. Milner, Operational and Algebraic Semantics of Concurrent Processes, Handbook of Theoretical Computer Science, 1989.
DOI : 10.1016/B978-0-444-88074-1.50024-X

F. Ëmol96ë-moller, í Inaenite results, Proc. CONCUR'96

P. D. Mosses, Y. Mamatov, V. Vasilchikov, S. Volchenkov, V. Kurchidis et al., í Denotational semanticsí Petri nets, event structures and domains, Part I, Multiprocessor Computer System with Dynamic Parallelism. í Rapport technique n 7160, pp.575-631, 1981.

S. Panov, íProgramming Particularities for í Concurrency and automata on inaenite sequences, Proc. 5th GI Conf. on Th. Comp. Sci., LNCS 104, pp.167-183, 1989.

C. A. Petri, í Kommunikation mit Automaten, 1962.

J. Ëpet74ë-peterson, .í Modeling of Parallel Systems.í Rapport technique n STAN-CS-74-410, 1974.

G. D. Ëplo81ë-plotkin, í A structural approach to operational semantics . í Lect. Notes, 1981.

A. Pnueli, Linear and branching structures in the semantics and logics of reactive systems, Proc. 12th ICALP, Nafplion, LNCS 194, pp.15-32
DOI : 10.1007/BFb0015727

R. Podlovchenko, í Recursive programs and hierarchyof their models. Programming, no6, pp.44-52, 1991.

D. M. Ërt74ë-ritchie and K. Thompson, í The unix timesharing system, 365í375. ëShi85ë Shields M. W... í Deterministic asynchronous automata. In : Formal Methods in Programming. í North-Holland, 1974.

V. Sokolov and O. Kouchnarenko, í Analysis of semantic properties of a class of recursive-parallel programs, IV Conf. Application Logic, pp.72-73

E. Smith, í A survey on high-level Petri-net theory, EATCS Bull, vol.59, pp.267-293, 1996.

P. H. Starke, Free Petri net languages, Proc. 7th Math. Found. Comp. Sci, pp.506-515
DOI : 10.1007/3-540-08921-7_99

J. E. Stoy, í Denotational Semantics: The Scott-Strachey Approach to Programming Language Theory, 1977.

W. Thomas, í Inaenite trees and automaton deaenable relations over !-words, Proc. STACS 90
DOI : 10.1007/3-540-52282-4_49
URL : http://dx.doi.org/10.1016/0304-3975(92)90090-3

V. Vasilchikov, V. Emielyn, V. Kurchidis, and Y. Mamatov, í Recursive-parallel programming and work in RPMSHELL. í IPVT RAN, Iaroslavl, Russia í Programming particularities for recursive computer system on some problem examples, Computer Systems and their models, pp.19-28, 1990.

N. Wirth, .í Modula-2. í Rapport technique n 36, 1978.

G. Winskel, M. Nielsen, S. Abramsky, D. Gabbay, and T. Maibaum, í Models for concurrency In : Handbook of Logic in Computer Science, 1992.

P. Ëwol86ë-wolper, í Expressing interesting properties of programs in propositional temporal logic extended abstractt, Proc. 13th ACM Symp. Principles of Programming Languages, pp.184-193