CONCUR 2008 - Concurrency Theory [[electronic resource] ] : 19th International Conference, CONCUR 2008, Toronto, Canada, August 19-22, 2008, Proceedings / / edited by Franck van Breugel, Marsha Chechik |
Edizione | [1st ed. 2008.] |
Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2008 |
Descrizione fisica | 1 online resource (XIII, 524 p.) |
Disciplina | 004 |
Collana | Theoretical Computer Science and General Issues |
Soggetto topico |
Computer programming
Computer networks Computer science Programming Techniques Computer Communication Networks Theory of Computation Computer Science Logic and Foundations of Programming |
ISBN | 3-540-85361-8 |
Formato | Materiale a stampa ![]() |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Invited Papers -- Beyond Nash Equilibrium: Solution Concepts for the 21st Century -- Service Choreography and Orchestration with Conversations -- Knowledge and Information in Probabilistic Systems -- Taming Concurrency: A Program Verification Perspective -- Contributed Papers -- A Model of Dynamic Separation for Transactional Memory -- Completeness and Nondeterminism in Model Checking Transactional Memories -- Semantics of Deterministic Shared-Memory Systems -- A Scalable and Oblivious Atomicity Assertion -- R-Automata -- Distributed Timed Automata with Independently Evolving Clocks -- A Context-Free Process as a Pushdown Automaton -- Modeling Computational Security in Long-Lived Systems -- Contract-Directed Synthesis of Simple Orchestrators -- Environment Assumptions for Synthesis -- Smyle: A Tool for Synthesizing Distributed Models from Scenarios by Learning -- SYCRAFT: A Tool for Synthesizing Distributed Fault-Tolerant Programs -- Subsequence Invariants -- Invariants for Parameterised Boolean Equation Systems -- Unfolding-Based Diagnosis of Systems with an Evolving Topology -- On the Construction of Sorted Reactive Systems -- Dynamic Partial Order Reduction Using Probe Sets -- A Space-Efficient Probabilistic Simulation Algorithm -- Least Upper Bounds for Probability Measures and Their Applications to Abstractions -- Abstraction for Stochastic Systems by Erlang’s Method of Stages -- On the Minimisation of Acyclic Models -- Quasi-Static Scheduling of Communicating Tasks -- Strategy Construction for Parity Games with Imperfect Information -- Mixing Lossy and Perfect Fifo Channels -- On the Reachability Analysis of Acyclic Networks of Pushdown Systems -- Spatial and Behavioral Types in the Pi-Calculus -- A Spatial Equational Logic for the Applied ?-Calculus -- Structured Interactional Exceptions in Session Types -- Global Progress in Dynamically Interleaved Multiparty Sessions -- Normed BPA vs. Normed BPP Revisited -- A Rule Format for Associativity -- Deriving Structural Labelled Transitions for Mobile Ambients -- Termination Problems in Chemical Kinetics -- Towards a Unified Approach to Encodability and Separation Results for Process Calculi -- A Notion of Glue Expressiveness for Component-Based Systems. |
Record Nr. | UNISA-996465997703316 |
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2008 | ||
![]() | ||
Lo trovi qui: Univ. di Salerno | ||
|
CONCUR 2008 - Concurrency Theory : 19th International Conference, CONCUR 2008, Toronto, Canada, August 19-22, 2008, Proceedings / / edited by Franck van Breugel, Marsha Chechik |
Edizione | [1st ed. 2008.] |
Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2008 |
Descrizione fisica | 1 online resource (XIII, 524 p.) |
Disciplina | 004 |
Collana | Theoretical Computer Science and General Issues |
Soggetto topico |
Computer programming
Computer networks Computer science Programming Techniques Computer Communication Networks Theory of Computation Computer Science Logic and Foundations of Programming |
ISBN | 3-540-85361-8 |
Formato | Materiale a stampa ![]() |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Invited Papers -- Beyond Nash Equilibrium: Solution Concepts for the 21st Century -- Service Choreography and Orchestration with Conversations -- Knowledge and Information in Probabilistic Systems -- Taming Concurrency: A Program Verification Perspective -- Contributed Papers -- A Model of Dynamic Separation for Transactional Memory -- Completeness and Nondeterminism in Model Checking Transactional Memories -- Semantics of Deterministic Shared-Memory Systems -- A Scalable and Oblivious Atomicity Assertion -- R-Automata -- Distributed Timed Automata with Independently Evolving Clocks -- A Context-Free Process as a Pushdown Automaton -- Modeling Computational Security in Long-Lived Systems -- Contract-Directed Synthesis of Simple Orchestrators -- Environment Assumptions for Synthesis -- Smyle: A Tool for Synthesizing Distributed Models from Scenarios by Learning -- SYCRAFT: A Tool for Synthesizing Distributed Fault-Tolerant Programs -- Subsequence Invariants -- Invariants for Parameterised Boolean Equation Systems -- Unfolding-Based Diagnosis of Systems with an Evolving Topology -- On the Construction of Sorted Reactive Systems -- Dynamic Partial Order Reduction Using Probe Sets -- A Space-Efficient Probabilistic Simulation Algorithm -- Least Upper Bounds for Probability Measures and Their Applications to Abstractions -- Abstraction for Stochastic Systems by Erlang’s Method of Stages -- On the Minimisation of Acyclic Models -- Quasi-Static Scheduling of Communicating Tasks -- Strategy Construction for Parity Games with Imperfect Information -- Mixing Lossy and Perfect Fifo Channels -- On the Reachability Analysis of Acyclic Networks of Pushdown Systems -- Spatial and Behavioral Types in the Pi-Calculus -- A Spatial Equational Logic for the Applied ?-Calculus -- Structured Interactional Exceptions in Session Types -- Global Progress in Dynamically Interleaved Multiparty Sessions -- Normed BPA vs. Normed BPP Revisited -- A Rule Format for Associativity -- Deriving Structural Labelled Transitions for Mobile Ambients -- Termination Problems in Chemical Kinetics -- Towards a Unified Approach to Encodability and Separation Results for Process Calculi -- A Notion of Glue Expressiveness for Component-Based Systems. |
Record Nr. | UNINA-9910483383303321 |
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2008 | ||
![]() | ||
Lo trovi qui: Univ. Federico II | ||
|
Horizons of the Mind. A Tribute to Prakash Panangaden [[electronic resource] ] : Essays Dedicated to Prakash Panangaden on the Occasion of His 60th Birthday / / edited by Franck van Breugel, Elham Kashefi, Catuscia Palamidessi, Jan Rutten |
Edizione | [1st ed. 2014.] |
Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2014 |
Descrizione fisica | 1 online resource (XVIII, 499 p. 36 illus.) : online resource |
Disciplina | 005.1015113 |
Collana | Theoretical Computer Science and General Issues |
Soggetto topico |
Computer science
Machine theory Computer science—Mathematics Mathematical statistics Computer Science Logic and Foundations of Programming Formal Languages and Automata Theory Probability and Statistics in Computer Science Theory of Computation |
ISBN | 3-319-06880-6 |
Formato | Materiale a stampa ![]() |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Layout Randomization and Nondeterminism -- Probabilistic Model Checking of Labelled Markov Processes via Finite Approximate Bisimulations -- An Operational Interpretation of Negative Probabilities and No-Signalling Models -- Bisimulation on Markov Processes over Arbitrary Measurable Spaces -- Probabilistic Model Checking for Energy-Utility Analysis -- (Co)Algebraic Characterizations of Signal Flow Graphs -- Fractal Sets as Final Coalgebras Obtained by Completing an Initial Algebra -- Leaving Traces: A Note on a Sound and Complete Trace Logic for Concurrent Constraint Programs -- Privacy from Accelerating Eavesdroppers: The Impact of Losses -- The Complexity of Computing a Bisimilarity Pseudometric on Probabilistic Automata -- From Haar to Lebesgue via Domain Theory -- Word Order Alternation in Sanskrit via Precyclicity in Pregroup Grammars -- The Logic of Entanglement -- Free Energy of Petri Nets -- Laudatio for Prakash Panangaden -- Generalized Differential Privacy: Regions of Priors That Admit Robust Optimal Mechanisms -- Bisimulation for Markov Decision Processes through Families of Functional Expressions -- Random Measurable Selections -- A Final Coalgebra for k-regular Sequences -- Automata Learning: A Categorical Perspective -- Optimal Coin Flipping -- Entanglement, Flow and Classical Simulatability in Measurement Based Quantum Computation -- Euclidean Representations of Quantum States -- TCC, with History -- Probabilistic and Quantum Event Structures. |
Record Nr. | UNISA-996203720603316 |
Cham : , : Springer International Publishing : , : Imprint : Springer, , 2014 | ||
![]() | ||
Lo trovi qui: Univ. di Salerno | ||
|
Horizons of the Mind. A Tribute to Prakash Panangaden : Essays Dedicated to Prakash Panangaden on the Occasion of His 60th Birthday / / edited by Franck van Breugel, Elham Kashefi, Catuscia Palamidessi, Jan Rutten |
Edizione | [1st ed. 2014.] |
Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2014 |
Descrizione fisica | 1 online resource (XVIII, 499 p. 36 illus.) : online resource |
Disciplina | 005.1015113 |
Collana | Theoretical Computer Science and General Issues |
Soggetto topico |
Computer science
Machine theory Computer science—Mathematics Mathematical statistics Computer Science Logic and Foundations of Programming Formal Languages and Automata Theory Probability and Statistics in Computer Science Theory of Computation |
ISBN | 3-319-06880-6 |
Formato | Materiale a stampa ![]() |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Layout Randomization and Nondeterminism -- Probabilistic Model Checking of Labelled Markov Processes via Finite Approximate Bisimulations -- An Operational Interpretation of Negative Probabilities and No-Signalling Models -- Bisimulation on Markov Processes over Arbitrary Measurable Spaces -- Probabilistic Model Checking for Energy-Utility Analysis -- (Co)Algebraic Characterizations of Signal Flow Graphs -- Fractal Sets as Final Coalgebras Obtained by Completing an Initial Algebra -- Leaving Traces: A Note on a Sound and Complete Trace Logic for Concurrent Constraint Programs -- Privacy from Accelerating Eavesdroppers: The Impact of Losses -- The Complexity of Computing a Bisimilarity Pseudometric on Probabilistic Automata -- From Haar to Lebesgue via Domain Theory -- Word Order Alternation in Sanskrit via Precyclicity in Pregroup Grammars -- The Logic of Entanglement -- Free Energy of Petri Nets -- Laudatio for Prakash Panangaden -- Generalized Differential Privacy: Regions of Priors That Admit Robust Optimal Mechanisms -- Bisimulation for Markov Decision Processes through Families of Functional Expressions -- Random Measurable Selections -- A Final Coalgebra for k-regular Sequences -- Automata Learning: A Categorical Perspective -- Optimal Coin Flipping -- Entanglement, Flow and Classical Simulatability in Measurement Based Quantum Computation -- Euclidean Representations of Quantum States -- TCC, with History -- Probabilistic and Quantum Event Structures. |
Record Nr. | UNINA-9910484141703321 |
Cham : , : Springer International Publishing : , : Imprint : Springer, , 2014 | ||
![]() | ||
Lo trovi qui: Univ. Federico II | ||
|