424 research outputs found
An Operational Petri Net Semantics for the Join-Calculus
We present a concurrent operational Petri net semantics for the
join-calculus, a process calculus for specifying concurrent and distributed
systems. There often is a gap between system specifications and the actual
implementations caused by synchrony assumptions on the specification side and
asynchronously interacting components in implementations. The join-calculus is
promising to reduce this gap by providing an abstract specification language
which is asynchronously distributable. Classical process semantics establish an
implicit order of actually independent actions, by means of an interleaving. So
does the semantics of the join-calculus. To capture such independent actions,
step-based semantics, e.g., as defined on Petri nets, are employed. Our Petri
net semantics for the join-calculus induces step-behavior in a natural way. We
prove our semantics behaviorally equivalent to the original join-calculus
semantics by means of a bisimulation. We discuss how join specific assumptions
influence an existing notion of distributability based on Petri nets.Comment: In Proceedings EXPRESS/SOS 2012, arXiv:1208.244
Towards an I/O Conformance Testing Theory for Software Product Lines based on Modal Interface Automata
We present an adaptation of input/output conformance (ioco) testing
principles to families of similar implementation variants as appearing in
product line engineering. Our proposed product line testing theory relies on
Modal Interface Automata (MIA) as behavioral specification formalism. MIA
enrich I/O-labeled transition systems with may/must modalities to distinguish
mandatory from optional behavior, thus providing a semantic notion of intrinsic
behavioral variability. In particular, MIA constitute a restricted, yet fully
expressive subclass of I/O-labeled modal transition systems, guaranteeing
desirable refinement and compositionality properties. The resulting modal-ioco
relation defined on MIA is preserved under MIA refinement, which serves as
variant derivation mechanism in our product line testing theory. As a result,
modal-ioco is proven correct in the sense that it coincides with traditional
ioco to hold for every derivable implementation variant. Based on this result,
a family-based product line conformance testing framework can be established.Comment: In Proceedings FMSPLE 2015, arXiv:1504.0301
Re-pair for Trees
We introduce a new linear time compression algorithm, called 'Repair for Trees', which compresses ordered trees over a ranked alphabet using linear straight-line context-free tree grammars. Such grammars generalize straight-line context-free string grammars and allow basic tree operations, like traversal along edges, to be executed without prior decompression. Our algorithm can be considered as a generalization of the 'Re-pair' algorithm developed by N. Jesper Larsson and Alistair Moffat in 2000. The latter algorithm is a dictionary-based compression algorithm for strings.
We also introduce a succinct coding which is specialized in further compressing the grammars generated by our algorithm. Thisis accomplished without loosing the ability do directly execute queries on this compressed representation of the input tree. Finally, we compare the grammars and output files generated by a prototype of the Re-pair for Trees algorithm with those of similar compression algorithms. The obtained results show that that our algorithm outperforms its competitors in terms of compression ratio, runtime and memory usage
Letter to William James regarding award of a Lucile Elliott Scholarship, May 25, 1981
A letter from Patricia Mennicke to William James accepting the Lucile Elliott Scholarship awarded to her
“When in Our Music God is Glorified”: Trinitarian Reflections in Music, Faith, and Learning
Dr. David Mennicke, professor of music at Concordia University since 1989 and a recognized leader in the field of choral music, delivered the annual Poehler Lecture on Faith and Learning, Thursday, March 20, 2014. The title of Mennicke’s presentation is “When in our Music God is Glorified: Trinitarion Reflections on Music, Faith and Learning.
Notation3 as an Existential Rule Language
Notation3 Logic (\nthree) is an extension of RDF that allows the user to
write rules introducing new blank nodes to RDF graphs. Many applications (e.g.,
ontology mapping) rely on this feature as blank nodes -- used directly or in
auxiliary constructs -- are omnipresent on the Web. However, the number of fast
\nthree reasoners covering this very important feature of the logic is rather
limited. On the other hand, there are engines like VLog or Nemo which do not
directly support Semantic Web rule formats but which are developed and
optimized for very similar constructs: existential rules. In this paper, we
investigate the relation between \nthree rules with blank nodes in their heads
and existential rules. We identify a subset of \nthree which can be mapped
directly to existential rules and define such a mapping preserving the
equivalence of \nthree formulae. In order to also illustrate that in some cases
\nthree reasoning could benefit from our translation, we then employ this
mapping in an implementation to compare the performance of the \nthree
reasoners EYE and cwm to VLog and Nemo on \nthree rules and their mapped
counterparts. Our tests show that the existential rule reasoners perform
particularly well for use cases containing many facts while especially the EYE
reasoner is very fast when dealing with a high number of dependent rules. We
thus provide a tool enabling the Semantic Web community to directly use
existing and future existential rule reasoners and benefit from the findings of
this active community
Auszug aus der Inaugural-Dissertation zur Erlangung der Doktorwürde der Hohen Medizinischen Fakultät der Vereinigten Friedrichs-Universität Halle-Wittenberg
Propositional Dynamic Logic with Converse and Repeat for Message-Passing Systems
The model checking problem for propositional dynamic logic (PDL) over message sequence charts (MSCs) and communicating finite state machines (CFMs) asks, given a channel bound B, a PDL formula φ and a CFM C, whether every existentially B-bounded MSC M accepted by C satisfies φ. Recently, it was shown that this problem is PSPACE-complete. In the present work, we consider CRPDL over MSCs which is PDL equipped with the operators converse and repeat. The former enables one to walk back and forth within an MSC using a single path expression whereas the latter allows to express that a path expression can be repeated infinitely often. To solve the model checking problem for this logic, we define message sequence chart automata (MSCAs) which are multi-way alternating parity automata walking on MSCs. By exploiting a new concept called concatenation states, we are able to inductively construct, for every CRPDL formula φ, an MSCA precisely accepting the set of models of φ. As a result, we obtain that the model checking problem for CRPDL and CFMs is still in PSPACE
- …