CONCUR 2007 - Concurrency Theory

CONCUR 2007 - Concurrency Theory

18th International Conference, CONCUR 2007, Lisbon, Portugal, September 3-8, 2007, Proceedings

Vasconcelos, Vasco T.; Caires, Luis

Springer-Verlag Berlin and Heidelberg GmbH & Co. KG

08/2007

510

Mole

Inglês

9783540744061

15 a 20 dias

801

Descrição não disponível.
Invited Lectures.- Mapping the Security Landscape: A Role for Language Techniques.- The Saga of the Axiomatization of Parallel Composition.- Rule-Based Modelling of Cellular Signalling.- Contributed Papers.- Making Random Choices Invisible to the Scheduler.- Strategy Logic.- Solving Games Via Three-Valued Abstraction Refinement.- Linear Time Logics Around PSL: Complexity, Expressiveness, and a Little Bit of Succinctness.- On Modal Refinement and Consistency.- Equivalence Checking for Infinite Systems Using Parameterized Boolean Equation Systems.- Decidability Results for Well-Structured Transition Systems with Auxiliary Storage.- A Nice Labelling for Tree-Like Event Structures of Degree 3.- Causal Message Sequence Charts.- Checking Coverage for Infinite Collections of Timed Scenarios.- Is Observational Congruence Axiomatisable in Equational Horn Logic?.- The Must Preorder Revisited.- Topology-Dependent Abstractions of Broadcast Networks.- On the Expressive Power of Global and Local Priority in Process Calculi.- A Marriage of Rely/Guarantee and Separation Logic.- Fair Cooperative Multithreading.- Precise Fixpoint-Based Analysis of Programs with Thread-Creation and Procedures.- Automatic Derivation of Compositional Rules in Automated Compositional Reasoning.- Compositional Event Structure Semantics for the Internal ?-Calculus.- Interpreting a Finitary Pi-calculus in Differential Interaction Nets.- Mobility Control Via Passports.- Coalgebraic Models for Reactive Systems.- Reactive Systems over Directed Bigraphs.- Asynchronous Games: Innocence Without Alternation.- Bisimulation and Logical Preservation for Continuous-Time Markov Decision Processes.- Strategy Synthesis for Markov Decision Processes and Branching-Time Logics.- Timed Concurrent Game Structures.- PushdownModule Checking with Imperfect Information.- Alternating Automata and a Temporal Fixpoint Calculus for Visibly Pushdown Languages.- Temporal Antecedent Failure: Refining Vacuity.
Este título pertence ao(s) assunto(s) indicados(s). Para ver outros títulos clique no assunto desejado.
Bisimulation;automata;communication protocols;concurrency;concurrent processing;concurrent rewriting;concurrent systems;distributed computing;formal language;formal verification;hybrid systems;infinite state systems;model checking;parallel computing;semantics