Results 1  10
of
10
Modal Models in Ptolemy
 In EOOLT 2010 – 3rd International Workshop on EquationBased ObjectOriented Modeling Languages and Tools. Linköping University Electronic
, 2010
"... Abstract Ptolemy is an opensource and extensible modeling and simulation framework. It offers heterogeneous modeling capabilities by allowing different models of computation to be composed hierarchically in an arbitrary fashion. This paper describes modal models, which allow to hierarchically comp ..."
Abstract

Cited by 10 (8 self)
 Add to MetaCart
(Show Context)
Abstract Ptolemy is an opensource and extensible modeling and simulation framework. It offers heterogeneous modeling capabilities by allowing different models of computation to be composed hierarchically in an arbitrary fashion. This paper describes modal models, which allow to hierarchically compose finitestate machines with other models of computation, both untimed and timed. The semantics of modal models in Ptolemy are defined in a modular manner.
A Modular Formal Semantics for Ptolemy
, 2011
"... Ptolemy is an opensource and extensible modeling and simulation framework. It offers heterogeneous modeling capabilities by allowing different models of computation, both untimed and timed, to be composed hierarchically in an arbitrary fashion. This paper proposes a formal semantics for Ptolemy whi ..."
Abstract

Cited by 4 (3 self)
 Add to MetaCart
(Show Context)
Ptolemy is an opensource and extensible modeling and simulation framework. It offers heterogeneous modeling capabilities by allowing different models of computation, both untimed and timed, to be composed hierarchically in an arbitrary fashion. This paper proposes a formal semantics for Ptolemy which is modular, in the sense that atomic actors and their compositions are treated in a unified way. In particular, all actors conform to an executable interface that contains four functions: fire (produce outputs given current state and inputs), postfire (update state instantaneously), deadline (how much time the actor is willing to let elapse) and timeupdate (update state with passage of time). Composite actors are obtained from composition operators that in Ptolemy are called directors. Different directors realize different models of computation. This
Translating Safe Petri Nets to Statecharts in a StructurePreserving Way
"... Abstract. Statecharts and Petri nets are two popular visual formalisms for modelling complex systems that exhibit concurrency. Both formalisms are supported by various design tools. To enable the automated exchange of models between Petri net and statechart tools, we present a structural, polynomial ..."
Abstract

Cited by 3 (3 self)
 Add to MetaCart
(Show Context)
Abstract. Statecharts and Petri nets are two popular visual formalisms for modelling complex systems that exhibit concurrency. Both formalisms are supported by various design tools. To enable the automated exchange of models between Petri net and statechart tools, we present a structural, polynomial algorithm that translates safe Petri nets into statecharts. The translation algorithm preserves both the structure and the behaviour of the input net. The algorithm can fail, since not every safe net has a statechart translation that preserves both its structure and behaviour. The algorithm is proven correct and the class of safe nets for which the algorithm succeeds is formally characterised. We show that the algorithm can also fail for some nets that do have a structure and behaviourpreserving statechart translation, but this incompleteness does not appear to be a severe limitation in practice. 1
An Overview on Protocol Adaptors for Service Component Integration
"... The Service Oriented Architecture (SOA) paradigm is intended for reducing development costs and software reuse by enabling automated service compositions for crossorganizational processes. However, if two service components need to interact, they can get stuck if their protocols are incompatible. S ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
(Show Context)
The Service Oriented Architecture (SOA) paradigm is intended for reducing development costs and software reuse by enabling automated service compositions for crossorganizational processes. However, if two service components need to interact, they can get stuck if their protocols are incompatible. So, an adaptor should be generated to reconcile mismatches. Existing approaches of service adaptation are manual or semiautomatic rather than fullyautomated. An overview of these different approaches is presented, revealing their similarities and differences.
Statechartable Petri nets
, 2013
"... Abstract. Petri nets and statecharts can model concurrent systems in a succinct way. While translations from statecharts to Petri nets exist, a welldefined translation from Petri nets to statecharts is lacking. Such a translation should map an input net to a corresponding statechart, having a stru ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
(Show Context)
Abstract. Petri nets and statecharts can model concurrent systems in a succinct way. While translations from statecharts to Petri nets exist, a welldefined translation from Petri nets to statecharts is lacking. Such a translation should map an input net to a corresponding statechart, having a structure and behaviour similar to that of the input net. Since statecharts can only model a restricted form of concurrency, not every Petri net has a corresponding statechart. We identify a class of Petri nets, called statechartable nets, that can be translated to corresponding statecharts. Statechartable Petri nets are structurally defined using the novel notion of an area. We also define a structural translation that maps each statechartable Petri net to a corresponding statechart. The translation is proven sound and complete for statechartable Petri nets.
Nonnull Infinitesimal Microsteps: a Metric Temporal Logic Approach
, 2012
"... ar ..."
(Show Context)
What is in a Step: New Perspectives on a Classical Question⋆
"... mantics of Statecharts”, Pnueli and Shalev showed how, in the presence of global consistency and while observing causality, the synchronous language Statecharts can be given coinciding operational and declarative step semantics. Over the past decade, this semantics has been supplemented with order ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
(Show Context)
mantics of Statecharts”, Pnueli and Shalev showed how, in the presence of global consistency and while observing causality, the synchronous language Statecharts can be given coinciding operational and declarative step semantics. Over the past decade, this semantics has been supplemented with ordertheoretic, denotational, axiomatic and gametheoretic characterisations, thus revealing itself as a rather canonical interpretation of the synchrony hypothesis. In this paper, we survey these characterisations and use them to emphasise the close but not widely known relations of Statecharts to the synchronous language Esterel and to the field of logic programming. Additionally, we highlight some early reminiscences on Amir Pnueli’s contributions to characterise the semantics of Statecharts. 1
Under consideration for publication in Math. Struct. in Comp. Science A Modular Formal Semantics for Ptolemy1 2
, 2011
"... Ptolemy is an opensource and extensible modeling and simulation framework. It offers heterogeneous modeling capabilities by allowing different models of computation, both untimed and timed, to be composed hierarchically in an arbitrary fashion. This paper proposes a formal semantics for Ptolemy whi ..."
Abstract
 Add to MetaCart
(Show Context)
Ptolemy is an opensource and extensible modeling and simulation framework. It offers heterogeneous modeling capabilities by allowing different models of computation, both untimed and timed, to be composed hierarchically in an arbitrary fashion. This paper proposes a formal semantics for Ptolemy which is modular, in the sense that atomic actors and their compositions are treated in a unified way. In particular, all actors conform to an executable interface that contains four functions: fire (produce outputs given current state and inputs), postfire (update state instantaneously), deadline (how much time the actor is willing to let elapse) and timeupdate (update state with passage of time). Composite actors are obtained from composition operators that in Ptolemy are called directors. Different directors realize different models of computation. This
XX Fusing Statecharts and Java
"... This paper presents FUSE, an approach for modeling and implementing embedded software components which starts from a mainstream programming language and brings some of the key concepts of Statecharts as firstclass elements within this language. Our approach provides a unified programming environme ..."
Abstract
 Add to MetaCart
This paper presents FUSE, an approach for modeling and implementing embedded software components which starts from a mainstream programming language and brings some of the key concepts of Statecharts as firstclass elements within this language. Our approach provides a unified programming environment which not only preserves some of the advantages of Statecharts ’ formal foundation but also directly supports features of objectorientation and strong typing. By specifying Statecharts directly in FUSE we eliminate the outofsynch between the model and the generated code and we allow the tuning and debugging to be done within the same programming model. This paper describes the main language constructs of FUSE and presents its semantics by translation into the Java programming language. We conclude by discussing extensions to the base language which enable the efficient static checking of program properties. Categories and Subject Descriptors: C.2 [Specialpurpose and applicationbased systems]: Realtime
Continuous KAOS, ASM, and Formal Control System Design Across the Continuous/Discrete Modeling Interface: A Simple Train Stopping Application
 UNDER CONSIDERATION FOR PUBLICATION IN FORMAL ASPECTS OF COMPUTING
"... A very simple model for train stopping is used as a vehicle for investigating how the development of a control system, initially designed in the continuous domain and subsequently discretized, can be captured within a formal development process compatible with standard model based refinement method ..."
Abstract
 Add to MetaCart
A very simple model for train stopping is used as a vehicle for investigating how the development of a control system, initially designed in the continuous domain and subsequently discretized, can be captured within a formal development process compatible with standard model based refinement methodologies. Starting with a formalized requirements analysis using KAOS, an abstract model of the continuous system is created in the ASM formalism. This requires extensions of the KAOS and ASM formalisms, capable of dealing with quantities evolving continuously over real time, which are developed. After considering how the continuous system, described as a continuous control system in the state space framework, can be discretized, a discrete control system is created in the state space framework. This is reexpressed in the ASM formalism. The rigorous results on the relationship between continuous and discrete control system models that are needed to establish provable properties of the discretization, then become the ingredients of a retrenchment between continuous and discrete ASM models, and are thus fully integrated into the