Algebraic laws for nondeterminism and concurrency
Journal of the ACM (JACM)
Countable nondeterminism and random assignment
Journal of the ACM (JACM)
Algebraic methods in semantics
Observation equivalence as a testing equivalence
Theoretical Computer Science
Modal logics for communicating systems
Theoretical Computer Science
A probabilistic powerdomain of evaluations
Proceedings of the Fourth Annual Symposium on Logic in computer science
Initial Algebra Semantics and Continuous Algebras
Journal of the ACM (JACM)
Concurrent Processes and Their Syntax
Journal of the ACM (JACM)
The Denotational Description of Programming Languages: An Introduction
The Denotational Description of Programming Languages: An Introduction
Denotational Semantics: The Scott-Strachey Approach to Programming Language Theory
Denotational Semantics: The Scott-Strachey Approach to Programming Language Theory
A Powerdomain for Countable Non-Determinism (Extended Abstract)
Proceedings of the 9th Colloquium on Automata, Languages and Programming
On Semantic Foundations for Applicative Multiprogramming
Proceedings of the 10th Colloquium on Automata, Languages and Programming
Power Domains and Predicate Transformers: A Topological View
Proceedings of the 10th Colloquium on Automata, Languages and Programming
Applications of Topology to Semantics of Communicating Processes
Seminar on Concurrency, Carnegie-Mellon University
Lectures on a Calculus for Communicating Systems
Seminar on Concurrency, Carnegie-Mellon University
A Complete System for SCCS with Modal Assertions
Proceedings of the Fifth Conference on Foundations of Software Technology and Theoretical Computer Science
Experiments, Powerdomains and Fully Abstract Models for Applicative Multiprogramming
Proceedings of the 1983 International FCT-Conference on Fundamentals of Computation Theory
A Note on Powerdomains and Modalitiy
Proceedings of the 1983 International FCT-Conference on Fundamentals of Computation Theory
A Modal Characterisation of Observable Machine-Behaviour
CAAP '81 Proceedings of the 6th Colloquium on Trees in Algebra and Programming
A Logic for Probabilities in Semantics
CSL '02 Proceedings of the 16th International Workshop and 11th Annual Conference of the EACSL on Computer Science Logic
A Fully-Abstract Model for the p-calculus
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
A Fully Abstract Domain Model for the p-Calculus
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
Approximating Labeled Markov Processes
LICS '00 Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science
Noninterference Equations for Nondeterministic Systems
CSFW '01 Proceedings of the 14th IEEE workshop on Computer Security Foundations
A logical approach to stable domains
Theoretical Computer Science
A Denotational Approach to the Static Analysis of Cryptographic Processes
Electronic Notes in Theoretical Computer Science (ENTCS)
Weak bisimilarity coalgebraically
CALCO'09 Proceedings of the 3rd international conference on Algebra and coalgebra in computer science
Relating coalgebraic notions of bisimulation: with applications to name-passing process calculi
CALCO'09 Proceedings of the 3rd international conference on Algebra and coalgebra in computer science
Connection between logical and algebraic approaches to concurrent systems†
Mathematical Structures in Computer Science
A static analysis of PKI-based systems
ICTCS'05 Proceedings of the 9th Italian conference on Theoretical Computer Science
Duality for logics of transition systems
FOSSACS'05 Proceedings of the 8th international conference on Foundations of Software Science and Computation Structures
Ultrafilter extensions for coalgebras
CALCO'05 Proceedings of the First international conference on Algebra and Coalgebra in Computer Science
Measuring the speed of information leakage in mobile processes
AMAST'06 Proceedings of the 11th international conference on Algebraic Methodology and Software Technology
Testing semantics: connecting processes and process logics
AMAST'06 Proceedings of the 11th international conference on Algebraic Methodology and Software Technology
VoCS'08 Proceedings of the 2008 international conference on Visions of Computer Science: BCS International Academic Conference
Algebraic synchronization trees and processes
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part II
| Hi-index | 0.00 |
Some basic topics in the theory of concurrency are studied from the point of view of denotational semantics, and particularly the ''domain theory in logical form'' developed by the author. A domain of synchronization trees is defined by means of a recursive domain equation involving the Plotkin powerdomain. The logical counterpart of this domain is described, and shown to be related to it by Stone duality. The relationship of this domain logic to the standard Hennessy-Milner logic for transition systems is studied; the domain logic can be seen as a rational reconstruction of Hennessy-Milner logic from the standpoint of a very general and systematic theory. Finally, a denotational semantics for SCCS based on the domain of synchronization trees is given, and proved fully abstract with respect to bisimulation.