Axiomatising finite delay operators
Acta Informatica
A Theory of Communicating Sequential Processes
Journal of the ACM (JACM)
Communicating sequential processes
Communicating sequential processes
Theoretical Computer Science - International Joint Conference on Theory and Practice of Software Development, P
Combining data type and recursive process specifications using projection algebras
Theoretical Computer Science
Modelling nondeterministic concurrent processes with event structures
Fundamenta Informaticae
Three equivalent semantics for CCS
Proceedings of the LITP spring school on theoretical computer science on Semantics of systems of concurrent processes
Ideal specification formalism # = expressivity + compositionality + decidability + testability + …
CONCUR '90 Proceedings on Theories of concurrency : unification and extension: unification and extension
PER models of subtyping, recursive types and higher-order polymorphism
POPL '92 Proceedings of the 19th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
The comparison of a cpo-based semantics with cms-based semantics for CSP
Theoretical Computer Science
Denotational semantics in the cpo and metric approach
Theoretical Computer Science
Handbook of logic in computer science (vol. 3): semantic structures
Handbook of logic in computer science (vol. 3): semantic structures
Metric completion versus ideal completion
Theoretical Computer Science
Specifying Concurrent Program Modules
ACM Transactions on Programming Languages and Systems (TOPLAS)
Communication and Concurrency
A Calculus of Communicating Systems
A Calculus of Communicating Systems
On the Relationship of CCS and Petri Nets
Proceedings of the 11th Colloquium on Automata, Languages and Programming
Proceedings of the 11th Colloquium on Automata, Languages and Programming
Design and Synthesis of Synchronization Skeletons Using Branching-Time Temporal Logic
Logic of Programs, Workshop
An introduction to event structures
Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency, School/Workshop
A Fully Abstract Model for a Nonuniform Concurrent Language with Parameterization and Locality
Proceedings of the REX Workshop on Sematics: Foundations and Applications
Full Abstraction and Unnested Recursion
Proceedings of the REX Workshop on Sematics: Foundations and Applications
On Observing Nondeterminism and Concurrency
Proceedings of the 7th Colloquium on Automata, Languages and Programming
The temporal logic of programs
SFCS '77 Proceedings of the 18th Annual Symposium on Foundations of Computer Science
A domain equation for bisimulation
Information and Computation
| Hi-index | 0.00 |
It is meaningful that a language is provided with several semantic descriptions: e.g. one which serves the needs of the implementor, another one that is suitable for specification and yet another one that will be used to explain the language to the user. In this case one has to guarantee that the various semantics are ‘consistent’. The attempt of this paper is to clarify the notion ‘consistency’ and to present a general framework and theorems for consistency results.