jMosel: A Stand-Alone Tool and jABC Plugin for M2L(Str)

Topnik, Christian; Wilhelm, Eva; Margaria, Tiziana; Steffen, Bernhard

doi:10.1007/11691617_18

Cited by 21 publications

(11 citation statements)

References 4 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The first approach uses jMosel [11], our tool for solving Monadic SecondOrder Logic on Strings [19], and the second approach is based on Golog [12], a programming language combining imperative features with a Prolog flavor. As a common case study we have considered the Mediation Scenario of the Semantic Web Service Challenge [1,3], with the goal to synthesize abstract mediator processes, and to describe how the concrete, running (Web) service composition is computed.…”

Section: Discussionmentioning

confidence: 99%

“…However, since we are interested in finite sequences of services rather than infinite words, a Büchi automaton is not quite what we want. One could modify the existing algorithms for generating Büchi automata in the way that NFAs or DFAs are constructed; we, however, want to describe a different approach, namely by using monadic second-order logic on strings, M2L(Str) [10], and our toolkit for this logic, jMosel [11,16].…”

Section: Jmosel M2l and Sltlmentioning

confidence: 99%

“…-an approach based on monadic second order logic on strings M2L(Str) [10], which works by compositional automata construction in jMosel [11], and -an approach based on Golog [12], a tool that internally uses backward chaining for solving planning/synthesis tasks. This work is based on the well known situation calculus planner by Reiter.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Synthesizing Semantic Web Service Compositions with jMosel and Golog

Margaria

Meyer

Kubczak

et al. 2009

Lecture Notes in Computer Science

Self Cite

View full text Add to dashboard Cite

Abstract. In this paper we investigate different technologies to attack the automatic solution of orchestration problems based on synthesis from declarative specifications, a semantically enriched description of the services, and a collection of services available on a testbed. In addition to our previously presented tableaux-based synthesis technology, we consider two structurally rather different approaches here: using jMosel, our tool for Monadic Second-Order Logic on Strings and the high-level programming language Golog, that internally makes use of planning techniques. As a common case study we consider the Mediation Scenario of the Semantic Web Service Challenge, which is a benchmark for process orchestration. All three synthesis solutions have been embedded in the jABC/jETI modeling framework, and used to synthesize the abstract mediator processes as well as their concrete, running (Web) service counterpart. Using the jABC as a common frame helps highlighting the essential differences and similarities. It turns out, at least at the level of complication of the considered case study, all approaches behave quite similarly, both considering the performance as well as the modeling. We believe that turning the jABC framework into experimentation platform along the lines presented here, will help understanding the application profiles of the individual synthesis solutions and technologies, answering questing like when the overhead to achieve compositionality pays of and where (heuristic) search is the technology of choice.

show abstract

Section: Discussionmentioning

confidence: 99%

Section: Jmosel M2l and Sltlmentioning

confidence: 99%

See 1 more Smart Citation

Synthesizing Semantic Web Service Compositions with jMosel and Golog

Margaria

Meyer

Kubczak

et al. 2009

Lecture Notes in Computer Science

Self Cite

View full text Add to dashboard Cite

show abstract

“…Our method can cope with this kind of systems, since unstructured architectures can be viewed as a special case of linear arrays where the ordering of the processes is not relevant. In [23] and [34], the authors present a tool for the analysis and the verification of linear parameterized hardware systems using the monadic second-order logic on strings.…”

Section: Introductionmentioning

confidence: 99%

Monotonic Abstraction: On Efficient Verification of Parameterized Systems

Abdulla

Delzanno

Henda

et al. 2009

Int. J. Found. Comput. Sci.

View full text Add to dashboard Cite

We introduce the simple and efficient method of monotonic abstraction to prove safety properties for parameterized systems with linear topologies. A process in the system is a finite-state automaton, where the transitions are guarded by both local and global conditions. Processes may communicate via broadcast, rendez-vous and shared variables over finite domains. The method of monotonic abstraction derives an over-approximation of the induced transition system that allows the use of a simple class of regular expressions as a symbolic representation. Compared to traditional regular model checking methods, the analysis does not require the manipulation of transducers, and hence its simplicity and efficiency. We have implemented a prototype that works well on several mutual exclusion algorithms and cache coherence protocols.

show abstract

“…Our method can cope with this kind of systems, since unstructured architectures can be viewed as a special case of linear arrays where the ordering of the processes is not relevant. In [18] and [26], the authors present a tool for the analysis and the verification of linear parameterized hardware systems using the monadic second-order logic on strings.…”

Section: Introductionmentioning

confidence: 99%

Regular Model Checking Without Transducers (On Efficient Verification of Parameterized Systems)

Abdulla

Delzanno

Henda

et al.

Tools and Algorithms for the Construction and Analysis of Systems

View full text Add to dashboard Cite

Abstract. We give a simple and efficient method to prove safety properties for parameterized systems with linear topologies. A process in the system is a finite-state automaton, where the transitions are guarded by both local and global conditions. Processes may communicate via broadcast, rendez-vous and shared variables. The method derives an overapproximation of the induced transition system, which allows the use of a simple class of regular expressions as a symbolic representation. Compared to traditional regular model checking methods, the analysis does not require the manipulation of transducers, and hence its simplicity and efficiency. We have implemented a prototype which works well on several mutual exclusion algorithms and cache coherence protocols.

show abstract

jMosel: A Stand-Alone Tool and jABC Plugin for M2L(Str)

Cited by 21 publications

References 4 publications

Synthesizing Semantic Web Service Compositions with jMosel and Golog

Synthesizing Semantic Web Service Compositions with jMosel and Golog

Monotonic Abstraction: On Efficient Verification of Parameterized Systems

Regular Model Checking Without Transducers (On Efficient Verification of Parameterized Systems)

Contact Info

Product

Resources

About