Browse
Publications
Preprints
About
About UCL Open: Env.
Aims and Scope
Editorial Board
Indexing
APCs
How to cite
Publishing policies
Editorial policy
Peer review policy
Equality, Diversity & Inclusion
About UCL Press
Contact us
For authors
Information for authors
How it works
Benefits of publishing with us
Submit
How to submit
Preparing your manuscript
Article types
Open Data
ORCID
APCs
Contributor agreement
For reviewers
Information for reviewers
Review process
How to peer review
Peer review policy
My ScienceOpen
Sign in
Register
Dashboard
Search
Browse
Publications
Preprints
About
About UCL Open: Env.
Aims and Scope
Editorial Board
Indexing
APCs
How to cite
Publishing policies
Editorial policy
Peer review policy
Equality, Diversity & Inclusion
About UCL Press
Contact us
For authors
Information for authors
How it works
Benefits of publishing with us
Submit
How to submit
Preparing your manuscript
Article types
Open Data
ORCID
APCs
Contributor agreement
For reviewers
Information for reviewers
Review process
How to peer review
Peer review policy
My ScienceOpen
Sign in
Register
Dashboard
Search
27
views
15
references
Top references
cited by
9
Cite as...
0 reviews
Review
0
comments
Comment
0
recommends
+1
Recommend
0
collections
Add to
0
shares
Share
Twitter
Sina Weibo
Facebook
Email
3,975
similar
All similar
Record
: found
Abstract
: not found
Book Chapter
: not found
CONCUR 2008 - Concurrency Theory
Mixing Lossy and Perfect Fifo Channels
other
Author(s):
P. Chambart
,
Ph. Schnoebelen
Publication date
(Print):
2008
Publisher:
Springer Berlin Heidelberg
Read this book at
Publisher
Buy book
Review
Review book
Invite someone to review
Bookmark
Cite as...
There is no author summary for this book yet. Authors can add summaries to their books on ScienceOpen to make them more accessible to a non-specialist audience.
Related collections
ScienceOpen Research
Most cited references
15
Record
: found
Abstract
: not found
Article
: not found
Verifying Programs with Unreliable Channels
Parosh Aziz Abdulla
,
Bengt Gunnar Jonsson
(1996)
0
comments
Cited
49
times
– based on
0
reviews
Review now
Bookmark
Record
: found
Abstract
: not found
Article
: not found
Unreliable Channels Are Easier to Verify Than Perfect Channels
S. Purushothaman Iyer
,
Gérard Cécé
,
Alain Finkel
(1996)
0
comments
Cited
28
times
– based on
0
reviews
Review now
Bookmark
Record
: found
Abstract
: not found
Article
: not found
Using Forward Reachability Analysis for Verification of Lossy Channel Systems
Aurore Collomb-Annichini
,
Ahmed Bouajjani
,
Bengt Gunnar Jonsson
…
(2004)
0
comments
Cited
22
times
– based on
0
reviews
Review now
Bookmark
All references
Author and book information
Book Chapter
Publication date (Print):
2008
Pages
: 340-355
DOI:
10.1007/978-3-540-85361-9_28
SO-VID:
1be3c377-86f5-4224-b282-e5514d066d4c
History
Data availability:
Comments
Comment on this book
Sign in to comment
Book chapters
pp. 1
Beyond Nash Equilibrium: Solution Concepts for the 21st Century
pp. 2
Service Choreography and Orchestration with Conversations
pp. 4
Knowledge and Information in Probabilistic Systems
pp. 5
Taming Concurrency: A Program Verification Perspective
pp. 6
A Model of Dynamic Separation for Transactional Memory
pp. 21
Completeness and Nondeterminism in Model Checking Transactional Memories
pp. 36
Semantics of Deterministic Shared-Memory Systems
pp. 52
A Scalable and Oblivious Atomicity Assertion
pp. 67
R-Automata
pp. 82
Distributed Timed Automata with Independently Evolving Clocks
pp. 98
A Context-Free Process as a Pushdown Automaton
pp. 114
Modeling Computational Security in Long-Lived Systems
pp. 131
Contract-Directed Synthesis of Simple Orchestrators
pp. 147
Environment Assumptions for Synthesis
pp. 162
Smyle: A Tool for Synthesizing Distributed Models from Scenarios by Learning
pp. 167
SYCRAFT: A Tool for Synthesizing Distributed Fault-Tolerant Programs
pp. 172
Subsequence Invariants
pp. 187
Invariants for Parameterised Boolean Equation Systems
pp. 203
Unfolding-Based Diagnosis of Systems with an Evolving Topology
pp. 218
On the Construction of Sorted Reactive Systems
pp. 233
Dynamic Partial Order Reduction Using Probe Sets
pp. 248
A Space-Efficient Probabilistic Simulation Algorithm
pp. 264
Least Upper Bounds for Probability Measures and Their Applications to Abstractions
pp. 279
Abstraction for Stochastic Systems by Erlang’s Method of Stages
pp. 295
On the Minimisation of Acyclic Models
pp. 310
Quasi-Static Scheduling of Communicating Tasks
pp. 325
Strategy Construction for Parity Games with Imperfect Information
pp. 340
Mixing Lossy and Perfect Fifo Channels
pp. 372
Spatial and Behavioral Types in the Pi-Calculus
pp. 387
A Spatial Equational Logic for the Applied π-Calculus
pp. 434
Normed BPA vs. Normed BPP Revisited
pp. 447
A Rule Format for Associativity
pp. 462
Deriving Structural Labelled Transitions for Mobile Ambients
pp. 477
Termination Problems in Chemical Kinetics
pp. 492
Towards a Unified Approach to Encodability and Separation Results for Process Calculi
Similar content
3,975
Flow Control and Scheduling for Shared FIFO Queues over Wireless Networks
Authors:
,
,
Beyond LIFO and FIFO: Exploring an Allocation-In-Fraction-Out (AIFO) policy in a two-warehouse inventory model
Authors:
Adel A. Alamri
,
Aris Syntetos
Reliable transmission of data over a semi-FIFO routing layer
Authors:
Reuven Cohen
,
Yoram Ofek
See all similar
Cited by
9
Decidable Topologies for Communicating Automata with FIFO and Bag Channels
Authors:
Lorenzo Clemente
,
Frédéric Herbreteau
,
Grégoire Sutre
Tutorial on Parameterized Model Checking of Fault-Tolerant Distributed Algorithms
Authors:
Annu Gmeiner
,
Igor Konnov
,
Ulrich Schmid
…
The Parametric Ordinal-Recursive Complexity of Post Embedding Problems
Authors:
Sylvain Schmitz
,
Prateek Karandikar
See all cited by