Petri net models for algebraic theories of concurrency
Volume II: Parallel Languages on PARLE: Parallel Architectures and Languages Europe
A timed model for communicating sequential processes
Theoretical Computer Science - Thirteenth International Colloquim on Automata, Languages and Programming, Renne
Failures semantics based on interval semiwords is a convergence for refinement
STACS 90 Proceedings of the seventh annual symposium on Theoretical aspects of computer science
About semantic action refinement
Fundamenta Informaticae
A temporal calculus of communicating systems
CONCUR '90 Proceedings on Theories of concurrency : unification and extension: unification and extension
Real-time behaviour of asynchronous agents
CONCUR '90 Proceedings on Theories of concurrency : unification and extension: unification and extension
Towards action-refinement in process algebras
Information and Computation
A theory of processes with durational actions
AMAST '93 Selected papers of the international conference on Algebraic methodology of software technology
Communication and Concurrency
A Calculus of Communicating Systems
A Calculus of Communicating Systems
Event Structures, Causal Trees, and Refinements
MFCS '90 Proceedings of the Mathematical Foundations of Computer Science 1990
Specification and verification of real time systems in ACP
Proceedings of the IFIP WG6.1 Tenth International Symposium on Protocol Specification, Testing and Verification X
On Syntactic and Semantic Action Refinement
TACS '94 Proceedings of the International Conference on Theoretical Aspects of Computer Software
Syntactic Action Refinement in Presence of Multiway Synchronisation
Proceedings of the International Workshop on Semantics of Specification Languages (SoSL)
Adding Action Refinement to a Finite Process Algebra
ICALP '91 Proceedings of the 18th International Colloquium on Automata, Languages and Programming
On the Ill-Timed but Well-Caused
CONCUR '93 Proceedings of the 4th International Conference on Concurrency Theory
Concurrency and Automata on Infinite Sequences
Proceedings of the 5th GI-Conference on Theoretical Computer Science
Fully abstract models for a process language with refinement
Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency, School/Workshop
Refinement of Actions in Causality Based Models
Stepwise Refinement of Distributed Systems, Models, Formalisms, Correctness, REX Workshop
| Hi-index | 0.00 |
In this paper, we present a durational process algebra incorporating syntactic action refinement. We study its correctness with respect to the semantic refinement in an interleaving model, namely the labelled transition systems. This defined refinement is compositional over the language operators and may provide at a given level of abstraction a timed efficient implementation for a specification.