A Theory of Communicating Sequential Processes
Journal of the ACM (JACM)
Petri net models for algebraic theories of concurrency
Volume II: Parallel Languages on PARLE: Parallel Architectures and Languages Europe
Applications of compactness in the Smyth powerdomain of streams
Theoretical Computer Science
Readies and failures in the algebra of communicating processes
SIAM Journal on Computing
Axiomatising finite concurrent processes
SIAM Journal on Computing
Denotational semantics of a parallel object-oriented language
Information and Computation
Modelling nondeterministic concurrent processes with event structures
Fundamenta Informaticae
The linear time-branching time spectrum (extended abstract)
CONCUR '90 Proceedings on Theories of concurrency : unification and extension: unification and extension
Bisimulation and action refinement
Selected papers of the 3rd workshop on Concurrency and compositionality
Handbook of logic in computer science (vol. 1)
Refinement of actions in event structures and causal trees
MFCS '90 Selected papers of the 15th international symposium on Mathematical foundations of computer science
Towards action-refinement in process algebras
Information and Computation
Bisimulation semantics for concurrency with atomicity and action refinement
Fundamenta Informaticae
Split and ST bisimulation semantics
Information and Computation
A causal operational semantics of action refinement
Information and Computation
Comparing syntactic and semantic action refinement
Information and Computation - special issue: symposium on theoretical aspects of computer software TACS '94
The limit of splitn-language equivalence
Information and Computation
Control flow semantics
Operational and denotational semantics for the box algebra
Theoretical Computer Science
Communication and Concurrency
Comparative Metric Semantics of Programming
Comparative Metric Semantics of Programming
Modular Construction and Partial Order Semantics of Petri Nets
Modular Construction and Partial Order Semantics of Petri Nets
Ten Years of Concurrency Semantics; Selected Papers of the Amsterdam Concurrency Group
Ten Years of Concurrency Semantics; Selected Papers of the Amsterdam Concurrency Group
Metric Pomset Semantics for a Concurrnt Language with Recursion
Proceedings of the LITP Spring School on Theoretical Computer Science: Semantics of Systems of Concurrent Processes
Contractions in Comparing Concurrent Semantics
ICALP '88 Proceedings of the 15th International Colloquium on Automata, Languages and Programming
Relating maximality-based semantics to action refinement in process algebras
Proceedings of the 7th IFIP WG6.1 International Conference on Formal Description Techniques VII
ICALP '89 Proceedings of the 16th International Colloquium on Automata, Languages and Programming
General Refinement and Recursion Operators for the Petri Box Calculus
STACS '93 Proceedings of the 10th Annual Symposium on Theoretical Aspects of Computer Science
Testing Equivalence for Petri Nets with Action Refinement: Preliminary Report
CONCUR '92 Proceedings of the Third International Conference on Concurrency Theory
The Linear Time - Branching Time Spectrum II
CONCUR '93 Proceedings of the 4th International Conference on Concurrency 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
Fully abstract models for a process language with refinement
Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency, School/Workshop
Failures, Finiteness, and Full Abstraction
Failures, Finiteness, and Full Abstraction
| Hi-index | 0.00 |
For a process language with action refinement and synchronization both an operational and a denotational semantics are given. The operational semantics is based on an SOS-style transition system specification involving syntactical refinement sequences. The denotational semantics is an interleaving model which uses semantical refinement ‘environments'. It identifies those statements which are equal under all refinements. The denotational model is shown to be fully abstract with respect to the operational one. The underlying metric machinery is exploited to obtain this full abstractness result. Usually, action refinement is treated either in a model with some form of true concurrency, or, when an interleaving model is applied, by assuming that the refining statements are atomized. We argue that an interleaving model without such atomization is attractive as well.