Filters








1,442 Hits in 6.0 sec

Computational Issues in Intelligent Control: Discrete-Event and Hybrid Systems [chapter]

XENOFON D. KOUTSOUKOS, PANOS J. ANTSAKLIS
2000 Soft Computing and Intelligent Systems  
Petri net models are used to describe discrete event and hybrid systems. Computational issues of various problems and algorithms concerning the analysis and synthesis of such systems are discussed.  ...  In view of hybrid systems, we also review basic computational issues for hybrid automata.  ...  Nikos Chrisochoides of the Computer Science and Engineering Department at the University of Notre Dame for his valuable assistance concerning the parallel computing architecture.  ... 
doi:10.1016/b978-012646490-0/50006-8 fatcat:tpqu57oywrhwtfcrvohzhr3trq

Bounded saturation-based CTL model checking

A Vörös, D Darvas, T Bartha
2013 Proceedings of the Estonian Academy of Sciences  
Recent advances have resulted in many new kinds of saturation-based algorithms for state space generation and bounded state space generation and also for structural model checking.  ...  Saturation is a symbolic algorithm with a special iteration strategy, which is efficient for asynchronous models.  ...  Gianfranco Ciardo for his valuable advice and suggestions.  ... 
doi:10.3176/proc.2013.1.07 fatcat:3wagp3wumbhdfed2zpableshye

Formal Verification of Robotics Navigation Algorithms

Vasileios Germanos, Emanuele Lindo Secco
2016 2016 IEEE Intl Conference on Computational Science and Engineering (CSE) and IEEE Intl Conference on Embedded and Ubiquitous Computing (EUC) and 15th Intl Symposium on Distributed Computing and Applications for Business Engineering (DCABES)  
This study can help organizations to reduce the errors of their systems, increase the safety of their systems, make their systems more efficient, and reduce the cost of the organizations.  ...  These algorithms are inspired from insects and are comparable to the motion of ants, which yields motion strategies for the robot that guarantees the elusive target will be detected, if such strategies  ...  In this section, we briefly recall two classes of Petri nets used in our discussion, the Place/Transition nets and the colour Petri nets (see [15] and [8] for more details). A.  ... 
doi:10.1109/cse-euc-dcabes.2016.181 dblp:conf/cse/GermanosS16 fatcat:26ddqrbgdbdnjhpdu6wmknq7ge

Deriving Petri nets from finite transition systems

J. Cortadella, M. Kishinevsky, L. Lavagno, A. Yakovlev
1998 IEEE transactions on computers  
Previous work has shown that, for any ETS, there exists a Petri Net with minimum transition count (one transition for each label) with a reachability graph isomorphic to the original Transition System.  ...  This paper presents a novel method to derive a Petri Net from any specification model that can be mapped into a statebased representation with arcs labeled with symbols from an alphabet of events (a Transition  ...  The theory in this paper has been implemented in petrify, a tool for the synthesis of Petri Nets and asynchronous circuits (available at http://www.lsi.upc.es/~jordic/petrify).  ... 
doi:10.1109/12.707587 fatcat:cini6yxfufbfbiweqna5j6mmwy

Factored Planning: From Automata to Petri Nets

Loig Jezequel, Eric Fabre, Victor Khomenko
2013 2013 13th International Conference on Application of Concurrency to System Design  
This allows one to use cheap structural operations like transition contractions to reduce the size of the Petri net, before its state space is generated, which often leads to substantial savings compared  ...  In this paper we change the representation of components to safe Petri nets.  ...  A labelled Petri net is a tuple (P, T, F, M 0 , Λ, λ) where (P, T, F, M 0 ) is a Petri net, Λ is an alphabet, and λ : T → Λ ∪ {ε} is a labelling function associating a label from Λ ∪ {ε} to each transition  ... 
doi:10.1109/acsd.2013.16 dblp:conf/acsd/JezequelFK13 fatcat:dlgbq2x7ung7hjsr2ewoa7s4g4

Assessing State Spaces Using Petri-Net Synthesis and Attribute-Based Visualization [chapter]

H. M. W. Verbeek, A. Johannes Pretorius, Wil M. P. van der Aalst, Jarke J. van Wijk
2008 Lecture Notes in Computer Science  
Using Petri-net synthesis we generate the attributes needed for attribute-based visualization. Using visualization we can assess the state space.  ...  State spaces are commonly used representations of system behavior. A state space may be derived from a model of system behavior but can also be obtained through process mining.  ...  Acknowledgments We are grateful to Jordi Cortadella for his kind support on issues related to the Petrify tool. Furthermore, we thank the anonymous reviewers for helping to improve the paper.  ... 
doi:10.1007/978-3-540-89287-8_10 fatcat:wcpwioggprft7cqpbofjx3rxjy

A Fully Symbolic Bisimulation Algorithm [chapter]

Malcolm Mumme, Gianfranco Ciardo
2011 Lecture Notes in Computer Science  
We conclude that it may be possible to solve the bisimulation problem for systems having only visible deterministic transitions (e.g., Petri nets where each transition has a distinct label) even if the  ...  As the number of equivalence classes increases, our algorithm tends to have improved time and space consumption compared with the algorithm of Wimmer et al., while, for some models with fixed numbers of  ...  Our algorithm handles the special case where each of these transition relations is a partial function, as is the case with Petri nets with unique transition labels.  ... 
doi:10.1007/978-3-642-24288-5_19 fatcat:ct73r3ke6jdp7lwl5b62wnagru

Towards an Efficient Algorithm for Unfolding Petri Nets [chapter]

Victor Khomenko, Maciej Koutny
2001 Lecture Notes in Computer Science  
In this paper, we propose several improvements to the existing algorithms for generating finite complete prefixes of net unfoldings.  ...  Experimental results demonstrate that one can achieve significant speedups when transition presets of a net being unfolded have overlapping parts.  ...  Bystrov for his suggestion to consider dual-rail logics circuits and help with modelling priority arbiters. We would also like to thank J. Esparza, K.  ... 
doi:10.1007/3-540-44685-0_25 fatcat:uwvsa6qwnzdqzahrj533mwzhhq

Diagnosis of asynchronous discrete-event systems: a net unfolding approach

A. Benveniste, E. Fabre, S. Haar, C. Jard
2003 IEEE Transactions on Automatic Control  
Our basic mathematical tool is that of net unfoldings originating from the Petri net research area.  ...  In this paper we formulate asynchronous diagnosis by means of hidden state history reconstruction, from alarm observations.  ...  For two nets P 1 and P 2 , p i (resp. t i ) denotes generically a place (resp. transition) of net P i , and the labeling map is denoted by λ i .  ... 
doi:10.1109/tac.2003.811249 fatcat:hhmuwrxmszelppjhaufwjxlfyu

Characterization of Reachable Attractors Using Petri Net Unfoldings [chapter]

Thomas Chatain, Stefan Haar, Loïg Jezequel, Loïc Paulevé, Stefan Schwoon
2014 Lecture Notes in Computer Science  
The algorithm relies on Petri net unfoldings that can be used to compute a compact representation of the dynamics.  ...  The proposed approach aims at being complementary to existing methods for deriving the attractors of Boolean models, while being generic since it applies to any safe Petri net.  ...  Discussion We presented a new algorithm for computing all the attractors reachable from a given state in the general class of safe Petri nets, i.e., Petri nets having at most one token in each place.  ... 
doi:10.1007/978-3-319-12982-2_10 fatcat:upv2veygs5eodfl43nwi4jgqai

Component-based synthesis for complex APIs

Yu Feng, Ruben Martins, Yuepeng Wang, Isil Dillig, Thomas W. Reps
2017 SIGPLAN notices  
The key novelty of our approach is the use of a compact Petri-net representation to model relationships between methods in an API.  ...  In this paper, we present a novel type-directed algorithm for component-based synthesis.  ...  Acknowledgments We thank Thomas Dillig, Navid Yaghmazadeh, Arati Kaushik, Osbert Bastani, Zhao Song and David Melski for their insightful comments.  ... 
doi:10.1145/3093333.3009851 fatcat:kezp55zfhvgzfmelo36fsahupe

Component-based synthesis for complex APIs

Yu Feng, Ruben Martins, Yuepeng Wang, Isil Dillig, Thomas W. Reps
2017 Proceedings of the 44th ACM SIGPLAN Symposium on Principles of Programming Languages - POPL 2017  
The key novelty of our approach is the use of a compact Petri-net representation to model relationships between methods in an API.  ...  In this paper, we present a novel type-directed algorithm for component-based synthesis.  ...  Acknowledgments We thank Thomas Dillig, Navid Yaghmazadeh, Arati Kaushik, Osbert Bastani, Zhao Song and David Melski for their insightful comments.  ... 
doi:10.1145/3009837.3009851 fatcat:h5t5u6fhejfprf3soxqknu4vga

Discovering Petri Nets from Event Logs [chapter]

Wil M. P. van der Aalst, Boudewijn F. van Dongen
2013 Lecture Notes in Computer Science  
The goal is to introduce several approaches to discover Petri nets from event data (notably the α-algorithm, state-based regions, and language-based regions).  ...  ., extracting a process model from an event log. We focus on Petri nets as a representation language, because of the concurrent and unstructured nature of real-life processes.  ...  Thus, the main idea of the synthesis algorithm is the following: for each event e in the transition system, a transition labeled with e is generated in the Petri net.  ... 
doi:10.1007/978-3-642-38143-0_10 fatcat:mdpeun735naizjky56ih6gsvwi

Markov nets: probabilistic models for distributed and concurrent systems

A. Benveniste, E. Fabre, S. Haar
2003 IEEE Transactions on Automatic Control  
Our basic mathematical tool is that of Petri net unfoldings.  ...  In this paper, motivated by the monitoring of distributed systems and in particular of telecommunications networks, we develop a generalization of Markov chains and hidden Markov models (Hmm) for distributed  ...  Acknowledgement The authors wish to thank Samy Abbes for pointing out mistakes in a draft version of this article.  ... 
doi:10.1109/tac.2003.819076 fatcat:bmtcgmj2tbdhxbfwtthq4vbwiq

An Alternative Way to Analyze Workflow Graphs [chapter]

W. M. P. van der Aalst, A. Hirnschall, H. M. W. Verbeek
2002 Lecture Notes in Computer Science  
The algorithm translates workflow graphs into so-called WF-nets. WF-nets are a class of Petri nets tailored towards workflow analysis.  ...  As a result, Petri-net theory and tools can be used to verify workflow graphs. In particular, our workflow verification tool Woflan [21] can be used to detect design errors.  ...  Corollary 1 shows that, for free-choice nets, there are efficient algorithms to decide soundness.  ... 
doi:10.1007/3-540-47961-9_37 fatcat:zsiypz3m55hprcbfyu4a5wvlcy
« Previous Showing results 1 — 15 out of 1,442 results