Filters

8,607 Hits in 6.9 sec

### Page 7071 of Mathematical Reviews Vol. , Issue 92m [page]

1992 Mathematical Reviews
Horst Reichel (Dresden) 92m:68077 68Q60 Yodaiken, Victor (1-MA-C) Modal functions for concise definition of state machines and products. Inform. Process. Lett. 40 (1991), no. 2, 65-72.  ...  State system definitions in terms of modal functions are often a great deal more concise and intuitively transparent than the corresponding definitions in terms of traditional techniques.” 92m:68078 68Q65  ...

### Comparative Expressiveness of Product Line Calculus of Communicating Systems and 1-Selecting Modal Transition Systems [chapter]

Mahsa Varshosaz, Mohammad Reza Mousavi
2019 Lecture Notes in Computer Science
To this end, we propose a novel notion of refinement for 1MTSs that makes them more suitable for specifying variability for software product lines and prove its various essential properties.  ...  Product line calculus of communicating systems (PL-CCSs) is a process calculus proposed to model the behavior of software product lines.  ...  Fig. 1 : 1 1MTS for vending machine product line. Definition 2 ( 2 Choice Function). Let A be a set, and B ✓ 2 A and : B ! A. Then is a choice function if 8 b2B : (b) 2 b.  ...

### Family-Based SPL Model Checking Using Parity Games with Variability [chapter]

Maurice H. ter Beek, Sjef van Loo, Erik P. de Vink, Tim A. C. Willemse
2020 Lecture Notes in Computer Science
Family-based SPL model checking concerns the simultaneous verification of multiple product models, aiming to improve on enumerative product-based verification, by capitalising on the common features and  ...  , by reducing the SPL model checking problem for the modal µ-calculus on FTSs to the variability parity game solving problem, based on an encoding of FTSs as variability parity games.  ...  Definition 10. Let F = (S, θ F , s 0 ) be an FTS, let P be the set of all products, and let φ be a closed modal µ-calculus formula.  ...

### Model checking partial software product line designs

Yufeng Shi, Ou Wei, Yu Zhou
2014 Proceedings of the International Workshop on Innovative Software Development Methodologies and Practices - InnoSWDev 2014
To this end, we first propose bilatticebased feature transitions systems (BFTSs) for modeling partial software product line designs, which support description of uncertainty and preserve features as a  ...  Software product line (SPL) maximizes commonality between software products to reduce cost and improve productivity, where each product is represented by a selection of features that corresponds to particular  ...  We thank Mingyu Huang for his help with the experiments. This work has been financially supported by the National Natural Science  ...

### From Featured Transition Systems to Modal Transition Systems with Variability Constraints [chapter]

Maurice H. ter Beek, Ferruccio Damiani, Stefania Gnesi, Franco Mazzanti, Luca Paolini
2015 Lecture Notes in Computer Science
Second, it paves the way to compare the modelling and analysis of product line behaviour in two different settings.  ...  Both formal models are widely used in the field of software product line engineering and both come with a dedicated model checker. The transformation serves two purposes.  ...  Acknowledgments We thank the anonymous reviewers for their useful comments. References  ...

### Diamonds are not forever: Liveness in reactive programming with guarded recursion [article]

Patrick Bahr, Christian Uldal Graulund, Rasmus Møgelberg
2020 arXiv   pre-print
such as causality and productivity.  ...  When designing languages for functional reactive programming (FRP) the main challenge is to provide the user with a simple, flexible interface for writing programs on a high level of abstraction while  ...  Analogously to the set of machine states S(A, β) for stream types, we define the following set U (A, B, α, β) for until types: U (A, B, α, β) = t; η t ∈ T A U B (η , ∅, α, β) This definition allows us  ...

### Computational Complexity of Deciding Provability in Linear Logic and its Fragments [article]

Florian Chudigiewitsch
2021 arXiv   pre-print
We present the current state of the complexity-theoretic characterization of the most important fragments of linear logic.  ...  Linear logic has, for example, found applications in proof theory, quantum logic, and the theory of programming languages.  ...  To give a more concise notation for the cartesian product of a Petri net, we employ the grid notation, an example of which can be seen in Figure . .  ...

### Simply RaTT: A Fitch-style Modal Calculus for Reactive Programming without Space Leaks [article]

Patrick Bahr, Christian Graulund, Rasmus Møgelberg
2019 arXiv   pre-print
Functional reactive programming (FRP) is a paradigm for programming with signals and events, allowing the user to describe reactive programs on a high level of abstraction.  ...  Unlike prior calculi, Simply RaTT uses a Fitch-style approach to modal types, which simplifies the type system and makes programs more concise.  ...  This is close to the behaviour of our machine (and would in fact be a safe alternative definition).  ...

### Acoustics: An Introduction to Its Physical Principles and Applications

A. D. Pierce, H. Saunders
1984 Journal of Vibration and Acoustics
The chapter ends with Fourier series, Dirac delta function, transfer function, and Weiner-Khintchine theory. A good chapter, but not meant for casual reading.  ...  The last section is a product application workshop where the various instrument and manufacturers of vibration and noise control material explained the virtues of their products.  ...

### Diamonds are not forever: liveness in reactive programming with guarded recursion

Patrick Bahr, Christian Uldal Graulund, Rasmus Ejlers Møgelberg
2021 Proceedings of the ACM on Programming Languages (PACMPL)
such as causality and productivity.  ...  When designing languages for functional reactive programming (FRP) the main challenge is to provide the user with a simple, flexible interface for writing programs on a high level of abstraction while  ...  The null store • is used for a special state of the machine in which it can neither write to the store, nor read from it.  ...

### A domain-specific textual language for rapid prototyping of multimodal interactive systems

Fredy Cuenca, Jan Van den Bergh, Kris Luyten, Karin Coninx
2014 Proceedings of the 2014 ACM SIGCHI symposium on Engineering interactive computing systems - EICS '14
The toolkit detects the occurrence of these patterns and invokes the functionality of a back-end system in response.  ...  There are currently toolkits that allow the specification of executable multimodal human-machine interaction models.  ...  For ease of exposition, we will not directly refer to the finite state machine but to its graphical form: the state diagram.  ...

### A modular formal semantics for Ptolemy

STAVROS TRIPAKIS, CHRISTOS STERGIOU, CHRIS SHAVER, EDWARD A. LEE
2013 Mathematical Structures in Computer Science
This paper defines formally the directors for the following models of computation: Synchronous-Reactive, Discrete Event, Continuous Time, Process Networks, and Modal Models.  ...  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  ...  ), extended state machines (ESM), and modal models (MM).  ...

### All-at-once-synthesis of controllers from scenario-based product line specifications

Maxime Cordy, Jean-Marc Davril, Joel Greenyer, Erika Gressi, Patrick Heymans
2015 Proceedings of the 19th International Conference on Software Product Line - SPLC '15
We propose a scenario-based approach to design SPLs, based on a combination of Modal Sequence Diagrams (MSDs) and a feature model.  ...  An additional dimension of complexity arises when one designs many variants of a system at once, that is, a software product line (SPL).  ...  a controller for an individual product, we can keep a concise representation for the controllers of all products.  ...

### A Vision for Behavioural Model-Driven Validation of Software Product Lines [chapter]

Xavier Devroey, Maxime Cordy, Gilles Perrouin, Eun-Young Kang, Pierre-Yves Schobbens, Patrick Heymans, Axel Legay, Benoit Baudry
2012 Lecture Notes in Computer Science
We present our vision for a unified framework combining model-checking and testing approaches applied to behavioural models of SPLs.  ...  The Software Product Lines (SPLs) paradigm promises faster development cycles and increased quality by systematically reusing software assets.  ...  SDVAs thus combine the modelling constructs of state machines with the conciseness of FTSs (when it comes to representing the behaviour of a set of products).  ...

### Using FMC for family-based analysis of software product lines

Maurice H. ter Beek, Alessandro Fantechi, Stefania Gnesi, Franco Mazzanti
2015 Proceedings of the 19th International Conference on Software Product Line - SPLC '15
We show how this feature can be used to tailor formulas to the verification of only a specific subset of products of a Software Product Line, thus allowing for scalable family-based analyses with FMC.  ...  We show how the FMC model checker can successfully be used to model and analyze behavioural variability in Software Product Lines.  ...  ACKNOWLEDGEMENTS Research supported by EU project QUANTICOL (600708) and Italian MIUR project CINA (PRIN 2010LHT4KM). We thank the anonymous reviewers for their useful comments.  ...
« Previous Showing results 1 — 15 out of 8,607 results