Results 31 to 40 of about 4,855,672 (239)
Learning Context-free Languages with Nondeterministic Stack RNNs [PDF]
Conference on Computational Natural Language Learning, 2020 We present a differentiable stack data structure that simultaneously and tractably encodes an exponential number of stack configurations, based on Lang’s algorithm for simulating nondeterministic pushdown automata.
Brian DuSell, David Chiang
semanticscholar +1 more source
Journal of Big Data, 2021 Distinguishing sequences are widely used in finite state machine-based conformance testing to solve the state identification problem. In this paper, we address the scalability issue encountered while deriving distinguishing sequences from complete ...
Bilal Elghadyry +3 more
doaj +1 more source
The μ-Calculus Model-Checking Algorithm for Generalized Possibilistic Decision Process
Applied Sciences, 2020 Model checking is a formal automatic verification technology for complex concurrent systems. It is used widely in the verification and analysis of computer software and hardware systems, communication protocols, security protocols, etc.
Jiulei Jiang, Panqing Zhang, Zhanyou Ma
doaj +1 more source
Fair Simulation for Nondeterministic and Probabilistic Buechi Automata: a Coalgebraic Perspective [PDF]
Logical Methods in Computer Science, 2017 Notions of simulation, among other uses, provide a computationally tractable and sound (but not necessarily complete) proof method for language inclusion.
Natsuki Urabe, Ichiro Hasuo
doaj +1 more source
Cost analysis of nondeterministic probabilistic programs [PDF]
ACM-SIGPLAN Symposium on Programming Language Design and Implementation, 2019 We consider the problem of expected cost analysis over nondeterministic probabilistic programs, which aims at automated methods for analyzing the resource-usage of such programs.
K. Chatterjee +5 more
semanticscholar +1 more source
Constant-Delay Enumeration for Nondeterministic Document Spanners [PDF]
International Conference on Database Theory, 2018 We consider the information extraction framework known as document spanners and study the problem of efficiently computing the results of the extraction from an input document, where the extraction task is described as a sequential variable-set automaton
Antoine Amarilli +3 more
semanticscholar +1 more source
Quasilinear-time Computation of Generic Modal Witnesses for Behavioural Inequivalence [PDF]
Logical Methods in Computer Science, 2022 We provide a generic algorithm for constructing formulae that distinguish behaviourally inequivalent states in systems of various transition types such as nondeterministic, probabilistic or weighted; genericity over the transition type is achieved by ...
Thorsten Wißmann +2 more
doaj +1 more source
A Two-Stage Multi-Objective Evolutionary Algorithm for Community Detection in Complex Networks
Mathematics, 2023 Community detection is a crucial research direction in the analysis of complex networks and has been shown to be an NP-hard problem (a problem that is at least as hard as the hardest problems in nondeterministic polynomial time).
Wenxin Zhu, Huan Li, Wenhong Wei
doaj +1 more source
Electronic Proceedings in Theoretical Computer Science, 2013 The paper explores properties of Łukasiewicz mu-calculus, a version of the quantitative/probabilistic modal mu-calculus containing both weak and strong conjunctions and disjunctions from Łukasiewicz (fuzzy) logic. We show that this logic encodes the well-
Matteo Mio, Alex Simpson
doaj +1 more source
A Local Logic for Realizability in Web Service Choreographies [PDF]
Electronic Proceedings in Theoretical Computer Science, 2014 Web service choreographies specify conditions on observable interactions among the services. An important question in this regard is realizability: given a choreography C, does there exist a set of service implementations I that conform to C ?
R Ramanujam, S Sheerazuddin
doaj +1 more source