A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2014; you can also visit the original URL.
The file type is application/pdf
.
Filters
Reachability Set Generation for Petri Nets: Can Brute Force Be Smart?
[chapter]
2004
Lecture Notes in Computer Science
+ 1 peak BDD size usually occurs well before reaching the final BDD for S, at step d Symbolic state-space generation of safe Petri nets [Pastor94] 11 We can store • any set of markings X ⊆ S = {0, 1} ...
,α ∈ {0, 1} |S k ×S k | for Petri nets, any partition of the places into K subsets will do! ...
consistent models 37 To model software we must be able to model assignments, e.g., with self-modifying Petri nets a:=a+b+2*c; a b c a+b+2c a t ...
doi:10.1007/978-3-540-27793-4_2
fatcat:qznlmzmyjvcane7jlr7pwdofue
Effective Domain-Specific Formal Verification Techniques
2020
Zenodo
We lift the expressive power of the algorithm by handling a generalized version of reachability and supporting Petri nets extended with inhibitor arcs. ...
Thesis 1 targets concurrent and asynchronous systems by modeling them with Petri nets and checking the reachability of a given state. ...
For this purpose, Wimmel and Wolf use a "brute force" method with some optimization [WW11] (e.g. stubborn sets [Sch99] ). ...
doi:10.5281/zenodo.3892347
fatcat:56hta7rkh5dinlehzrcfapumme
Formal analysis of ubiquitous computing environments through the APEX framework
2012
Proceedings of the 4th ACM SIGCHI symposium on Engineering interactive computing systems - EICS '12
The proposed technique uses APEX, a framework for rapid prototyping of ubiquitous environments based on Petri nets. The approach is illustrated through a smart library example. ...
These patterns help the analyst to generate and verify relevant properties. Where these properties fail then scenarios suggested by the failure provide an important aid to redesign. ...
The SS tool (part of CPN Tools) uses brute force to bind each variable to each of its possible known values, creating the reachability graph. ...
doi:10.1145/2305484.2305506
dblp:conf/eics/SilvaCH12
fatcat:2qpqiteainbkdl2ofoey7eue7m
Symbolic Termination and Confluence Checking for ECA Rules
[chapter]
2014
Lecture Notes in Computer Science
We propose an approach to analyze the dynamic behavior of a set of ECA rules, by first translating them into an extended Petri net, then studying two fundamental correctness properties: termination and ...
Event-condition-action (ECA) rules can specify decision processes and are widely used in reactive systems and active database systems. ...
Acknowledgment Work supported in part by UC-MEXUS under grant Verification of active rule bases using timed Petri nets and by the National Science Foundation under grant CCF-1442586. ...
doi:10.1007/978-3-662-45730-6_6
fatcat:b6oquzfaevflhbh4dtmkjbqgt4
Quantum Techniques for Stochastic Mechanics
[article]
2019
arXiv
pre-print
Computer science and population biology use the same ideas under a different name: "stochastic Petri nets". ...
We also study the overlap of quantum mechanics and stochastic mechanics, which involves Hamiltonians that can generate either unitary or stochastic time evolution. ...
On the blog you can read discussion of these articles, and also make your own comments or ask questions. ...
arXiv:1209.3632v5
fatcat:bdpnpttxbzd4ljxwp324h3cawq
Formal analysis techniques for gossiping protocols
2007
ACM SIGOPS Operating Systems Review
We present properties of interest for gossiping protocols and discuss how various formal evaluation techniques can be employed to predict them. ...
We give a survey of formal verification techniques that can be used to corroborate existing experimental results for gossiping protocols in a rigorous manner. ...
smart storage techniques or brute force distributed verification algorithms. ...
doi:10.1145/1317379.1317385
fatcat:ppg5garcsrbr3b7ugdijxvs3mu
Prototyping and analysing ubiquitous computing environments using multiple layers
2014
International Journal of Human-Computer Studies
If ubiquitous computing (ubicomp) is to enhance physical environments then early and accurate assessment of alternative solutions will be necessary to avoid costly deployment of systems that fail to meet ...
ASUR++ [42] , Interactive Cooperative Objects (ICO) [43] and Coloured Petri nets (CPN) [7] . ...
graph CPN Tools uses the State Space (SS) tool to bind each variable to each of the provided known values using brute force. ...
doi:10.1016/j.ijhcs.2014.02.001
fatcat:ynmq2hc7p5dpvo2ayg7eodujsy
Using Discrete Event Simulation to Model Attacker Interactions with Cyber and Physical Security Systems
2015
Procedia Computer Science
As the number of interfaces between systems continues to grow, the interactions and interdependencies between them cannot be ignored. ...
Key features of the proposed model include comprehensive data generation to support a variety of sophisticated analyses, and full parameterization of safeguard performance characteristics and attacker ...
This method uses the set of vulnerabilities and a reachability metric for the network to generate the set of attack graphs. ...
doi:10.1016/j.procs.2015.09.199
fatcat:5q4wgmi5ejb2tjn7marzxn2auy
A Survey of Architecture, Framework and Algorithms for Resource Management in Edge Computing
2020
EAI Endorsed Transactions on Energy Web
Managing the resources becomes a major challenge to be approached due to the diverse and rapidly evolving resources in comparison with the cloud. ...
d) Methods based on Petri Net Recent studies draw the attention of using the High-Level Petri Net (HLPN), called as RedEdge, for modelling the aggregation in Edge-oriented systems [73] . ...
Brute force approach: The entire feasible combinations of offloading plans (taking the cloud, edge nodes, and user devices) are analyzed [101] . ...
doi:10.4108/eai.23-12-2020.167788
fatcat:vcok5rac35gajhvgtxcclawuje
Encoding seasonal patterns using the Kasai algorithm
2017
Artificial intelligence research
In cases where the data series is known but the rules are not known, the Kasai algorithm can analyze the data pattern and produce the complete set of rules that described the data pattern observed to date ...
Data series that contain patterns are the expression of a set of rules that specify the pattern. ...
It supports comparison of data series using set operations and graph analysis techniques which can be more efficient and insightful than brute force comparisons. ...
doi:10.5430/air.v6n2p80
fatcat:44herjo525ferkwvcv57xm6ldq
Twenty years of rewriting logic
2012
The Journal of Logic and Algebraic Programming
Rewriting logic is a simple computational logic that can naturally express both concurrent computation and logical deduction with great generality. ...
the first papers were published, for their further encouragement to turn my WRLA lecture into a survey paper, and for their patience in allowing me the necessary time to finish it. ...
I thank the organizers of WRLA 2010 for giving me the opportunity and the stimulus to do some reflecting, surveying, and guessing about rewriting logic at this point, when twenty years have passed since ...
doi:10.1016/j.jlap.2012.06.003
fatcat:5tx4a5uxlvapfpf5fajozkbboi
Twenty Years of Rewriting Logic
[chapter]
2010
Lecture Notes in Computer Science
Rewriting logic is a simple computational logic that can naturally express both concurrent computation and logical deduction with great generality. ...
the first papers were published, for their further encouragement to turn my WRLA lecture into a survey paper, and for their patience in allowing me the necessary time to finish it. ...
I thank the organizers of WRLA 2010 for giving me the opportunity and the stimulus to do some reflecting, surveying, and guessing about rewriting logic at this point, when twenty years have passed since ...
doi:10.1007/978-3-642-16310-4_2
fatcat:ho7s76r67nc63bndpoptbh5k4e
An Overview of Formal Verification for the Time-Triggered Architecture
[chapter]
2002
Lecture Notes in Computer Science
We describe what has been done and what remains to be done and indicate some directions that seem promising for the remaining cases and for increasing the automation that can be applied. ...
We describe formal verification of some of the key algorithms in the Time-Triggered Architecture (TTA) for real-time safety-critical control applications. ...
Acknowledgments Günther Bauer of TU Vienna provided helpful comments and corrections for a previous version of this paper. ...
doi:10.1007/3-540-45739-9_7
fatcat:7l53ixpp4fa4topkufrp6hnahe
Multiprocessor Systems
[chapter]
2005
Introduction to Operating Systems
One trend is the increasing density and number of transistors that can be placed on a chip. ...
This thesis will present techniques and algorithms for developing such tools. Automated techniques are especially important for multiprocessor designs. ...
Joe Mait for their encouragement. ...
doi:10.1007/978-0-230-37408-9_9
fatcat:32xrcjodhjgddawaxtl5lrcxi4
Sponsoring institutions
2002
Physica A: Statistical Mechanics and its Applications
Cortelazzo, for the hand gesture recognition library for the RGB-D sensor. Towards smart robots: rock-paper-scissors gaming versus human players ...
At each turn, some facts representing the board state are coupled with the logic program, which has been conceived so that answer sets represent the moves: strong constraints "drop" any answer set representing ...
A further positive aspect, is that by avoiding a brute-force search approach in favour of a knowledge-based approach, not only changes are easy to implement and assess, but different styles can also be ...
doi:10.1016/s0378-4371(02)01572-8
fatcat:qcyfgqu3sfd45jncgigcqlzjc4
« Previous
Showing results 1 — 15 out of 54 results