Modeling concurrency with partial orders
International Journal of Parallel Programming
Denotational semantics of a parallel object-oriented language
Information and Computation
Semantic correctness for a parallel object-oriented language
SIAM Journal on Computing
Contractions in comparing concurrency semantics
Theoretical Computer Science
Comparative metric semantics for concurrent Prolog
Theoretical Computer Science - Special issue on the international conference on fifth generation computer systems. Tokyo, 1988
Process algebra
Metric pomset semantics for a concurrent language with recursion
Proceedings of the LITP spring school on theoretical computer science on Semantics of systems of concurrent processes
A survey of behaviour and equivalence preserving refinements of Petri nets
APN 90 Proceedings on Advances in Petri nets 1990
Comparative semantics for flow of control in logic programming without logic
Information and Computation
Theoretical Computer Science - Images of programming dedicated to the memory of Andrei P. Ershov
A Calculus of Communicating Systems
A Calculus of Communicating Systems
Structural Operational Semantics and Bisimulation as a Congruence (Extended Abstract)
ICALP '89 Proceedings of the 16th International Colloquium on Automata, Languages and Programming
On the Semantics of Atomized Statements - the Parallel-Choice Option (Extended Abstract)
FCT '91 Proceedings of the 8th International Symposium on Fundamentals of Computation Theory
Correctness and full abstraction of metric semantics for concurrency
Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency, School/Workshop
| Hi-index | 0.00 |
A comparative semantic study is made of two notions in concurrency, viz. atomicity and action refinement. Parallel composition is modeled by interleaving, and refinement is taken in the version where actions are refined by atomized statements. The bisimulation domain used in the semantic definitions is obtained as solution of a system of domain equations over complete metric spaces. Both operational and denotational models are developed, and their equivalence is established using higher-order techniques and Banach’s fixed point theorem. The operational semantics for refinement is based on transition rules rather than on some form of syntactic substitution.