Erlang for Concurrent ProgrammingLARSON, Jim.Communications of the ACM. 2009, Vol 52, Num 3, pp 48-56, issn 0001-0782, 9 p.Article

CONCUR 2004 : concurrency theory (London, 31 August - 3 September 2004)Gardner, Philippa; Yoshida, Nobuko.Lecture notes in computer science. 2004, issn 0302-9743, isbn 3-540-22940-X, XIII, 528 p, isbn 3-540-22940-XConference Proceedings

CONCUR 2003 : concurrency theory (Marseille, 3-5 September 2003)Amadio, Roberto; Lugiez, Denis.Lecture notes in computer science. 2003, issn 0302-9743, isbn 3-540-40753-7, XI, 524 p, isbn 3-540-40753-7Conference Proceedings

Semaphores for fair scheduling monitor conditionsDUNSTAN, N.Operating systems review. 1991, Vol 25, Num 3, pp 27-31, issn 0163-5980, 5 p.Article

Self-assessment procedure XXI : a self-assessment procedure on concurrencyRUDOLPH, B. A.Communications of the ACM. 1990, Vol 33, Num 5, pp 563-576, issn 0001-0782, 14 p.Article

Commonsense Understanding of Concurrency Computing Students and Concert TicketsLEWANDOWSKI, Gary; BOUVIER, Dennis J; CHEN, Tzu-Yi et al.Communications of the ACM. 2010, Vol 53, Num 7, pp 60-70, issn 0001-0782, 11 p.Article

Event-state duality: The enriched casePRATT, Vaughan R.Lecture notes in computer science. 2002, pp 41-56, issn 0302-9743, isbn 3-540-44043-7, 16 p.Conference Paper

Experiences with concurrent fault simulation of diagnostic programsDEMBA, S; ULRICH, E; LENTZ, K. P et al.IEEE transactions on computer-aided design of integrated circuits and systems. 1990, Vol 9, Num 6, pp 621-628, issn 0278-0070, 8 p.Article

Safety and liveness of ω-context-free languagesCHAUDHURI, S; LADNER, R. E.Information processing letters. 1991, Vol 37, Num 1, pp 13-20, issn 0020-0190, 8 p.Article

Mixed programming metaphors in a shared dataspace model of concurrencyROMAN, G.-C; CUNNINGHAM, H. C.IEEE transactions on software engineering. 1990, Vol 16, Num 12, pp 1361-1373, issn 0098-5589, 13 p.Article

The implementation of newsqueakPIKE, R.Software, practice & experience. 1990, Vol 20, Num 7, pp 649-659, issn 0038-0644, 11 p.Article

A domain equation for bisimulationABRAMSKY, S.Information and computation (Print). 1991, Vol 92, Num 2, pp 161-218, issn 0890-5401, 58 p.Article

CCS expressions, finite state processes, and three problems of equivalenceKANELLAKIS, P. C; SMOLKA, S. A.Information and computation (Print). 1990, Vol 86, Num 1, pp 43-68, issn 0890-5401, 26 p.Article

Approximate performance evaluation of parallel processing systems using average concurrencyJITTAWIRIYANUKOON, C; NAKANISHI, H; TEZUKA, Y et al.Systems and computers in Japan. 1989, Vol 20, Num 11, pp 21-32, issn 0882-1666, 12 p.Article

Two Examples of Parallel Programming without Concurrency Constructs (PP-CC)CHEN DING.ACM SIGPLAN notices. 2011, Vol 46, Num 8, pp 299-300, issn 1523-2867, 2 p.Conference Paper

Concurrent Systems. IFIP Working Group 10.3JESSHOPE, Chris.Parallel processing letters. 2008, Vol 18, Num 2, pp 199-306, issn 0129-6264, 107 p.Conference Paper

CONCUR 2006 (concurrency theory)Baier, Christel; Hermanns, Holger.Lecture notes in computer science. 2006, issn 0302-9743, isbn 3-540-37376-4, 1Vol, XIII-523 p, isbn 3-540-37376-4Conference Proceedings

Compositionality for probabilistic automataLYNCH, Nancy; SEGALA, Roberto; VAANDRAGER, Frits et al.Lecture notes in computer science. 2003, pp 208-221, issn 0302-9743, isbn 3-540-40753-7, 14 p.Conference Paper

Local Action Systems and DPO graph transformationJANSSENS, Dirk.Formal and natural computing-eessays dedicated to Grzegorz Rozenberg. Lecture notes in computer science. 2002, pp 138-157, issn 0302-9743, isbn 3-540-43190-XBook Chapter

Decidability of strong bisimilarity for timed BPPLASOTA, Slawomir.Lecture notes in computer science. 2002, pp 562-578, issn 0302-9743, isbn 3-540-44043-7, 17 p.Conference Paper

Simultaneous events : Conflicts and preferencesBELL, John.Lecture notes in computer science. 2001, pp 714-725, issn 0302-9743, isbn 3-540-42464-4Conference Paper

A very simple construction of 1-writer multireader multivalued atomic variableVIDYASANKAR, K.Information processing letters. 1991, Vol 37, Num 6, pp 323-326, issn 0020-0190, 4 p.Article

Why is simulation harder than bisimulation?KUCERA, Antonin; MAYR, Richard.Lecture notes in computer science. 2002, pp 594-609, issn 0302-9743, isbn 3-540-44043-7, 16 p.Conference Paper

Timing and causality in process algebraACETO, L; MURPHY, D.Acta informatica. 1996, Vol 33, Num 4, pp 317-350, issn 0001-5903Article

Numéro spécial ADATSI. Technique et science informatiques. 1994, Vol 13, Num 5, issn 0752-4072, 193 p.Serial Issue