Conditional rewriting logic as a unified model of concurrency
Selected papers of the Second Workshop on Concurrency and compositionality
The algebra of timed processes, ATP: theory and application
Information and Computation
A process algebra for timed systems
Information and Computation
Process Algebra with Timing
Specification of real-time and hybrid systems in rewriting logic
Theoretical Computer Science - Rewriting logic and its applications
An Interleaving Model for Real-Time Systems
TVER '92 Proceedings of the Second International Symposium on Logical Foundations of Computer Science
Membership algebra as a logical framework for equational specification
WADT '97 Selected papers from the 12th International Workshop on Recent Trends in Algebraic Development Techniques
Timed CSP: Theory and Practice
Proceedings of the Real-Time: Theory in Practice, REX Workshop
Semantic foundations for generalized rewrite theories
Theoretical Computer Science
The rewriting logic semantics project
Theoretical Computer Science
Electronic Notes in Theoretical Computer Science (ENTCS)
All about maude - a high-performance logical framework: how to specify, program and verify systems in rewriting logic
A language for task orchestration and its semantic properties
CONCUR'06 Proceedings of the 17th international conference on Concurrency Theory
Reduction Semantics and Formal Analysis of Orc Programs
Electronic Notes in Theoretical Computer Science (ENTCS)
Theoretical Computer Science
A rewriting logic approach to operational semantics
Information and Computation
Slicing for architectural analysis
Science of Computer Programming
A denotational semantical model for Orc language
ICTAC'10 Proceedings of the 7th International colloquium conference on Theoretical aspects of computing
The rewriting logic semantics project: a progress report
FCT'11 Proceedings of the 18th international conference on Fundamentals of computation theory
Verification of orchestration systems using compositional partial order reduction
ICFEM'11 Proceedings of the 13th international conference on Formal methods and software engineering
Verifying hierarchical Ptolemy II discrete-event models using Real-Time Maude
Science of Computer Programming
Timed CTL model checking in real-time maude
WRLA'12 Proceedings of the 9th international conference on Rewriting Logic and Its Applications
The rewriting logic semantics project: A progress report
Information and Computation
Hi-index | 0.00 |
Orc is a language proposed by Jayadev Misra [19] for orchestration of distributed services. Orc is very simple and elegant, based on a few basic constructs, and allows succinct and understandable programming of sophisticated applications. However, because of its real-time nature and the different priorities given to internal and external events in an Orc program, giving a formal operational semantics that captures the real-time behavior of Orc programs is nontrivial and poses some interesting challenges. In this paper we propose such a real-time operational Orc semantics, that captures the informal operational semantics given in [19]. This operational semantics is given as a rewrite theory in which the elapse of time is explicitly modeled. The priorities between internal and external events are also modeled in two alternative ways: (i) by a rewrite strategy; and (ii) by adding extra conditions to the semantic rules. Since rewriting logic has efficient implementations such as Maude, we also get, directly out of the semantic definitions, both an Orc interpreter and an LTL model checker for Orc programs.