Communicating sequential processes
Communicating sequential processes
Non-deterministic data types: models and implementations
Acta Informatica
The Munich Project CIP: Volume I: the wide spectrum language CIP-L
The Munich Project CIP: Volume I: the wide spectrum language CIP-L
On observational equivalence and algebraic specification
Proc. of the international joint conference on theory and practice of software development (TAPSOFT) Berlin, March 25-29, 1985 on Mathematical foundations of software development, Vol. 1: Colloquium on trees in algebra and programming (CAAP'85)
Remarks on remarks on many-sorted equational logic
ACM SIGPLAN Notices
Testing equivalences for event structures
Advanced School on Mathematical models for the semantics of parallelism
A mathematical approach to nondeterminism in data types
ACM Transactions on Programming Languages and Systems (TOPLAS)
Rewriting with a nondeterministic choice operator
Theoretical Computer Science - First European Symposium on Programming, Saarbru:9Aicken, W. Germany, March 17:8
Observing nondeterministic data types
Lecture notes in Computer Science on Recent trends in data type specification
Positive/negative conditional rewriting
1st international workshop on Conditional Term Rewriting Systems
Unified algebras and action semantics
Proceedings of the 6th Annual Symposium on Theoretical Aspects of Computer Science on STACS 89
Fundamentals of algebraic specification 2: module specifications and constraints
Fundamentals of algebraic specification 2: module specifications and constraints
Unified algebras and institutions
Proceedings of the Fourth Annual Symposium on Logic in computer science
The semantics of disjunctive deductive databases
CSL '89 Proceedings of the third workshop on Computer science logic
Handbook of theoretical computer science (vol. B)
Conditional rewriting logic as a unified model of concurrency
Selected papers of the Second Workshop on Concurrency and compositionality
Nondeterminism in algebraic specifications and algebraic programs
Nondeterminism in algebraic specifications and algebraic programs
Referential opacity in nondeterministic data refinement
ACM Letters on Programming Languages and Systems (LOPLAS)
A Calculus of Communicating Systems
A Calculus of Communicating Systems
Computing in Systems Described by Equations
Computing in Systems Described by Equations
A Discipline of Programming
Multialgebras, Power Algebras and Complete Calculi of Identities and Inclusions
Selected papers from the 10th Workshop on Specification of Abstract Data Types Joint with the 5th COMPASS Workshop on Recent Trends in Data Type Specification
Nondeterminism in Abstract Data Types
Proceedings of the 8th Colloquium on Automata, Languages and Programming
Universal Realization, Persistent Interconnection and Implementation of Abstract Modules
Proceedings of the 9th Colloquium on Automata, Languages and Programming
Nondeterministic Algebraic Specifications and Nonconfluent Term Rewriting
Proceedings of the International Workshop on Algebraic and Logic Programming
Reasoning and Rewriting with Set-Relations I: Ground Completeness
CSL '94 Selected Papers from the 8th International Workshop on Computer Science Logic
Process theory based on bisimulation semantics
Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency, School/Workshop
An introduction to event structures
Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency, School/Workshop
Conditional Rewriting Logic: Deduction, Models and Concurrency
Proceedings of the 2nd International CTRS Workshop on Conditional and Typed Rewriting Systems
On Observing Nondeterminism and Concurrency
Proceedings of the 7th Colloquium on Automata, Languages and Programming
Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency, School/Workshop
Allocations of Objects Considered as Nondeterministic Expressions - Towards a More Abstract Axiomatics of Access Types
Completeness of many-sorted equational logic
ACM SIGPLAN Notices
Algebraic approaches to nondeterminism—an overview
ACM Computing Surveys (CSUR)
A functorial semantics for multi-algebras and partial algebras, with applications to syntax
Theoretical Computer Science
Rasiowa-Sikorski deduction systems in computer science applications
Theoretical Computer Science
Structured specifications and implementation of nondeterministic data types
Nordic Journal of Computing
Hierarchical Heterogeneous Specifications
WADT '98 Selected papers from the 13th International Workshop on Recent Trends in Algebraic Development Techniques
Rasiowa-Sikorski Deduction Systems: A Handy Tool for Computer Science Logics
WADT '98 Selected papers from the 13th International Workshop on Recent Trends in Algebraic Development Techniques
Compositional Homomorphisms of Relational Structures
FCT '01 Proceedings of the 13th International Symposium on Fundamentals of Computation Theory
Convergent approximate solving of first-order constraints by approximate quantifiers
ACM Transactions on Computational Logic (TOCL)
Quantifier-free logic for nondeterministic theories
Theoretical Computer Science - Logic, language, information and computation
Non-deterministic algebraic structures for soft computing
IWANN'11 Proceedings of the 11th international conference on Artificial neural networks conference on Advances in computational intelligence - Volume Part II
Bireachability and final multialgebras
CALCO'05 Proceedings of the First international conference on Algebra and Coalgebra in Computer Science
Hi-index | 0.00 |
The current algebraic models for nondeterminism focus on the notion of possibility rather than necessity and consequently equate (nondeterministic) terms that one would intuitively not consider equal. Furthermore, existing models for nondeterminism depart radically from the standard models for (equational) specifications of deterministic operators. One would prefer that a specification language for nondeterministic operators be based on an extension of the standard model concepts, preferably in such a way that the reasoning system for (possibly nondeterministic) operators becomes the standard equational one whenever restricted to the deterministic operators—the objective should be to minimize the departure from the standard frameworks. In this article we define a specification language for nondeterministic operators and multialgebraic semantics. The first complete reasoning system for such specifications is introduced. We also define a transformation of specifications of nondeterministic operators into derived specifications of deterministic ones, obtaining a “computational” semantics of nondeterministic specification by adopting the standard semantics of the derived specification as the semantics of the original one. This semantics turns out to be a refinement of multialgebra semantics. The calculus is shown to be sound and complete also with respect to the new semantics.