Algebraic laws for nondeterminism and concurrency
Journal of the ACM (JACM)
Communicating sequential processes
Communicating sequential processes
Topology via logic
Observational structures and their logic
Selected papers of the Second Workshop on Concurrency and compositionality
Institutions: abstract model theory for specification and programming
Journal of the ACM (JACM)
Structured operational semantics and bisimulation as a congruence
Information and Computation
Transition system specifications with negative premises
Theoretical Computer Science
Journal of the ACM (JACM)
Handbook of logic in computer science (vol. 4)
Quantales, finite observations and strong bisimulation
Theoretical Computer Science
Specifying coalgebras with modal logic
Theoretical Computer Science
Communication and Concurrency
Power Domains and Predicate Transformers: A Topological View
Proceedings of the 10th Colloquium on Automata, Languages and Programming
The Linear Time-Branching Time Spectrum (Extended Abstract)
CONCUR '90 Proceedings of the Theories of Concurrency: Unification and Extension
The Linear Time - Branching Time Spectrum II
CONCUR '93 Proceedings of the 4th International Conference on Concurrency Theory
A Modal Characterisation of Observable Machine-Behaviour
CAAP '81 Proceedings of the 6th Colloquium on Trees in Algebra and Programming
| Hi-index | 0.00 |
We present a dynamic form of observational logic for specifying concurrent systems on the basis of their observable behaviour, in particular without needing a language for describing states, which are regarded as non-observable. The logic is based on quantales. The models are labelled transition systems, and a weakly complete proof system is presented. We study the logic from the point of view of modularity; vertical modularity is based on a notion of implementation of systems and refinement of specifications, and horizontal modularity is based on parallel composition of systems and specifications. Several compositionality results are presented. As an example we see a specification of a stack and its implementation over an array and a pointer.