Fundamenta Informaticae · 2008 · 17 citations · 15 references
ComputingComputer ScienceFormal MethodsKnowledge RepresentationSemanticsEvent SemanticsFormal OntologyFormal SemanticsProcess AlgebraRule-based RepresentationSpecification LanguagesCompositional VerificationDeclarative SemanticsEvent-condition-action RulesRule CompositionRule LanguagesRule-based SystemsSemantic WebSemantic Web Rules
We describe how Event-Condition-Action (ECA) rules can be combined with event algebras like SNOOP for specification of the event part, and process algebras like CCS for specification of the action part to obtain a powerful, declarative formalism that also covers intuitively procedural tasks in an appropriate way. Since these formalisms have a concise formal semantics, verification and other kinds of reasoning about such specifications are possible. Using a rulemarkupwith cleanly distinguished rule components allows for such a compositional approach. The approach is currently under implementation in the MARS (Modular Active Rules for the Semantic Web) Framework.
15
A calculus of mobile processes, II
Robin Milner, Joachim Parrow, David Walker · Information and Computation · 1992 · 1.7K citations · Full text
Calculi for synchrony and asynchrony
Robin Milner · Theoretical Computer Science · 1983 · 898 citations · Full text
Algebra of communicating processes with abstraction
J.A. Bergstra, Jan Willem Klop · Theoretical Computer Science · 1985 · 630 citations
Composite Events for Active Databases: Semantics, Contexts and Detection
Sharma Chakravarthy, V. Krishnaprasad, Eman Anwar et al. · Very Large Data Bases · 1994 · 486 citations