Connections between two theories of concurrency: metric spaces and synchronization trees
Information and Control
A Theory of Communicating Sequential Processes
Journal of the ACM (JACM)
Synchronous and asynchronous experiments on processes
Information and Control
Algebraic laws for nondeterminism and concurrency
Journal of the ACM (JACM)
Two Families of Languages Related to ALGOL
Journal of the ACM (JACM)
Two Complete Axiom Systems for the Algebra of Regular Events
Journal of the ACM (JACM)
Initial Algebra Semantics and Continuous Algebras
Journal of the ACM (JACM)
Communicating sequential processes
Communications of the ACM
A Calculus of Communicating Systems
A Calculus of Communicating Systems
Algebraic Semantics
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
Proceedings of the 7th Colloquium on Automata, Languages and Programming
Specification-Oriented Semantics for Communicating Processes
Proceedings of the 10th Colloquium on Automata, Languages and Programming
Behavioural Equivalence Relations Induced by Programming Logics
Proceedings of the 10th Colloquium on Automata, Languages and Programming
A Complete Set of Axioms for a Theory of Communicating Sequential Processes
Proceedings of the 1983 International FCT-Conference on Fundamentals of Computation Theory
MFCS '80 Proceedings of the 9th Symposium on Mathematical Foundations of Computer Science
Formal languages and their relation to automata
Formal languages and their relation to automata
Termination, deadlock, and divergence
Journal of the ACM (JACM)
Regular types for active objects
OOPSLA '93 Proceedings of the eighth annual conference on Object-oriented programming systems, languages, and applications
Communications of the ACM
Communications of the ACM
Integrated Environments for Formally Well-Founded Design and Simulation of Concurrent Systems
IEEE Transactions on Software Engineering
Checking for CFFD-Preorder with Tester Processes
TACAS '00 Proceedings of the 6th International Conference on Tools and Algorithms for Construction and Analysis of Systems: Held as Part of the European Joint Conferences on the Theory and Practice of Software, ETAPS 2000
An Algebraic Theory of Process Efficiency
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
Stepwise Development of Process-Algebraic Specifications in Decorated Trace Semantics
Formal Methods in System Design
Modal Logic Characterization of Markovian Testing and Trace Equivalences
Electronic Notes in Theoretical Computer Science (ENTCS)
A theory of contracts for web services
Proceedings of the 35th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Mathematical Structures in Computer Science
Residual for Component Specifications
Electronic Notes in Theoretical Computer Science (ENTCS)
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
The Pairing of Contracts and Session Types
Concurrency, Graphs and Models
On the Unification of Process Semantics: Observational Semantics
SOFSEM '09 Proceedings of the 35th Conference on Current Trends in Theory and Practice of Computer Science
A theory of contracts for Web services
ACM Transactions on Programming Languages and Systems (TOPLAS)
Contract-Based Discovery and Adaptation of Web Services
Formal Methods for Web Services
Electronic Notes in Theoretical Computer Science (ENTCS)
A survey of Markovian behavioral equivalences
SFM'07 Proceedings of the 7th international conference on Formal methods for performance evaluation
Contract-based discovery of Web services modulo simple orchestrators
Theoretical Computer Science
Fair subtyping for multi-party session types
COORDINATION'11 Proceedings of the 13th international conference on Coordination models and languages
A formal account of contracts for web services
WS-FM'06 Proceedings of the Third international conference on Web Services and Formal Methods
An algebraic basis for specifying and enforcing access control in security systems
IW-FM'00 Proceedings of the 4th Irish conference on Formal Methods
Modular composition of language features through extensions of semantic language models
IW-FM'99 Proceedings of the 3rd Irish conference on Formal Methods
A model for dynamic state-based systems
1FACS'96 Proceedings of the 1st BCS-FACS conference on Northern Formal Methods
The must preorder revisited: an algebraic theory for web services contracts
CONCUR'07 Proceedings of the 18th international conference on Concurrency Theory
Use case and task models: An integrated development methodology and its formal foundation
ACM Transactions on Software Engineering and Methodology (TOSEM) - In memoriam, fault detection and localization, formal methods, modeling and design
Required behavior of sequence diagrams: Semantics and conformance
ACM Transactions on Software Engineering and Methodology (TOSEM)
Hennessy-Milner logic with greatest fixed points as a complete behavioural specification theory
CONCUR'13 Proceedings of the 24th international conference on Concurrency Theory
| Hi-index | 0.04 |
A simple model, AT, for nondeterministic machines is presented which is based on certain types of trees. A set of operations, &Sgr;, is defined over AT and it is shown to be completely characterized by a set of inequations over &Sgr;. AT is used to define the denotational semantics of a language for defining nondeterministic machines. The significance of the model is demonstrated by showing that this semantics reflects an intuitive operational semantics of machines based on the idea that machines should only be differentiated if there is some experiment that differentiates between them.