Relevant bibliographies by topics / Parameterised systems

Contents

  1. Journal articles
  2. Dissertations / Theses
  3. Books
  4. Book chapters
  5. Conference papers
  6. Reports

Academic literature on the topic 'Parameterised systems'

Author: Grafiati
Published: 25 May 2024

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Parameterised systems.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Parameterised systems"

1

Groote, Jan Friso, and Tim A. C. Willemse. "Parameterised boolean equation systems." Theoretical Computer Science 343, no. 3 (October 2005): 332–69. http://dx.doi.org/10.1016/j.tcs.2005.06.016.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Orzan, Simona, and Tim A. C. Willemse. "Invariants for Parameterised Boolean Equation Systems." Theoretical Computer Science 411, no. 11-13 (March 2010): 1338–71. http://dx.doi.org/10.1016/j.tcs.2009.11.001.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Kouvaros, Panagiotis, and Alessio Lomuscio. "Parameterised verification for multi-agent systems." Artificial Intelligence 234 (May 2016): 152–89. http://dx.doi.org/10.1016/j.artint.2016.01.008.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Ploeger, B., J. W. Wesselink, and T. A. C. Willemse. "Verification of reactive systems via instantiation of Parameterised Boolean Equation Systems." Information and Computation 209, no. 4 (April 2011): 637–63. http://dx.doi.org/10.1016/j.ic.2010.11.025.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Nagae, Yutaro, and Masahiko Sakai. "Reduced Dependency Spaces for Existential Parameterised Boolean Equation Systems." Electronic Proceedings in Theoretical Computer Science 265 (February 16, 2018): 67–81. http://dx.doi.org/10.4204/eptcs.265.6.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Yoo, S. J. "Adaptive control of non-linearly parameterised pure-feedback systems." IET Control Theory & Applications 6, no. 3 (2012): 467. http://dx.doi.org/10.1049/iet-cta.2011.0150.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Calder, M., and A. Miller. "An automatic abstraction technique for verifying featured, parameterised systems." Theoretical Computer Science 404, no. 3 (September 2008): 235–55. http://dx.doi.org/10.1016/j.tcs.2008.03.034.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Tang, D. F., and S. Dobbie. "iGen 0.1: a program for the automated generation of models and parameterisations." Geoscientific Model Development 4, no. 3 (September 16, 2011): 785–95. http://dx.doi.org/10.5194/gmd-4-785-2011.

Full text
Abstract:
Abstract. Complex physical systems can often be simulated using very high resolution models but this is not always practical because of computational restrictions. In this case the model must be simplified or parameterised in order to make it computationally tractable. A parameterised model is created using an ad-hoc selection of techniques which range from the formal to the purely intuitive, and as a result it is very difficult to objectively quantify the fidelity of the model to the physical system. It is rare that a parameterised model can be formally shown to simulate a physical system to within some bounded error. Here we introduce a new approach to parameterising models which allows error to be formally bounded. The approach makes use of a newly developed computer program, which we call iGen, that analyses the source code of a high-resolution model and formally derives a much faster, parameterised model that closely approximates the original, reporting bounds on the error introduced by any approximations. These error bounds can be used to formally justify conclusions about a physical system based on observations of the model's behaviour. Using increasingly complex physical systems as examples we illustrate that iGen has the ability to produce parameterisations that run typically orders of magnitude faster than the underlying, high-resolution models from which they are derived.
APA, Harvard, Vancouver, ISO, and other styles
9

Tang, D. F., and S. Dobbie. "iGen: a program for the automated generation of models and parameterisations." Geoscientific Model Development Discussions 4, no. 2 (April 8, 2011): 843–68. http://dx.doi.org/10.5194/gmdd-4-843-2011.

Full text
Abstract:
Abstract. Complex physical systems can often be simulated using very high-resolution models but this is not always practical because of computational restrictions. In this case the model must be simplified or parameterised, but this is a notoriously difficult process that often requires the introduction of "model assumptions" that are hard or impossible to justify. Here we introduce a new approach to parameterising models. The approach makes use of a newly developed computer program, which we call iGen, that analyses the source code of a high-resolution model and formally derives a much faster parameterised model that closely approximates the original, reporting bounds on the error introduced by any approximations. These error bounds can be used to formally justify use of the parameterised model in subsequent numerical experiments. Using increasingly complex physical systems as examples we illustrate that iGen has the ability to produce parameterisations that run typically orders of magnitude faster than the underlying, high-resolution models from which they are derived and show that iGen has the potential to become an important tool in model development.
APA, Harvard, Vancouver, ISO, and other styles
10

Kant, Gijs, and Jaco van de Pol. "Efficient Instantiation of Parameterised Boolean Equation Systems to Parity Games." Electronic Proceedings in Theoretical Computer Science 99 (October 23, 2012): 50–65. http://dx.doi.org/10.4204/eptcs.99.7.

Full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Parameterised systems"

1

Kouvaros, Panagiotis. "Parameterised verification for multi-agent systems." Thesis, Imperial College London, 2015. http://hdl.handle.net/10044/1/33793.

Full text
Abstract:
In the past ten years several methods have been put forward for the efficient model checking of multiagent systems against agent-based specifications. Yet, since the number of states is exponential in the number of agents in the system, the model checking problem remains intractable for systems of many agents. This is particularly problematic when wishing to reason about unbounded systems where the number of components is not known at design time. Systems ranging from robotic swarms to e-commerce applications constitute typical examples in which the number of participants is independent of the design process. This thesis develops parameterised model checking techniques for the validation of multiagent systems irrespectively of the number of the agents present. To do this, a semantics that captures parameterised, synchronous multiagent systems and one that models parameterised, interleaved multiagent systems are introduced. Both semantics extend interpreted systems in a parameterised setting where the number of agents is the parameter. Parameterised model checking techniques for the semantical classes introduced are developed. A sound and complete cutoff methodology is studied for parameterised interpreted systems. A sound but incomplete cutoff procedure for parameterised interleaved interpreted systems is also studied. While the latter procedure is in exponential space, three notable subclasses are isolated and more effective verification techniques are put forward. The algorithms proposed are shown to be sound. For one class the decidability of the verification problem is shown and a complete cutoff procedure is discussed. Finally, the model checker MCMAS-P is introduced. The tool supports the verification of unbounded multiagent systems against temporal-epistemic specifications. MCMAS-P implements the procedures here developed; the procedure invoked depends on the properties of the system under examination. Experimental results obtained on cache coherence protocols, mutual exclusion protocols, swarm foraging algorithms, and swarm aggregation algorithms are reported.
APA, Harvard, Vancouver, ISO, and other styles
2

Houhou, Sara. "Parameterised Verification from Formal Specifications of Information Systems." Electronic Thesis or Diss., Sorbonne université, 2021. http://www.theses.fr/2021SORUS421.

Full text
Abstract:
La vérification des modèles de processus métiers est cruciale pour permettre d'y détecter d'éventuelles erreurs dès la conception, plutôt qu'à l'exécution sur des moteurs de processus métier. BPMN est la notation principale pour la modélisation de processus métier. Il s'agit d'un standard ISO, largement utilisé à la fois en enseignement et dans l'industrie. La sémantique de BPMN est cependant définie de façon semi-formelle au sein du standard. C'est pourquoi de nombreux travaux se sont attaqués à la définition d'une sémantique formelle pour BPMN. Dans cette thèse, nous avons tout d’abord fourni une étude détaillée des principaux travaux portant sur la vérification de modèles BPMN. Cela nous a permis d'identifier plusieurs fragments de la notation qui sont souvent mis de côté dans les travaux de formalisation, tels que les différents modèles de communication, la gestion temporelle, ou le caractère multi-instance. Ces aspects sont pourtant cruciaux pour l'élargissement du domaine d'application de BPMN vers des cadres tels que l'Internet des Objets ou l'Usine du Futur. Nous avons alors défini une approche pour la vérification de modèles de collaboration de processus métiers qui supporte plusieurs de ces perspectives, à savoir les différents modèles de communication et les contraintes liées au temps. Pour cela nous avons défini une sémantique d'exécution formelle, en termes de logique du premier ordre, au fragment de BPMN pris en compte. Nous avons ensuite défini des implantations de cette sémantique dans les langages formels TLA+ et Alloy. Ceci a, enfin, permis la vérification des modèles à l'aide des outils dédiés à ces langages formels. Notre approche est supportée par un outil, fbpmn, permettant les transformation formelles de modèles BPMN vers TLA+ et Alloy, la vérification des modèles, et l'animation de contre-exemples lorsque les propriétés à vérifier ne sont pas satisfaites. Ce retour se fait directement sur le modèle BPMN initial ce qui rend l'approche praticable dans un contexte d'utilisation par des non-spécialistes des méthodes formelles. Une application Web a aussi été développée pour rendre encore plus aisée l'application de notre approche formelle dans un cadre industriel. Nos outils, nos implantations en TLA+ et Alloy de la sémantique formelle, et notre bibliothèque d'exemples sont open source et disponibles en ligne
Business process models verification is crucial to detect possible errors at design time, rather than at execution on business process engines. BPMN is the primary notation for business process modelling. It is an ISO standard, widely used both in education and in industry. The semantics of BPMN are however defined in a semi-formal way within the standard. This is why many works have tackled the definition of formal semantics for BPMN. In this thesis, we first provided a detailed study of the main works relating to the verification of BPMN models. This allowed us to identify several fragments of the notation which are often put aside in the work of formalization, such as the different models of communication, the temporal management, or the multi-instance character. These aspects are however crucial for the extension of the field of application of BPMN to frameworks such as the Internet of Things or the Factory of the Future. We then defined an approach for the verification of business process collaboration models that supports several of these perspectives, namely the different communication models and time constraints. For this, we have defined formal execution semantics, in terms of first-order logic, to the BPMN fragment taken into account. We then defined implementations of this semantics in the formal languages ​​TLA + and Alloy. Finally, this enabled the models to be verified using tools dedicated to these formal languages. Our approach is supported by a tool, fbpmn, allowing the formal transformation of BPMN models to TLA + and Alloy, the verification of models, and the animation of counter-examples when the properties to be verified are not satisfied. This feedback is done directly on the initial BPMN model which makes the approach practicable in a context of use by non-specialists of formal methods. A web application has also been developed to make it even easier to apply our formal approach in an industrial setting. Our tools, our TLA + and Alloy formal semantics implementations, and our library of examples are open sources and available online
APA, Harvard, Vancouver, ISO, and other styles
3

Graham, Douglas. "Parameterised verification of randomised distributed systems using state-based models." Thesis, Connect to e-thesis, 2008. http://theses.gla.ac.uk/95/.

Full text
Abstract:
Thesis (Ph.D.) - University of Glasgow, 2008.
Ph.D. thesis submitted to the Faculty of Information and Mathematical Sciences, University of Glasgow, 2008. Includes bibliographical references. Print version also available.
APA, Harvard, Vancouver, ISO, and other styles
4

Lehaut, Mathieu. "Synthesis for parameterized systems." Electronic Thesis or Diss., Sorbonne université, 2020. http://www.theses.fr/2020SORUS341.

Full text
Abstract:
Cette thèse étudie le problème de la synthèse dans le cadre de systèmes distribués dont le nombre de participants n’est pas connu à l’avance et qui interagissent avec un environnement incontrôlable. Il s’agit alors de construire automatiquement un programme pour un tel système qui sera correct par construction vis à vis d’une spécification donné, si cela est possible. On étudie aussi le problème proche qu’est le contrôle, où il s’agit alors de construire un contrôleur pour un système déjà partiellement défini afin que tous les comportements de ce système soient corrects par rapport à la spécification
In this thesis, we study the synthesis problem for distributed systems where the number of participants is not known in advance and in which all participants interact with an uncontrollable environment. The synthesis problem is about automatically generating a program for such a system that would be correct by construction for a given specification, if such a program exist. We also study the closely related control problem, whose goal is generating a controller for a partially defined system such that all behaviors generated are correct with respect to the specification
APA, Harvard, Vancouver, ISO, and other styles
5

Peach, Nigel G. "Bearings only tracking using a set of range parameterised extended Kalman filters." Thesis, University of Bath, 1997. https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.362303.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Mahata, Pritha. "Model Checking Parameterized Timed Systems." Doctoral thesis, Uppsala : Acta Universitatis Upsaliensis : Univ.-bibl. [distributör], 2005. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-4835.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Malak, Richard J. Jr. "Using parameterized efficient sets to model alternatives for systems design decisions." Diss., Atlanta, Ga. : Georgia Institute of Technology, 2008. http://hdl.handle.net/1853/26697.

Full text
Abstract:
Thesis (Ph.D)--Mechanical Engineering, Georgia Institute of Technology, 2009.
Committee Chair: Paredis, Christiaan J.J.; Committee Member: Bras, Bert; Committee Member: Choudhary, Ruchi; Committee Member: McGinnis, Leon; Committee Member: Rosen, David. Part of the SMARTech Electronic Thesis and Dissertation Collection.
APA, Harvard, Vancouver, ISO, and other styles
8

Ben, Henda Noomene. "Infinite-state Stochastic and Parameterized Systems." Doctoral thesis, Uppsala University, Department of Information Technology, 2008. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-8915.

Full text
Abstract:

A major current challenge consists in extending formal methods in order to handle infinite-state systems. Infiniteness stems from the fact that the system operates on unbounded data structure such as stacks, queues, clocks, integers; as well as parameterization.

Systems with unbounded data structure are natural models for reasoning about communication protocols, concurrent programs, real-time systems, etc. While parameterized systems are more suitable if the system consists of an arbitrary number of identical processes which is the case for cache coherence protocols, distributed algorithms and so forth.

In this thesis, we consider model checking problems for certain fundamental classes of probabilistic infinite-state systems, as well as the verification of safety properties in parameterized systems. First, we consider probabilistic systems with unbounded data structures. In particular, we study probabilistic extensions of Lossy Channel Systems (PLCS), Vector addition Systems with States (PVASS) and Noisy Turing Machine (PNTM). We show how we can describe the semantics of such models by infinite-state Markov chains; and then define certain abstract properties, which allow model checking several qualitative and quantitative problems.

Then, we consider parameterized systems and provide a method which allows checking safety for several classes that differ in the topologies (linear or tree) and the semantics (atomic or non-atomic). The method is based on deriving an over-approximation which allows the use of a symbolic backward reachability scheme. For each class, the over-approximation we define guarantees monotonicity of the induced approximate transition system with respect to an appropriate order. This property is convenient in the sense that it preserves upward closedness when computing sets of predecessors.

APA, Harvard, Vancouver, ISO, and other styles
9

Kojić, Aleksandar M. 1974. "Parameter estimation in nonlinearly parameterized systems." Thesis, Massachusetts Institute of Technology, 1998. http://hdl.handle.net/1721.1/47637.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Rezine, Ahmed. "Parameterized Systems : Generalizing and Simplifying Automatic Verification." Doctoral thesis, Uppsala universitet, Avdelningen för datorteknik, 2008. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-8587.

Full text
Abstract:
In this thesis we propose general and simple methods for automatic verification of parameterized systems. These are systems consisting of an arbitrary number of identical processes or components. The number of processes defines the size of the system. A parameterized system may be regarded as an infinite family of instances, namely one for each size. The aim is to perform a parameterized verification, i.e. to verify that behaviors produced by all instances, regardless of their size, comply with some safety or liveness property. In this work, we describe three approaches to parameterized verification. First, we extend the Regular Model Checking framework to systems where components are organized in tree-like structures. For such systems, we give a methodology for computing the set of reachable configurations (used to verify safety properties) and the transitive closure (used to verify liveness properties). Next, we introduce a methodology allowing the verification of safety properties for a large class of parameterized systems. We focus on systems where components are organized in linear arrays and manipulate variables or arrays of variables ranging over bounded or numerical domains. We perform backwards reachability analysis on a uniform over-approximation of the parameterized system at hand. Finally, we suggest a new approach that enables us to reduce the verification of termination under weak fairness conditions to a reachability analysis for systems with simple commutativity properties. The idea is that reachability calculations (associated with safety) are usually less expensive then termination (associated with liveness). This idea can also be used for other transition systems and not only those induced by parameterized systems.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Books on the topic "Parameterised systems"

1

S, Kain John, and United States. National Aeronautics and Space Administration., eds. Annual performance report for the period 15 April 1996 - 14 April 1997 for NASA grant no. NAG 5-2927 entitled evaluating and understanding parameterized convective processes and their role in the development of mesoscale precipitation systems. University Park, PA: Pennsylvania State University, Office of Sponsored Programs, 1997.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
2

National Aeronautics and Space Administration (NASA) Staff. Evaluating and Understanding Parameterized Convective Processes and Their Role in the Development of Mesoscale Precipitation Systems. Independently Published, 2018.

Find full text
APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Parameterised systems"

1

Groote, Jan Friso, and Tim Willemse. "Parameterised Boolean Equation Systems." In CONCUR 2004 - Concurrency Theory, 308–24. Berlin, Heidelberg: Springer Berlin Heidelberg, 2004. http://dx.doi.org/10.1007/978-3-540-28644-8_20.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Atif, Muhammad, and Jan Friso Groote. "Linear Processes and Parameterised BESs." In Studies in Systems, Decision and Control, 149–63. Cham: Springer International Publishing, 2023. http://dx.doi.org/10.1007/978-3-031-23008-0_8.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Orzan, Simona, and Tim A. C. Willemse. "Invariants for Parameterised Boolean Equation Systems." In CONCUR 2008 - Concurrency Theory, 187–202. Berlin, Heidelberg: Springer Berlin Heidelberg, 2008. http://dx.doi.org/10.1007/978-3-540-85361-9_18.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Aştefănoaei, Lăcrămioara, Souha Ben Rayana, Saddek Bensalem, Marius Bozga, and Jacques Combaz. "Compositional Verification of Parameterised Timed Systems." In Lecture Notes in Computer Science, 66–81. Cham: Springer International Publishing, 2015. http://dx.doi.org/10.1007/978-3-319-17524-9_6.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

van Dam, A., B. Ploeger, and T. A. C. Willemse. "Instantiation for Parameterised Boolean Equation Systems." In Theoretical Aspects of Computing - ICTAC 2008, 440–54. Berlin, Heidelberg: Springer Berlin Heidelberg, 2008. http://dx.doi.org/10.1007/978-3-540-85762-4_30.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Schneider, Eric, Elizabeth I. Sklar, and Simon Parsons. "Evaluating Multi-Robot Teamwork in Parameterised Environments." In Towards Autonomous Robotic Systems, 301–13. Cham: Springer International Publishing, 2016. http://dx.doi.org/10.1007/978-3-319-40379-3_32.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Cranen, Sjoerd, Bas Luttik, and Tim A. C. Willemse. "Proof Graphs for Parameterised Boolean Equation Systems." In CONCUR 2013 – Concurrency Theory, 470–84. Berlin, Heidelberg: Springer Berlin Heidelberg, 2013. http://dx.doi.org/10.1007/978-3-642-40184-8_33.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Timm, Nils, and Heike Wehrheim. "On Symmetries and Spotlights – Verifying Parameterised Systems." In Formal Methods and Software Engineering, 534–48. Berlin, Heidelberg: Springer Berlin Heidelberg, 2010. http://dx.doi.org/10.1007/978-3-642-16901-4_35.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Keiren, Jeroen J. A., Wieger Wesselink, and Tim A. C. Willemse. "Liveness Analysis for Parameterised Boolean Equation Systems." In Automated Technology for Verification and Analysis, 219–34. Cham: Springer International Publishing, 2014. http://dx.doi.org/10.1007/978-3-319-11936-6_16.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Herden, Olaf. "Parameterised Patterns for Conceptual Modelling of Data Warehouses." In Databases and Information Systems, 97–108. Dordrecht: Springer Netherlands, 2001. http://dx.doi.org/10.1007/978-94-015-9636-7_8.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Parameterised systems"

1

Borve, Steinar. "Parameterised MRTD." In Electro-optical and Infrared Systems: Technology and Applications XX, edited by Duncan L. Hickman, Helge Bürsing, Ove Steinvall, and Gary W. Kamerman. SPIE, 2023. http://dx.doi.org/10.1117/12.2676696.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Siirtola, Antti. "Refinement Checking Parameterised Quorum Systems." In 2017 17th International Conference on Application of Concurrency to System Design (ACSD). IEEE, 2017. http://dx.doi.org/10.1109/acsd.2017.15.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Belardinelli, Francesco, Panagiotis Kouvaros, and Alessio Lomuscio. "Parameterised Verification of Data-aware Multi-Agent Systems." In Twenty-Sixth International Joint Conference on Artificial Intelligence. California: International Joint Conferences on Artificial Intelligence Organization, 2017. http://dx.doi.org/10.24963/ijcai.2017/15.

Full text
Abstract:
We introduce parameterised data-aware multi-agent systems, a formalism to reason about the temporal-epistemic properties of arbitrarily large collections of homogeneous agents, each operating on an infinite data domain. We show that their parameterised verification problem is semi-decidable for classes of interest. This is demonstrated by separately addressing the unboundedness of the number of agents and the the data domain. In doing so we reduce the parameterised model checking problem for these systems to that of parameterised verification for interleaved interpreted systems. We illustrate the expressivity of the formal model by modelling English auctions with an unbounded number of bidders on unbouded data and show how the technique here introduced can be used to give formal guarantees on the resulting system behaviour.
APA, Harvard, Vancouver, ISO, and other styles
4

Kouvaros, Panagiotis, and Alessio Lomuscio. "Verifying Fault-tolerance in Parameterised Multi-Agent Systems." In Twenty-Sixth International Joint Conference on Artificial Intelligence. California: International Joint Conferences on Artificial Intelligence Organization, 2017. http://dx.doi.org/10.24963/ijcai.2017/41.

Full text
Abstract:
We develop a technique to evaluate the fault-tolerance of a multi-agent system whose number of agents is unknown at design time. We present a method for injecting a variety of non-ideal behaviours, or faults, studied in the safety-analysis literature into the abstract agent templates that are used to generate an unbounded family of multi-agent systems with different sizes. We define the parameterised fault-tolerance problem as the decision problem of establishing whether any concrete system, in which the ratio of faulty versus non-faulty agents is under a given threshold, satisfies a given temporal-epistemic specification. We put forward a sound and complete technique for solving the problem for the semantical set-up considered. We present an implementation and a case study identifying the threshold under which the alpha swarm aggregation algorithm is robust to faults against its temporal-epistemic specifications.
APA, Harvard, Vancouver, ISO, and other styles
5

Chen, Yu-Fang, Chih-Duo Hong, Anthony W. Lin, and Philipp Rummer. "Learning to prove safety over parameterised concurrent systems." In 2017 Formal Methods in Computer-Aided Design (FMCAD). IEEE, 2017. http://dx.doi.org/10.23919/fmcad.2017.8102244.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Gallardo, María del Mar, Christophe Joubert, and Pedro Merino. "Implementing Influence Analysis Using Parameterised Boolean Equation Systems." In Second International Symposium on Leveraging Applications of Formal Methods, Verification and Validation (isola 2006). IEEE, 2006. http://dx.doi.org/10.1109/isola.2006.26.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Azzuhri, Saaidal R., Marius Portmann, and Wee Lum Tan. "Evaluation of parameterised route repair in AODV." In 2010 4th International Conference on Signal Processing and Communication Systems (ICSPCS 2010). IEEE, 2010. http://dx.doi.org/10.1109/icspcs.2010.5709663.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Buckley, Scott J. H., and Anthony M. Sloane. "A formalisation of parameterised reference attribute grammars." In SPLASH '17: Conference on Systems, Programming, Languages, and Applications: Software for Humanity. New York, NY, USA: ACM, 2017. http://dx.doi.org/10.1145/3136014.3136024.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Estivill-Castro, Vladimir, and René Hexel. "Verifiable Parameterised Behaviour Models - For Robotic and Embedded Systems." In 6th International Conference on Model-Driven Engineering and Software Development. SCITEPRESS - Science and Technology Publications, 2018. http://dx.doi.org/10.5220/0006573903640371.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Ochsenschlager, Peter, and Roland Rieke. "Security Properties of Self-Similar Uniformly Parameterised Systems of Cooperations." In 2011 19th Euromicro International Conference on Parallel, Distributed and Network-Based Processing (PDP). IEEE, 2011. http://dx.doi.org/10.1109/pdp.2011.57.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "Parameterised systems"

1

Popova, Evgenija. On a Class of Parameterized Solutions to Interval Parametric Linear Systems. "Prof. Marin Drinov" Publishing House of Bulgarian Academy of Sciences, May 2020. http://dx.doi.org/10.7546/crabs.2020.05.02.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Grogan, Brandon Robert. The Development of a Parameterized Scatter Removal Algorithm for Nuclear Materials Identification System Imaging. Office of Scientific and Technical Information (OSTI), March 2010. http://dx.doi.org/10.2172/973840.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Grogan, Brandon R. THE DEVELOPMENT OF A PARAMETERIZED SCATTER REMOVAL ALGORITHM FOR NUCLEAR MATERIALS IDENTIFICATION SYSTEM IMAGING. Office of Scientific and Technical Information (OSTI), May 2010. http://dx.doi.org/10.2172/981787.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Chen, Yongzhou, Ammar Tahir, and Radhika Mittal. Controlling Congestion via In-Network Content Adaptation. Illinois Center for Transportation, September 2022. http://dx.doi.org/10.36501/0197-9191/22-018.

Full text
Abstract:
Realizing that it is inherently difficult to match precisely the sending rates at the endhost with the available capacity on dynamic cellular links, we built a system, Octopus, that sends real-time data streams over cellular networks using an imprecise controller (that errs on the side of overestimating network capacity) and then drops appropriate packets in the cellular-network buffers to match the actual capacity. We designed parameterized primitives for implementing the packet-dropping logic, which the applications at the endhost can configure differently to express various content-adaptation policies. Octopus transport encodes the app-specified parameters in packet header fields, which the routers can parse to execute the desired dropping behavior. Our evaluation shows how real-time applications involving standard and volumetric videos can be designed to exploit Octopus for various requirements and achieve a performance that is 1.5 to 18 times better than state-of-the-art schemes.
APA, Harvard, Vancouver, ISO, and other styles
5

Agénor, Pierre-Richard, and Luiz A. Pereira da Silva. Cyclically Adjusted Provisions and Financial Stability. Inter-American Development Bank, May 2016. http://dx.doi.org/10.18235/0011733.

Full text
Abstract:
This paper studies the extent to which alternative loan loss provisioning regimes affect the procyclicality of the financial system and financial stability. It uses a DSGE model with financial frictions (namely, balance sheet and collateral effects, as well as economies of scope in banking) and a generic formulation of provisioning regimes. Numerical experiments with a parameterized version of the model show that cyclically adjusted (or, more commonly called, dynamic) provisioning can be highly effective in terms of mitigating procyclicality and financial instability, measured in terms of the volatility of the credit-output ratio and real house prices, in response to financial shocks. The optimal combination of simple cyclically adjusted provisioning and countercyclical reserve requirements rules is also studied. The simultaneous use of these instruments does not improve the ability of either one of them to mitigate financial instability, making them partial substitutes rather than complements.
APA, Harvard, Vancouver, ISO, and other styles
6

Hamill, Daniel D., Jeremy J. Giovando, Chandler S. Engel, Travis A. Dahl, and Michael D. Bartles. Application of a Radiation-Derived Temperature Index Model to the Willow Creek Watershed in Idaho, USA. U.S. Army Engineer Research and Development Center, August 2021. http://dx.doi.org/10.21079/11681/41360.

Full text
Abstract:
The ability to simulate snow accumulation and melting processes is fundamental to developing real-time hydrological models in watersheds with a snowmelt-dominated flow regime. A primary source of uncertainty with this model development approach is the subjectivity related to which historical periods to use and how to combine parameters from multiple calibration events. The Hydrologic Engineering Center, Hydrological Modeling System, has recently implemented a hybrid temperature index (TI) snow module that has not been extensively tested. This study evaluates a radiatative temperature index (RTI) model’s performance relative to the traditional air TI model. The TI model for Willow Creek performed reasonably well in both the calibration and validation years. The results of the RTI calibration and validation simulations resulted in additional questions related to how best to parameterize this snow model. An RTI parameter sensitivity analysis indicates that the choice of calibration years will have a substantial impact on the parameters and thus the streamflow results. Based on the analysis completed in this study, further refinement and verification of the RTI model calculations are required before an objective comparison with the TI model can be completed.
APA, Harvard, Vancouver, ISO, and other styles
7

Selvaraju, Ragul, Hari Shankar, and Hariharan Sankarasubramanian. Metamodel Generation for Frontal Crash Scenario of a Passenger Car. SAE International, September 2020. http://dx.doi.org/10.4271/2020-28-0504.

Full text
Abstract:
A frontal impact scenario was simulated using a Finite Element Model of a Hybrid III 50th percentile male (LSTC, Livermore CA) along with seatbelt, steering system and driver airbags. The boundary conditions included acceleration pulse to the seat and the outputs including injury measures in terms of Head Injury Criterion (HIC), Normalized Neck Injury Criterion (NIJ) and Chest Severity Index (CSI) were extracted from the simulations. The kinematics of the Hybrid III were validated against the kinematics of post mortem human surrogates (PMHS) available in the literature. Using the validated setup, metamodels were generated by creating a design of varying different parameters and recording the responses for each design. First, the X and Z translation of dummy along the seat is provided as input for which there was no variation in the head injury criterion (HIC). Next, the input pulse to the seat is parameterized along with the seatbelt loading and the results are obtained respectively. The outputs, in terms of injury measures, are generated in the form of metamodels as a function of the parameters. The occupant model used for the frontal crash scenario in LS-Dyna is validated against the previously available crash experimental data. A total of 100 design points was generated with a varying combination of parameters. An increase in various injury measures was observed with an increase in the scale factor of the acceleration pulse. Also, it was found that chest severity index increased with an increase in the scale factor of the seat belt loading force.
APA, Harvard, Vancouver, ISO, and other styles
8

Selvaraju, Ragul, Hari Shankar, and Hariharan Sankarasubramanian. Metamodel Generation for Frontal Crash Scenario of a Passenger Car. SAE International, September 2020. http://dx.doi.org/10.4271/2020-28-0504.

Full text
Abstract:
A frontal impact scenario was simulated using a Finite Element Model of a Hybrid III 50th percentile male (LSTC, Livermore CA) along with seatbelt, steering system and driver airbags. The boundary conditions included acceleration pulse to the seat and the outputs including injury measures in terms of Head Injury Criterion (HIC), Normalized Neck Injury Criterion (NIJ) and Chest Severity Index (CSI) were extracted from the simulations. The kinematics of the Hybrid III were validated against the kinematics of post mortem human surrogates (PMHS) available in the literature. Using the validated setup, metamodels were generated by creating a design of varying different parameters and recording the responses for each design. First, the X and Z translation of dummy along the seat is provided as input for which there was no variation in the head injury criterion (HIC). Next, the input pulse to the seat is parameterized along with the seatbelt loading and the results are obtained respectively. The outputs, in terms of injury measures, are generated in the form of metamodels as a function of the parameters. The occupant model used for the frontal crash scenario in LS-Dyna is validated against the previously available crash experimental data. A total of 100 design points was generated with a varying combination of parameters. An increase in various injury measures was observed with an increase in the scale factor of the acceleration pulse. Also, it was found that chest severity index increased with an increase in the scale factor of the seat belt loading force.
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Parameterised systems' for particular source types:
Journal articles Dissertations / Theses
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography