720 research outputs found
Models, Algorithms, Logics and Tools [electronic resource] : Essays Dedicated to Kim Guldstrand Larsen on the Occasion of His 60th Birthday /
No full textThis Festschrift is published in honor of Kim Guldstrand Larsen, one of the earliest precursors of computer science in Denmark, on the occasion of his 60th birthday. During the last three decades, Kim Guldstrand Larsen has given major contributions across a remarkably wide range of topics, including real-time, concurrent, and probabilistic models of computation, logic in computer science, and model checking. Since 1995, he has been one of the prime movers behind the model checking tool for real-time systems UPPAAL, for which he was a co-recipient of the CAV Award in 2013. The Festschrift contains 32 papers that feature the broad range of Kim Guldstrand Larsen's research topics, such as formal languages and automata theory; logic; verification, model checking and testing; algorithmic game theory and mechanism design; semantics and reasoning; real-time and distributed systems; and modeling and simulation.Information Flow for Timed Automata -- A Nivat Theorem for Quantitative Automata on Unranked Trees -- 30 Years of Modal Transition Systems: Survey of Extensions and Analysis -- Derivatives of Quantitative Regular Expressions -- Improving the Timed Automata Approach to Biological Pathway Dynamics -- Bicategories of Markov Processes -- Property-Preserving Parallel Decomposition -- A Generic Algorithm for Learning Symbolic Automata from Membership Queries -- Teaching Academic Concurrency to Amazing Students -- Negative Results on Decidability and Small Model Property of Process Equations -- Timed Temporal Logics -- Synchronous Interfaces and Assume/Guarantee Contracts -- From Transition Systems to Variability Models & From Lifted Model Checking Back to UPPAAL -- Firm Deadline Checking of Safety-Critical Java Applications with Statistical Model Checking -- Symbolic Verification and Strategy Synthesis for Linearly-Priced Probabilistic Timed Automata -- Runtime Verification Logics - A Language Design Perspective -- Testing Divergent Transition Systems -- The Cost of Exactness in Quantitative Reachability -- Towards Automated Variant Selection for HeterogeneousTiled Architectures -- Admissible Strategies in Timed Games -- Modal Stochastic Games: Abstraction-Refinement of Probabilistic Automata -- A Coinductive Equational Characterisation of Trace Inclusion for Regular Processes -- Syntactic Markovian Bisimulation for Chemical Reaction Networks -- Assertion-Based Reasoning Method for Calculus of Wireless System -- Taming Living Logic Using Formal Methods -- Comparing Source Sets and Persistent Sets for Partial Order Reduction -- A Framework for Evaluating Schedulability Analysis Tools -- WUPPAAL: Computation of Worst-Case Execution-Time for Binary Programs with UPPAAL -- Centrally Governed Blockchains: Optimizing Security, Cost, and Availability -- Energy Consumption Forecast of Photo-Voltaic Comfort Cooling Using UPPAAL Stratego -- Towards a Tool: TIMES-Pro for Modeling, Analysis, Simulation and Implementation of Cyber-Physical Systems -- Formalising a Hazard Warning Communication Protocol with Timed Automata.This Festschrift is published in honor of Kim Guldstrand Larsen, one of the earliest precursors of computer science in Denmark, on the occasion of his 60th birthday. During the last three decades, Kim Guldstrand Larsen has given major contributions across a remarkably wide range of topics, including real-time, concurrent, and probabilistic models of computation, logic in computer science, and model checking. Since 1995, he has been one of the prime movers behind the model checking tool for real-time systems UPPAAL, for which he was a co-recipient of the CAV Award in 2013. The Festschrift contains 32 papers that feature the broad range of Kim Guldstrand Larsen's research topics, such as formal languages and automata theory; logic; verification, model checking and testing; algorithmic game theory and mechanism design; semantics and reasoning; real-time and distributed systems; and modeling and simulation
A Model-Checking Static Analysis of Task-Based Energy Neutrality for Energy Harvesting IoT
No full textWe address the problem of energy neutrality in energy harvesting IoT devices by means of a model checking approach, aiming at analyzing the dynamics of the battery charge in energy-neutral IoT devices. Our approach allows to compute the best task schedule and to study the maximum utility when operating on other parameters such as the initial battery charge, the number and structure of the available tasks, the size of the photo-voltaic panel that recharges the device, the day of the year, and the variable weather conditions that affect the energy production. The simulations confirm the state space explosion typical of model checking, but also hint that a small number of alternative tasks can achieve an overall utility very close to a large number of tasks. This conjecture has a strong practical relevance since it can pave the way to the wider adoption of energy neutrality concept in low-power IoT devices
Compositional Modeling of Reactive Systems Using Open Nets
No full textCONCUR'01, K.G. Larsen and M. Nielsen eds., Springer
Compositional Metric Reasoning with Probabilistic Process Calculi
Full text linkWe study which standard operators of probabilistic process calculi allow for compositional reasoning with respect to bisimulation metric semantics. We argue that uniform continuity (generalizing the earlier proposed property of non-expansiveness) captures the essential nature of compositional reasoning and allows now also to reason compositionally about recursive processes. We characterize the distance between probabilistic processes composed by standard process algebra operators. Combining these results, we demonstrate how compositional reasoning about systems specified by continuous process algebra operators allows for metric assume-guarantee like performance validation.</p
Priced Timed Automata: Theory and Tools
No full textPriced timed automata are emerging as useful formalisms for modeling and analysing a broad range of resource allocation problems. In this extended abstract, we highlight recent (un)deci\-dability results related to priced timed automata as well as point to a number of open problems.Priced timed automata are emerging as useful formalisms for modeling and analysing a broad range of resource allocation problems. In this extended abstract, we highlight recent (un)deci\-dability results related to priced timed automata as well as point to a number of open problems
10031 Executive Summary – Quantitative Models: Expressiveness and Analysis
Full text linkQuantitative models and quantitative analysis in Computer Science
are currently intensively studied, resulting in a revision of the
foundation of Computer Science where classical yes/no answers are
replaced by quantitative analyses. The potential application areas
are huge, e.g., performance analysis, operational research or
embedded systems.
The aim of the seminar was to address three fundamental topics
which are closely related: quantitative analysis of real-time and hybrid
systems; probabilistic analysis and stochastic automata; weighted
automata. These three areas of research have mainly evolved
independently so far and the relationship between them has emerged
only recently. The seminar brought together leading researchers
of the three areas, with the goal of future highly productive
cross-fertilizations
10031 Abstracts Collection – Quantitative Models: Expressiveness and Analysis
Full text linkFrom Jan 18 to Jan 22, 2010, the Dagstuhl Seminar 10031 ``Quantitative Models: Expressiveness and Analysis '' was held in Schloss Dagstuhl~--~Leibniz Center for Informatics. During the seminar, several participants presented their current
research, and ongoing work and open problems were discussed. Abstracts of
the presentations given during the seminar as well as abstracts of
seminar results and ideas are put together in this paper. The first section
describes the seminar topics and goals in general.
Links to extended abstracts or full papers are provided, if available
Polynomial Time Decidability of Weighted Synchronization under Partial Observability
Full text linkWe consider weighted automata with both positive and negative integer weights on edges and study the problem of synchronization using adaptive strategies that may only observe whether the current weight-level is negative or nonnegative. We show that the synchronization problem is decidable in polynomial time for deterministic weighted automata
Synthesis of Safe, Optimal and Compact Strategies for Stochastic Hybrid Games (Invited Paper)
Full text linkUPPAAL-Stratego is a recent branch of the verification tool UPPAAL allowing for synthesis of safe and optimal strategies for stochastic timed (hybrid) games. We describe newly developed learning methods, allowing for synthesis of significantly better strategies and with much improved convergence behaviour. Also, we describe novel use of decision trees for learning orders-of-magnitude more compact strategy representation. In both cases, the seek for optimality does not compromise safety
- …
