| Description |
1 online resource |
| Series |
Lecture notes in computer science, 0302-9743 ; 7454 |
|
Advanced research in computing and software science |
|
LNCS sublibrary. SL 1, Theoretical computer science and general issues |
|
Lecture notes in computer science ; 7454.
|
|
Lecture notes in computer science. Advanced research in computing and software science.
|
|
LNCS sublibrary. SL 1, Theoretical computer science and general issues.
|
| Contents |
Turing Meets Milner / Jos C.M. Baeten, Bas Luttik and Paul van Tilburg -- Concurrency and the Algebraic Theory of Effects (Abstract) / Gordon D. Plotkin -- A Turing Enigma / Brian Randell -- False Concurrency and Strange-but-True Machines (Abstract) / Peter Sewell -- Concurrent Games on VASS with Inhibition / B{vacute}eatrice Bérard, Serge Haddad, Mathieu Sassolas and Nathalie Sznajder -- Reachability Problem for Weak Multi-Pushdown Automata / Wojciech Czerwiński, Piotr Hofman and Sławomir Lasota -- Reachability and Termination Analysis of Concurrent Quantum Programs / Nengkun Yu and Mingsheng Ying -- Making Weighted Containment Feasible: A Heuristic Based on Simulation and Abstraction / Guy Avni and Orna Kupferman -- Avoiding Shared Clocks in Networks of Timed Automata / Sandie Balaguer and Thomas Chatain -- Strategy Synthesis for Multi-Dimensional Quantitative Objectives / Krishnendu Chatterjee, Mickael Randour and Jean-François Raskin -- Quantitative Languages Defined by Functional Automata / Emmanuel Filiot, Raffaella Gentilini and Jean-François Raskin |
|
A Comparison of Succinctly Represented Finite-State Systems / Romain Brenguier, Stefan Göller and Ocan Sankur -- All Linear-Time Congruences for Familiar Operators Part 2: Infinite LTSs / Antti Valmari -- Quantified CTL: Expressiveness and Model Checking (Extended Abstract) / Arnaud Da Costa, François Laroussinie and Nicolas Markey -- What Makes Atl* Decidable? A Decidable Fragment of Strategy Logic / Fabio Mogavero, Aniello Murano, Giuseppe Perelli and Moshe Y. Vardi -- Specifying Stateful Asynchronous Properties for Distributed Programs / Tzu-Chun Chen and Kohei Honda -- Synthesising Choreographies from Local Session Types / Julien Lange and Emilio Tuosto -- A Theory of History Dependent Abstractions for Learning Interface Automata / Fides Aarts, Faranak Heidarian and Frits Vaandrager -- Linearizability with Ownership Transfer / Alexey Gotsman and Hongseok Yang -- Nested Protocols in Session Types / Romain Demangeon and Kohei Honda -- Intensional and Extensional Characterisation of Global Progress in the [pi]-Calculus / Luca Fossati, Kohei Honda and Nobuko Yoshida |
|
Duality and i/o-Types in the [pi]-Calculus / Daniel Hirschkoff, Jean-Marie Madiot and Davide Sangiorgi -- Spatial and Epistemic Modalities in Constraint-Based Process Calculi / Sophia Knight, Catuscia Palamidessi, Prakash Panangaden and Frank D. Valencia -- Fluid Model Checking / Luca Bortolussi and Jane Hillston -- Playing Stochastic Games Precisely / Taolue Chen, Vojtěch Forejt, Marta Kwiatkowska, Aistis Simaitis and Ashutosh Trivedi, et al. -- Efficient Modelling and Generation of Markov Automata / Mark Timmer, Joost-Pieter Katoen, Jaco van de Pol and Mariëlle I.A. Stoelinga -- Exact Fluid Lumpability for Markovian Process Algebra / Max Tschaikowski and Mirco Tribastone -- Compositionality of Probabilistic Hennessy-Milner Logic through Structural Operational Semantics / Daniel Gebler and Wan Fokkink -- Coalgebraic Trace Semantics for Probabilistic Transition Systems Based on Measure Theory / Henning Kerstan and Barbara König |
|
Modeling Interval Order Structures with Partially Commutative Monoids / Ryszard Janicki, Xiang Yin and Nadezhda Zubkova -- A Polynomial Translation of [pi]-Calculus (FCP) to Safe Petri Nets / Roland Meyer, Victor Khomenko and Reiner Hüchting -- Algebraic Structure of Combined Traces / Łukasz Mikulski -- Verification of Petri Nets with Read Arcs / César Rodríguez and Stefan Schwoon -- Efficient Checking of Link-Reversal-Based Concurrent Systems / Matthias Függer and Josef Widder -- Efficient Coverability Analysis by Proof Minimization / Alexander Kaiser, Daniel Kroening and Thomas Wahl -- A Framework for Formally Verifying Software Transactional Memory Algorithms / Mohsen Lesani, Victor Luchangco and Mark Moir -- Propositional Dynamic Logic with Converse and Repeat for Message-Passing Systems / Roy Mennicke -- MSO Decidability of Multi-Pushdown Systems via Split-Width / Aiswarya Cyriac, Paul Gastin and K. Narayan Kumar -- Decidability Problems for Actor Systems / Frank S. de Boer, Mahdi M. Jaghoori, Cosimo Laneve and Gianluigi Zavattaro |
| Summary |
This book constitutes the thoroughly refereed proceedings of the 23rd International Conference on Concurrency Theory, CONCUR 2012, held in Newcastle upon Tyne, UK, September 4-7, 2012. The 35 revised full papers presented together with 4 invited talks were carefully reviewed and selected from 97 submissions. The papers are organized in topics such as reachability analysis; qualitative and timed systems; behavioural equivalences; temporal logics; session types; abstraction; mobility and space in process algebras; stochastic systems; probabilistic systems; Petri nets and non-sequential semantics; verification; decidability |
| Analysis |
Computer science |
|
Computer Communication Networks |
|
Software engineering |
|
Logic design |
|
Logics and Meanings of Programs |
|
Programming Languages, Compilers, Interpreters |
|
Information Systems Applications (incl. Internet) |
|
Mathematical Logic and Formal Languages |
| Bibliography |
Includes bibliographical references and author index |
| Subject |
Parallel processing (Electronic computers) -- Congresses
|
|
Computer multitasking -- Congresses
|
|
Informatique.
|
|
Computer multitasking
|
|
Parallel processing (Electronic computers)
|
| Genre/Form |
proceedings (reports)
|
|
Conference papers and proceedings
|
|
Conference papers and proceedings.
|
|
Actes de congrès.
|
| Form |
Electronic book
|
| Author |
Koutny, Maciej, 1958-
|
|
Ulidowski, Irek
|
| ISBN |
9783642329401 |
|
3642329403 |
|
