Filters








580,862 Hits in 6.0 sec

On the Power of Labels in Transition Systems [chapter]

Jiří Srba
2001 Lecture Notes in Computer Science  
In this paper we discuss the role of labels in transition systems with regard to bisimilarity and model checking problems.  ...  We suggest a general reduction from labelled transition systems to unlabelled ones, preserving bisimilarity and satisfiability of µ-calculus formulas.  ...  Equivalence and model checking problems can be defined purely in terms of these transition systems. In the first part of the paper we discuss the role of labels of such transition systems.  ... 
doi:10.1007/3-540-44685-0_19 fatcat:vz2pettxn5huvn65e7fm3kjpfe

On the Power of Labels in Transition Systems

Jirí Srba
2001 BRICS Report Series  
In this paper we discuss the role of labels in transition systems with regard to bisimilarity and model checking problems.  ...  We suggest a general reduction from labelled transition systems to unlabelled ones, preserving bisimilarity and satisfiability of mu-calculus formulas.  ...  They can be defined independently on the computational model by means of labelled transition systems.  ... 
doi:10.7146/brics.v8i19.21680 fatcat:ykjmghjefbc5tfsz64z7qkdibq

Preliminary results for an adaptive pattern recognition system for novel users using a powered lower limb prosthesis

John A. Spanias, Ann M. Simon, Eric J. Perreault, Levi J. Hargrove
2016 2016 38th Annual International Conference of the IEEE Engineering in Medicine and Biology Society (EMBC)  
Powered prosthetic legs are capable of improving the gait of lower limb amputees.  ...  Pattern recognition systems for these devices allow amputees to transition between different locomotion modes in a way that is seamless and transparent to the user.  ...  14-C-0105, and the National Institute of Health NIH R01 HD079428-02.  ... 
doi:10.1109/embc.2016.7591870 pmid:28269411 pmcid:PMC5653222 fatcat:cmpjoeo4rjddfbz6mfvp3rlmym

"Spectral implementation" for creating a labeled pseudo-pure state and the Bernstein–Vazirani algorithm in a four-qubit nuclear magnetic resonance quantum processor

Xinhua Peng, Xiwen Zhu, Ximing Fang, Mang Feng, Maili Liu, Kelin Gao
2004 Journal of Chemical Physics  
Meanwhile, we theoretically analyze and numerically inverstigate the low-power selective single-pulse implementation of a controlled-rotation gate, which manifests its validity in our experiment.  ...  A quantum circuit is introducted to describe the preparation of a labeled pseudo-pure state by mutiplet-component excitation scheme which has been experimentally implemented on a 4-qubit nuclear magnetic  ...  In addition, in the preparation procedure of the labeled PPS, the transition-selective excitation is applied on such an initial state .  ... 
doi:10.1063/1.1642579 pmid:15268519 fatcat:awsxqnniq5ctvayscfdyfxhcii

A C-to-RTL Flow as an Energy Efficient Alternative to Embedded Processors in Digital Systems

Sameer D. Sahasrabuddhe, Sreenivas Subramanian, Kunal P. Ghosh, Kavi Arya, Madhav P. Desai
2010 2010 13th Euromicro Conference on Digital System Design: Architectures, Methods and Tools  
C-to-RTL flow offers an energy efficient alternative to the use of embedded processors in mapping algorithms to digital VLSI systems.  ...  We observe that the energy consumption (per completed task) of each resulting circuit is considerably lower than that of an equivalent executable running on a low-power processor, indicating that this  ...  Each path reaching a node u from the root of the LRG represents one label sequence in the label l(u). The following result is proved in [3] .  ... 
doi:10.1109/dsd.2010.52 dblp:conf/dsd/SahasrabuddheSGAD10 fatcat:4evg7nu2pfhyhgixzel45ghzue

Generalizing finiteness conditions of labelled transition systems [chapter]

Franck Breugel
1994 Lecture Notes in Computer Science  
In this way, a so-called metric labelled transition system is obtained.  ...  These results are generalized for metric labelled transition systems satisfying one of the generalized niteness conditions.  ...  Acknowledgements The author would like to thank the members of the Amsterdam Concurrency Group including Jaco de Bakker, Frank de Boer, Marcello Bonsangue, Arie de Bruin, Jean-Marie Jacquet, Joost Kok,  ... 
doi:10.1007/3-540-58201-0_83 fatcat:2ten3vsjljaklke3vyuxfgzsb4

Data Driven Modelling of Nuclear Power Plant Performance Data as Finite State Machines

Kshirasagar Naik, Mahesh D. Pandey, Anannya Panda, Abdurhman Albasir, Kunal Taneja
2021 Modelling  
Accurate modelling and simulation of a nuclear power plant are important factors in the strategic planning and maintenance of the plant.  ...  Finite state machine representation formulated from the clustered data is then used to model the behaviour of cyberphysical systems using system states and state transitions.  ...  Transitions between the cluster labels of consecutive data instances are defined in terms of state transitions.  ... 
doi:10.3390/modelling2010003 fatcat:p5azd57ajrcppehmlxl56u3efq

Petri Nets

James L. Peterson
1977 ACM Computing Surveys  
Over the last decade, the Petri net has gamed increased usage and acceptance as a basic model of systems of asynchronous concurrent computation.  ...  of the reachability tree and the decidability and complexity of some Petri net problems.  ...  differences in the modeling power of the various models of concurrent systems.  ... 
doi:10.1145/356698.356702 fatcat:lwm23atcgzf3blxj2xvfqdvnjm

On the Discriminating Power of Testing Equivalences for Reactive Probabilistic Systems: Results and Open Problems [chapter]

Marco Bernardo, Davide Sangiorgi, Valeria Vignudelli
2014 Lecture Notes in Computer Science  
In Sect. 4, we define the three variants of ∼ PTe-. In Sect. 5, we place the three variants in the RPLTS spectrum and relate their respective discriminating powers.  ...  The second one refers to the discriminating power of ∼ PTe-under NPLTS tests; although no copying capability is admitted, we conjecture that the same identification power as the probabilistic bisimilarity  ...  Acknowledgment: We are grateful to the anonymous referees for their useful comments. This work is supported by MIUR-PRIN project CINA and ANR project 12IS02001 PACE.  ... 
doi:10.1007/978-3-319-10696-0_23 fatcat:yntbre7sbzc2biyphkk2ps4uwm

An automatic and user-driven training method for locomotion mode recognition for artificial leg control

Xiaorong Zhang, Ding Wang, Qing Yang, He Huang
2012 2012 Annual International Conference of the IEEE Engineering in Medicine and Biology Society  
These two streams of information are used to automatically identify the transitions among various locomotion modes, switch the prosthesis control mode, and label the training data with movement class and  ...  The novel design paves the way for clinical use of our designed LMR system for powered lower limb prosthesis control.  ...  Acknowledgments The authors thank Lin Du, Quan Ding, and Fan Zhang at the University of Rhode Island, for their suggestion and assistance in this study.  ... 
doi:10.1109/embc.2012.6347389 pmid:23367324 pmcid:PMC3676647 fatcat:glcnbfafi5ftrdyr2bvaotlggm

Nevertrace Claims for Model Checking [chapter]

Zhe Chen, Gilles Motet
2010 Lecture Notes in Computer Science  
The major contributions of the nevertrace claim include: a powerful construct for formalizing properties related to transitions and their labels, and a way for reducing the state space in design stage.  ...  In this paper, we propose the nevertrace claim, which is a new construct for specifying the correctness properties that either finite or infinite execution traces (i.e., sequences of transitions) that  ...  In other words, if one of the transitions labeled x_inc is executed, then one of the transitions that have a label starting with x_dec will be executed in the future.  ... 
doi:10.1007/978-3-642-16164-3_12 fatcat:okfjlfeysfhzvbroxyv4b7mgsy

A Coalgebraic presentation of structured transition systems

Andrea Corradini, Martin Große-Rhode, Reiko Heckel
2001 Theoretical Computer Science  
This paper relates labelled transition systems and coalgebras with the motivation of comparing and combining their complementary contributions to the theory of concurrent systems.  ...  The resulting category of lax coalgebras and lax cohomomorphisms for a suitable endofunctor is shown to be isomorphic to the category of structured transition systems, where both states and transitions  ...  Acknowledgements The authors are indebted to Ugo Montanari for inspiring discussions on the subject of coalgebras and dynamic bisimulation.  ... 
doi:10.1016/s0304-3975(00)00121-3 fatcat:rwkdy7yfo5ehngpormcnbr53sa

Generalising Automaticity to Modal Properties of Finite Structures [chapter]

A. Dawar, S. Kreutzer
2002 Lecture Notes in Computer Science  
The function that takes Ò to the size of the smallest labelling system doing this is called the labelling index of the property.  ...  We introduce a complexity measure of modal properties of finite structures which generalises the automaticity of languages. It is based on graph-automata like devices called labelling systems.  ...  Formulae ³ ¾ ÅÄ are always evaluated at a particular node in a transition system. We write Ã Ú ³ if ³ holds at the node Ú in the transition system Ã.  ... 
doi:10.1007/3-540-36206-1_11 fatcat:tgw2ps565rditmiphtx7uxomta

Modeling and Analysis of Power-Aware Systems [chapter]

Oleg Sokolsky, Anna Philippou, Insup Lee, Kyriakos Christou
2003 Lecture Notes in Computer Science  
The proposed extension allows the modeling of probabilistic resource failures, priorities of resource usages, and power consumption by resources within the same formalism.  ...  The framework is based on process algebra, a formalism that has been developed to describe and analyze communicating concurrent systems.  ...  Thus the semantics is given in terms of a labeled transition system whose states are configurations and whose transitions are either probabilistic or nondeterministic.  ... 
doi:10.1007/3-540-36577-x_29 fatcat:isibreypv5hi7cw2u6xnejaenq

From Transitions to Executions [chapter]

Eleftherios Matsikoudis, Edward A. Lee
2012 Lecture Notes in Computer Science  
of equivalence of branching structure that one has for these systems, and examine their relationship with labelled transition systems, precisely characterizing the difference in expressive power and branching  ...  This is generally attributed to the expansion law of such theories, but in truth, the problem is rooted in the concept of labelled transition system.  ...  Acknowledgement: We would like to thank the anonymous referees for their help in improving the presentation of this work.  ... 
doi:10.1007/978-3-642-32784-1_10 fatcat:or7gyyk6zvaaxokj4g3cztvkvm
« Previous Showing results 1 — 15 out of 580,862 results