2 edition of CONCUR 2010 - Concurrency Theory found in the catalog.
Published
2011 by Springer-Verlag Berlin Heidelberg in Berlin, Heidelberg .
Written in English
Edition Notes
| Statement | edited by Paul Gastin, François Laroussinie |
| Series | Lecture Notes in Computer Science -- 6269 |
| Contributions | Laroussinie, François, SpringerLink (Online service) |
| The Physical Object | |
|---|---|
| Format | [electronic resource] : |
| ID Numbers | |
| Open Library | OL25551719M |
| ISBN 10 | 9783642153747, 9783642153754 |
Transforming the soul wound
Demystifying the first year of law school
Nonpareil press of T.S. Harris
Census of dental programs in local Health Departments
Establishing and development of Tribhuvan University, 1955-1973
Application for Federal Firearms License (Collector of Curios and Relics), Revised May 2005
BLS Classic Premier- Clasp Burgundy Binder Set (Believers Life System)
Diseases of the liver.
Blues-- a photographic documentary
Saxophone Winter
Jack Miner
From Bondage to Liberation
commentary on Platos Timaeus
CONCUR - Concurrency Theory 21th International Conference, CONCURParis, France, August September 3, Proceedings. CONCUR - Concurrency Theory 21th International Conference, CONCURParis, France, August September 3,Proceedings.
Editors: Gastin, Paul. from book CONCUR - Concurrency Theory: 21th International Conference, CONCURParis, France, August September 3, Proceedings (pp) Concurrency and Composition in a. Title: Learning I/O Automata: Author(s): Aarts, Fides; Vaandrager, F.: Publication year: In: Gastin, P.; Laroussinie, F.
(ed.), CONCUR - Concurrency Theory Cited by: from book CONCUR - Concurrency Theory: 21th International Conference, CONCURParis, France, August September 3, Proceedings Proceedings A Logic for True Concurrency. This item appears in the following Collection(s) Faculty of Science []; Electronic publications [] Freely accessible full text publications plus those not yet available due to embargoCited by: CONCUR - Concurrency Theory: 21st international conference, CONCURParis, France, August September 3, proceedings, - Series Lecture Notes in Computer Science, Cited by: 8.
We present improved partition refinement algorithms for three problems: lexicographic sorting, relational coarsest partition, and double lexical ordering.
Our double lexical ordering algorithm uses Cited by: CONCUR - Concurrency Theory: 21th International Conference, CONCURParis, France, August September 3, Proceedings Springer-Verlag Berlin Heidelberg.
CONCUR - Concurrency Theory, () Reachability in Petri Nets with Inhibitor Arcs. Electronic Notes in Theoretical Computer ScienceCited by: CONCUR The 29 th International Conference on Concurrency Theory Beijing, China, September.
