A Theory of Communicating Sequential Processes
Journal of the ACM (JACM)
Communicating sequential processes
Communicating sequential processes
Verifying a protocol using relativized bisimulation
14th International Colloquium on Automata, languages and programming
Introduction to the ISO specification language LOTOS
Computer Networks and ISDN Systems - Special Issue: Protocol Specification and Testing
Failures semantics and deadlocking of modular Petri nets
Acta Informatica
Process algebra
Journal of the ACM (JACM)
Failure-based congruences, unfair divergences and new testing theory
PSTV '94 Proceedings of the fourteenth of a series of annual meetings on Protocol specification, testing and verification XIV
Structural operational semantics for weak bisimulations
Theoretical Computer Science
Communication and concurrency
On the operational semantics of nondeterminism and divergence
Theoretical Computer Science
IFIP TC6/ 6.1 international conference on formal description techniques IX/protocol specification, testing and verification XVI on Formal description techniques IX : theory, application and tools: theory, application and tools
Testing preorders for probabilistic processes
Information and Computation
Impossible futures and determinism
Information Processing Letters
A Calculus of Communicating Systems
A Calculus of Communicating Systems
Modular Construction and Partial Order Semantics of Petri Nets
Modular Construction and Partial Order Semantics of Petri Nets
An Improved Failures Equivalence for Finite-State Systems with a Reduction Algorithm
Proceedings of the IFIP WG6.1 International Symposium on Protocol Specification, Testing and Verification XI
Fair Testing through Probabilistic Testing
FORTE XII / PSTV XIX '99 Proceedings of the IFIP TC6 WG6.1 Joint International Conference on Formal Description Techniques for Distributed Systems and Communication Protocols (FORTE XII) and Protocol Specification, Testing and Verification (PSTV XIX)
ICALP '92 Proceedings of the 19th International Colloquium on Automata, Languages and Programming
ICALP '95 Proceedings of the 22nd International Colloquium on Automata, Languages and Programming
An Improved Failures Model for Communicating Processes
Seminar on Concurrency, Carnegie-Mellon University
The Linear Time - Branching Time Spectrum II
CONCUR '93 Proceedings of the 4th International Conference on Concurrency Theory
CONCUR '95 Proceedings of the 6th International Conference on Concurrency Theory
Infinite Probabilistic and Nonprobabilistic Testing
Proceedings of the 18th Conference on Foundations of Software Technology and Theoretical Computer Science
Concurrency and Automata on Infinite Sequences
Proceedings of the 5th GI-Conference on Theoretical Computer Science
Verification of an alternating bit protocol by means of process algebra
Proceedings of the International Spring School on Mathematical Methods of Specification and Synthesis of Software Systems '85
Distributed Computing - Special issue: Verification of lazy caching
Weak parametric failure equivalences and their congruence formats
CATS '08 Proceedings of the fourteenth symposium on Computing: the Australasian theory - Volume 77
A Hierarchy of Equivalences for Probabilistic Processes
FORTE '08 Proceedings of the 28th IFIP WG 6.1 international conference on Formal Techniques for Networked and Distributed Systems
A Foundational Theory of Contracts for Multi-party Service Composition
Fundamenta Informaticae - Fundamentals of Software Engineering 2007: Selected Contributions
On Finite Bases for Weak Semantics: Failures Versus Impossible Futures
SOFSEM '09 Proceedings of the 35th Conference on Current Trends in Theory and Practice of Computer Science
Contract-Driven Implementation of Choreographies
Trustworthy Global Computing
Contract Compliance and Choreography Conformance in the Presence of Message Queues
Web Services and Formal Methods
A theory of contracts for strong service compliance
Mathematical Structures in Computer Science
Contract-Based Discovery and Composition of Web Services
Formal Methods for Web Services
Correctly translating concurrency primitives
Proceedings of the 2009 ACM SIGPLAN workshop on ML
Closures of may-, should- and must-convergences for contextual equivalence
Information Processing Letters
On generic context lemmas for higher-order calculi with sharing
Theoretical Computer Science
What semantic equivalences are suitable for non-interference properties in computer security
ICICS'07 Proceedings of the 9th international conference on Information and communications security
Two notions of sub-behaviour for session-based client/server systems
Proceedings of the 12th international ACM SIGPLAN symposium on Principles and practice of declarative programming
Compliance preorders for web services
WS-FM'09 Proceedings of the 6th international conference on Web services and formal methods
CONCUR'10 Proceedings of the 21st international conference on Concurrency theory
Liveness of communicating transactions
APLAS'10 Proceedings of the 8th Asian conference on Programming languages and systems
Soundness-preserving refinements of service compositions
WS-FM'10 Proceedings of the 7th international conference on Web services and formal methods
A contextual semantics for concurrent Haskell with futures
Proceedings of the 13th international ACM SIGPLAN symposium on Principles and practices of declarative programming
Fair subtyping for multi-party session types
COORDINATION'11 Proceedings of the 13th international conference on Coordination models and languages
Advanced mechanisms for service composition, query and discovery
Rigorous software engineering for service-oriented systems
Advanced mechanisms for service combination and transactions
Rigorous software engineering for service-oriented systems
On the expressive power of primitives for compensation handling
ESOP'10 Proceedings of the 19th European conference on Programming Languages and Systems
Behavioural contracts with request-response operations
COORDINATION'10 Proceedings of the 12th international conference on Coordination Models and Languages
Conservative Concurrency in Haskell
LICS '12 Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer Science
Guaranteeing Weak Termination in Service Discovery
Fundamenta Informaticae - Application of Concurrency to System Design, the Eighth Special Issue
A Foundational Theory of Contracts for Multi-party Service Composition
Fundamenta Informaticae - Fundamentals of Software Engineering 2007: Selected Contributions
Conflict-preserving abstraction of discrete event systems using annotated automata
Discrete Event Dynamic Systems
Behavioural contracts with request-response operations
Science of Computer Programming
Correctness of an STM Haskell implementation
Proceedings of the 18th ACM SIGPLAN international conference on Functional programming
Fair subtyping for open session types
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part II
CONCUR'13 Proceedings of the 24th international conference on Concurrency Theory
Hi-index | 0.00 |
In this paper we present a solution to the long-standing problem of characterising the coarsest liveness-preserving pre-congruence with respect to a full (TCSP-inspired) process algebra. In fact, we present two distinct characterisations, which give rise to the same relation: an operational one based on a De Nicola-Hennessy-like testing modality which we call should-testing, and a denotational one based on a refined notion of failures. One of the distinguishing characteristics of the should-testing pre-congruence is that it abstracts from divergences in the same way as Milner's observation congruence, and as a consequence is strictly coarser than observation congruence. In other words, should-testing has a built-in fairness assumption. This is in itself a property long sought-after; it is in notable contrast to the well-known must-testing of De Nicola and Hennessy (denotationally characterised by a combination of failures and divergences), which treats divergence as catastrophic and hence is incompatible with observation congruence. Due to these characteristics, should-testing supports modular reasoning and allows to use the proof techniques of observation congruence, but also supports additional laws and techniques. Moreover, we show decidability of should-testing (on the basis of the denotational characterisation). Finally, we demonstrate its advantages by the application to a number of examples, including a scheduling problem, a version of the Alternating Bit-protocol, and fair lossy communication channels.