CONCUR 2004 -- Concurrency Theory: 15th International Conference, London, UK, August 31 - September 3, 2004, ProceedingsPhilippa Gardner, Nobuko Yoshida Springer, 2011. gada 22. marts - 534 lappuses This book constitutes the refereed proceedings of the 15th International Conference on Concurrency Theory, CONCUR 2004, held in London, UK in August/September 2004. The 29 revised full papers presented together with 4 invited papers were carefully reviewed and selected from 134 submissions. Among the topics covered are concurrency related aspects of models of computation, semantic domains, process algebras, Petri nets, event structures, real-time systems, hybrid systems, decidability, model checking, verification techniques, refinement, term and graph rewriting, distributed programming, constraint logic programming, object-oriented programming, typing systems and algorithms, case studies, tools, and environments for programming and verification. |
Saturs
| 1 | |
| 16 | |
| 35 | |
Resources Concurrency and Local Reasoning | 49 |
Accepted Papers | 68 |
An UnfoldingBased Approach | 83 |
The Pros and Cons of Netcharts | 99 |
Basic Theory of Reduction Congruence for Two Timed Asynchronous | 115 |
Reversible Communicating Systems | 292 |
Parameterised Boolean Equation Systems | 308 |
An Extensional Spatial Logic for Mobile Processes | 325 |
Timed vs TimeTriggered Automata | 340 |
Expressiveness and Reachability | 355 |
A General Approach to Comparing InfiniteState Systems with Their | 371 |
Model Checking Timed Automata with One or Two Clocks | 387 |
On Flatness for 2Dimensional Vector Addition Systems with States | 402 |
Characterizing EF and EX Tree Logics | 131 |
MessagePassing Automata Are Expressively Equivalent to EMSO Logic | 146 |
Symbolic Bisimulation in the Spi Calculus | 161 |
A Symbolic Decision Procedure for Cryptographic Protocols with Time | 177 |
Deciding Probabilistic Bisimilarity Over InfiniteState Probabilistic | 193 |
A Minimal Aspect Calculus | 209 |
Type Based Discretionary Access Control | 225 |
Elimination of Quantifiers and Undecidability in Spatial Logics | 240 |
Modular Construction of Modal Logics | 258 |
Verification by Network Decomposition | 276 |
Compiling Pattern Matching in JoinPatterns | 417 |
Model Checking Restricted Sets of Timed Paths | 432 |
The True Concurrency of Innocence | 448 |
Open Maps Alternating Simulations and Control Synthesis | 466 |
Probabilistic Event Structures and Domains | 481 |
Session Types for Functional Multithreading | 497 |
A Higher Order Modal Fixed Point Logic | 512 |
Author Index | 529 |
Citi izdevumi - Skatīt visu
CONCUR 2004 -- Concurrency Theory: 15th International Conference, London, UK ... Philippa Gardner Ierobežota priekšskatīšana - 2004 |
Bieži izmantoti vārdi un frāzes
abstract action algorithm asynchronous automata automaton basic MSCs binary relation bisimilarity bisimulation boolean calculus channel clocks coalgebraic Computer Science concurrent configurations consider constraints cryptographic protocols defined Definition denote encoding environment equation system equivalence event structure example expressive FIFO finite finite-state formula function game semantics given infinite join-calculus labelled labelled transition system Lecture Notes Lemma LNCS modal modal logic model checking morphism names netchart nodes Notes in Computer notion parallel composition path Petri Petri net pointcut probabilistic problem Proc proof system properties Proposition protocols PSPACE-complete reachability reduction relation resource rewriting rules satisfies semantics sequence sequential spatial logics specification spi calculus Springer subset symbolic Theorem thread trace transition relation transition systems valuation variables VASS verification zing