Search results for "nondeterministic"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
28	Maurizio Damiani	The state reduction of nondeterministic finite-state machines.	IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.	1997	DBLP DOI BibTeX RDF
28	Timothy Kam, Tiziano Villa, Robert K. Brayton, Alberto L. Sangiovanni-Vincentelli	Theory and algorithms for state minimization of nondeterministic FSMs.	IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.	1997	DBLP DOI BibTeX RDF
28	Gábor Harangozó	Two Nondeterministic Event Building Methods derived from the Barrel Shifter.	Annual Simulation Symposium	1997	DBLP DOI BibTeX RDF
28	Michal Walicki, Sigurd Meldal	Generated Models and the omega-Rule: The Nondeterministic Case.	TAPSOFT	1995	DBLP DOI BibTeX RDF
28	Albert Zündorf, Andy Schürr	Nondeterministic Control Structures for Graph Rewriting Systems.	WG	1991	DBLP DOI BibTeX RDF
28	H. Venkateswaran	Circuit Definitions of Nondeterministic Complexity Classes.	FSTTCS	1988	DBLP DOI BibTeX RDF
28	Udi Manber, Martin Tompa	The Complexity of Problems on Probabilistic Nondeterministic, and Alternating Decision Trees	J. ACM	1985	DBLP DOI BibTeX RDF
28	Shigemasa Takai	Synthesis of Maximally Permissive Supervisors for Nondeterministic Discrete Event Systems With Nondeterministic Specifications.	IEEE Trans. Autom. Control.	2021	DBLP DOI BibTeX RDF
28	Bartek Klin, Slawomir Lasota 0001, Szymon Torunczyk	Nondeterministic and co-Nondeterministic Implies Deterministic, for Data Languages.	FoSSaCS	2021	DBLP DOI BibTeX RDF
28	Hiroki Morizumi	On the Power of Nondeterministic Circuits and Co-Nondeterministic Circuits.	LATA	2021	DBLP DOI BibTeX RDF
28	Shigemasa Takai	Bisimilarity enforcing supervisory control of nondeterministic discrete event systems with nondeterministic specifications.	Autom.	2019	DBLP DOI BibTeX RDF
28	Shigemasa Takai	Maximally Permissive Supervisory Control of Nondeterministic Discrete Event Systems with Nondeterministic Specifications.	CDC	2018	DBLP DOI BibTeX RDF
28	André Arnold, Igor Walukiewicz	Nondeterministic controllers of nondeterministic processes.	Logic and Automata	2008	DBLP BibTeX RDF
28	Takeo Yaku	Surjectivity of Nondeterministic Parallel Maps Induced by Nondeterministic Cellular Automata.	J. Comput. Syst. Sci.	1976	DBLP DOI BibTeX RDF
24	Jan Lunze	Fault Diagnosis of Discretely Controlled Continuous Systems by Means of Discrete-Event Models.	Discret. Event Dyn. Syst.	2008	DBLP DOI BibTeX RDF	Embedded map, Nondeterministic automaton, Fault diagnosis, Hybrid system, Completeness, Semi-Markov process, Timed automaton, Model abstraction
24	Kostadin Kratchanov, Emilia Golemanova, Tzanko Golemanov	Control Network Programming Illustrated: Solving Problems with Inherent Graph-Like Representation.	ACIS-ICIS	2008	DBLP DOI BibTeX RDF	Control network programming, Nondeterministic algorithms, Graph-like problem representation, Artificial Intelligence, Programming, Programming languages, Declarative programming, Programming paradigms
24	Glynn Winskel	Symmetry and Concurrency.	CALCO	2007	DBLP DOI BibTeX RDF	higher order processes, nondeterministic dataflow, higher dimensional automata, Petri nets, symmetry, unfolding, Event structures, spans, pseudo monads
24	Kimmo Fredriksson, Szymon Grabowski	Efficient Bit-Parallel Algorithms for (delta, alpha)-Matching.	WEA	2006	DBLP DOI BibTeX RDF	protein matching, music information retrieval, approximate string matching, bit-parallelism, nondeterministic finite automata
24	Giacomo Bucci, Andrea Fedeli, Luigi Sassoli, Enrico Vicario	Timed State Space Analysis of Real-Time Preemptive Systems.	IEEE Trans. Software Eng.	2004	DBLP DOI BibTeX RDF	nondeterministic time parameters, timeliness predictability, Preemptive Time Petri Nets, reactive systems, multiprocessor schedulability, Hard real-time systems, interprocess communication, preemptive scheduling, state space analysis
24	Yanlei Diao, Mehmet Altinel, Michael J. Franklin, Hao Zhang 0003, Peter M. Fischer 0001	Path sharing and predicate evaluation for high-performance XML filtering.	ACM Trans. Database Syst.	2003	DBLP DOI BibTeX RDF	Nondeterministic Finite Automaton, XML filtering, content-based matching, nested path expressions., path sharing, predicate evaluation, structure matching
24	Ernst-Erich Doberkat	Tracing Relations Probabilistically.	RelMiCS	2003	DBLP DOI BibTeX RDF	Probabilistic relations, specification techniques (nondeterministic, stochastic), representation theory
24	Jessica Chen	A study on static analysis in network of synchronizing FSMs.	APSEC	2000	DBLP DOI BibTeX RDF	synchronizing FSMs, multithreaded systems, nondeterministic behavior, Java monitors, Java, static analysis, finite state machines, synchronisation, operational semantics, multi-threading, labeled transition systems, thread synchronization, design artifacts
24	Jifeng He 0001, C. A. R. Hoare	Unifying theories of healthiness condition.	APSEC	2000	DBLP DOI BibTeX RDF	healthiness condition theory, programming notations, nondeterministic programming, probabilistic program, formal specifications, parallel programming, logic programming, programming languages, algebraic specification, programming theory, programming theory, Boolean algebra, Boolean algebra, sequential programming, design optimisation, algebraic laws
24	John H. Reif	Parallel Biomolecular Computation: Models and Simulations.	Algorithmica	1999	DBLP DOI BibTeX RDF	Parallel RAM, Nondeterministic computation, Recombinant DNA, Parallel computation, DNA, NP, Biomolecular computation, Biotechnology
24	Klaus Reinhardt, Eric Allender	Making Nondeterminism Unambiguous.	FOCS	1997	DBLP DOI BibTeX RDF	nonuniform complexity, nondeterministic logarithmic space bounded computation, computational complexity, nondeterminism, complexity classes, context-free languages
24	Chuang Lin 0002, Bo Li 0001, Jianping Wu	Modeling ATM traffic using stochastic Petri net.	ICCCN	1997	DBLP DOI BibTeX RDF	stochastic high level Petri net, stochastic events, ATM traffic control modeling, concurrent events, nondeterministic events, state space explosion problem, bursty traffic source, traffic rate control, token condensing, performance analysis, asynchronous transfer mode, ATM networks, multimedia traffic, asynchronous events, submodels, reduction method
24	Teik Guan Tan, Wynne Hsu	Scheduling multimedia applications under overload and non-deterministic conditions.	IEEE Real Time Technology and Applications Symposium	1997	DBLP DOI BibTeX RDF	nondeterministic conditions, overload conditions, deterministic techniques, hard real-time scheduling, representative task model, frequency parameter, worst case CPU bounds, best-effort frequency-based scheduling, real-time systems, multimedia applications
24	Naoshi Uchihira, Shinichi Honiden	Compositional adjustment of concurrent programs to satisfy temporal logic constraints in MENDELS ZONE.	HICSS (2)	1995	DBLP DOI BibTeX RDF	fifth generation systems, compositional adjustment, correct concurrent program development, temporal logic constraints, MENDELS ZONE, program adjustment, finite-state process, arbiter process, partial serialization, imperfect processes, harmful nondeterministic behaviors, large-scale compound target processes, process equivalence theory, Multi-PSI, MENDEL concurrent programming language, kernel language, KL1, parallel computer, temporal logic, programming environments, programming environment, program debugging, high-level Petri net, constraint handling, multiprocessing programs, formal approach
24	Teruo Higashino, Gregor von Bochmann	Automatic Analysis and Test Case Derivation for a Restricted Class of LOTOS Expressions with Data Parameters.	IEEE Trans. Software Eng.	1994	DBLP DOI BibTeX RDF	test case derivation, LOTOS expressions, data parameters, automatic analysis method, P-LOTOS expressions, Boolean types, integer linear programming problems, deadlock detection problem, nonexecutable branch detection, nondeterministic behavior detection, simplified Session protocol, formal specification, linear programming, concurrency control, integer programming, specification languages, specification language, comparison, decision procedure, data types, addition, test selection, Presburger arithmetic, subtraction, integer, data values
24	Shing-Chi Cheung, Jeff Kramer	Tractable Dataflow Analysis for Distributed Systems.	IEEE Trans. Software Eng.	1994	DBLP DOI BibTeX RDF	action dependency, history sets, pump control system, arbitrary loops, nondeterministic structures, synchronous communicating systems, distributed systems, software engineering, static analysis, distributed processing, program verification, reachability analysis, labeled transition systems, dataflow analysis, software development tools, distributed software engineering, worst-case complexity
24	Albert C. Chen, Chuan-lin Wu	A Parallel Execution Model of Logic Programs.	IEEE Trans. Parallel Distributed Syst.	1991	DBLP DOI BibTeX RDF	parallel execution model, nondeterministic logic program, frame inheritance, dynamic construction, computational complexity, computational complexity, logic programs, logic programming, modularity, communication channels, OR parallelism, AND parallelism, data-dependency graphs
24	Jaroslaw Milewski	Functional Data Structures as Updatable Objects.	IEEE Trans. Software Eng.	1990	DBLP DOI BibTeX RDF	continuous data copying, functional data structures, updatable objects, incremental structures, associated storage, shared structures, source program analysis, nondeterministic applications, parallel programming, data structures, functional programming, data dependencies, applicative programming, system programming
24	Gerald M. Karam, Raymond J. A. Buhr	Starvation and Critical Race Analyzers for Ada.	IEEE Trans. Software Eng.	1990	DBLP DOI BibTeX RDF	race analyzers, critical race analysis tools, Ada designs, temporal analysis toolset, operational specification language, language interpreter, deadlock analyzer, starvation analyzer, set-theoretic model, deadlock analyzer, computation space, preprocessing phase, starvation tool, semiautomatic proof, nondeterministic rendezvous, human operator, design examples, Ada, software tools, programming, specification languages, system recovery, liveness, program interpreters
24	E. Jane Cameron, David M. Cohen, B. Gopinath, William M. Keese II, Linda A. Ness, Prem Uppaluru, John R. Vollaro	The IC* Model of Parallel Computation and Programming Environment.	IEEE Trans. Software Eng.	1988	DBLP DOI BibTeX RDF	IC* project, structural constraints, explicit modeling, nondeterministic evolution, dynamic activation, distributed systems, design, parallel processing, parallel computation, parallel computer, protocols, specification, programming environment, programming environments, parallel machines, communication protocols, temporal constraints
24	Ludmila Cherkasova, Vadim E. Kotov	Descriptive and analytical process algebras.	European Workshop on Applications and Theory in Petri Nets	1988	DBLP DOI BibTeX RDF	concurrent nondeterministic processes, non-actions, occurrence nets, A-nets, M-density, Petri nets, denotational semantics, partially ordered sets, true concurrency
21	Luca Iocchi, Thomas Lukasiewicz, Daniele Nardi, Riccardo Rosati 0001	Reasoning about actions with sensing under qualitative and probabilistic uncertainty.	ACM Trans. Comput. Log.	2009	DBLP DOI BibTeX RDF	qualitative and probabilistic uncertainty, description logics, sensing, Reasoning about actions, imprecise probabilities, action languages
21	Galina Jirásková	Concatenation of Regular Languages and Descriptional Complexity.	CSR	2009	DBLP DOI BibTeX RDF
21	Scott Diehl, Dieter van Melkebeek, Ryan Williams 0001	An Improved Time-Space Lower Bound for Tautologies.	COCOON	2009	DBLP DOI BibTeX RDF
21	Yongming Li 0001	Fuzzy Turing Machines: Variants and Universality.	IEEE Trans. Fuzzy Syst.	2008	DBLP DOI BibTeX RDF
21	Marius Kloetzer, Calin Belta	Dealing with Nondeterminism in Symbolic Control.	HSCC	2008	DBLP DOI BibTeX RDF
21	Jean Goubault-Larrecq, Catuscia Palamidessi, Angelo Troina	A Probabilistic Applied Pi-Calculus.	APLAS	2007	DBLP DOI BibTeX RDF
21	Frantisek Mráz, Friedrich Otto, Martin Plátek	Hierarchical Relaxations of the Correctness Preserving Property for Restarting Automata.	MCU	2007	DBLP DOI BibTeX RDF
21	Nicolae Santean, Sheng Yu 0001	On Weakly Ambiguous Finite Transducers.	Developments in Language Theory	2006	DBLP DOI BibTeX RDF
21	Peter Bro Miltersen, N. V. Vinodchandran	Derandomizing Arthur-Merlin Games using Hitting Sets.	Comput. Complex.	2005	DBLP DOI BibTeX RDF	68Q17, Subject classification. 68Q15
21	Ronen Shaltiel, Christopher Umans	Simple extractors for all min-entropies and a new pseudorandom generator.	J. ACM	2005	DBLP DOI BibTeX RDF	Hardness versus randomness, pseudorandom generator, randomness extractor
21	Mohit Bhargava, Catuscia Palamidessi	Probabilistic Anonymity.	CONCUR	2005	DBLP DOI BibTeX RDF
21	Amir M. Ben-Amram, Omer Berkman, Holger Petersen 0001	Element distinctness on one-tape Turing machines: a complete solution.	Acta Informatica	2003	DBLP DOI BibTeX RDF
21	Marco Pistore, Moshe Y. Vardi	The Planning Spectrum - One, Two, Three, Infinity.	LICS	2003	DBLP DOI BibTeX RDF
21	Heribert Vollmer	Complexity Theory Made Easy.	Developments in Language Theory	2003	DBLP DOI BibTeX RDF
21	Andreas Malcher	Minimizing Finite Automata Is Computationally Hard.	Developments in Language Theory	2003	DBLP DOI BibTeX RDF
21	Markus Holzer 0001, Martin Kutrib	Flip-Pushdown Automata: Nondeterminism Is Better than Determinism.	Developments in Language Theory	2003	DBLP DOI BibTeX RDF
21	Martin Sauerhoff	Randomness versus Nondeterminism for Read-Once and Read- k Branching Programs.	STACS	2003	DBLP DOI BibTeX RDF
21	T. S. Jayram, Ravi Kumar 0001, D. Sivakumar 0001	Two applications of information complexity.	STOC	2003	DBLP DOI BibTeX RDF
21	Eric Allender, Michal Koucký 0001, Detlef Ronneburger, Sambuddha Roy	Derandomization and Distinguishing Complexity.	CCC	2003	DBLP DOI BibTeX RDF
21	Dieter Kranzlmüller, Martin Schulz 0001	Notes on Nondeterminism in Message Passing Programs.	PVM/MPI	2002	DBLP DOI BibTeX RDF
21	Yuji Sasaki, Katsushi Inoue, Akira Ito, Yue Wang 0002	A Space Lower Bound of Two-Dimensional Probabilistic Turing Machines.	Developments in Language Theory	2002	DBLP DOI BibTeX RDF
21	Carsten Fritz, Thomas Wilke	State Space Reductions for Alternating Büchi Automata.	FSTTCS	2002	DBLP DOI BibTeX RDF
21	Enrico Pontelli, Gopal Gupta 0001	Backtracking in Independent And-Parallel Implementations of Logic Programming Languages.	IEEE Trans. Parallel Distributed Syst.	2001	DBLP DOI BibTeX RDF	logic programming, Backtracking, and-parallelism
21	Lynette van Zijl	Supernondeterministic Finite Automata.	CIAA	2001	DBLP DOI BibTeX RDF
21	Jules Desharnais, Bernhard Möller, Fairouz Tchier	Kleene under a Demonic Star.	AMAST	2000	DBLP DOI BibTeX RDF
21	Michael W. Mislove	Nondeterminism and Probabilistic Choice: Obeying the Laws.	CONCUR	2000	DBLP DOI BibTeX RDF
21	Russell Harmer, Guy McCusker	A Fully Abstract Game Semantics for Finite Nondeterminism.	LICS	1999	DBLP DOI BibTeX RDF
21	Carsten Damm, Ki Hang Kim, Fred W. Roush	On Covering and Rank Problems for Boolean Matrices and Their Applications.	COCOON	1999	DBLP DOI BibTeX RDF
21	Ian Glaister, Jeffrey O. Shallit	Automaticity III: Polynomial Automaticity and Context-Free Languages.	Comput. Complex.	1998	DBLP DOI BibTeX RDF	finite automata, nondeterminism, Automaticity
21	Dieter Kranzlmüller, Jens Volkert	Debugging Point-to-Point Communication in MPI an PVM.	PVM/MPI	1998	DBLP DOI BibTeX RDF
21	Glynn Winskel	A Linear Metalanguage for Concurrency.	AMAST	1998	DBLP DOI BibTeX RDF
21	Holger Petersen 0001	The Head Hierarchy for Oblivious Finite Automata with Polynomial Advice Collapses.	MFCS	1998	DBLP DOI BibTeX RDF
21	David A. Rosenblueth	An Exhaustive-Search Method Using Layered Streams Obtained Through a Meta-Interpreter for Chain Programs.	LOPSTR	1998	DBLP DOI BibTeX RDF
21	Christel Baier, Holger Hermanns	Weak Bisimulation for Fully Probabilistic Processes.	CAV	1997	DBLP DOI BibTeX RDF
21	Ian Glaister, Jeffrey O. Shallit	Polynomial Automaticity, Context-Free Languages, and Fixed Points of Morphism (Extended Abstract).	MFCS	1996	DBLP DOI BibTeX RDF
21	Gopal Gupta 0001, Bharat Jayaraman	Analysis of Or-Parallel Execution Models.	ACM Trans. Program. Lang. Syst.	1993	DBLP DOI BibTeX RDF	Or-parallel execution models
21	Viliam Geffert	Speed-Up Theorem Without Tape Compression.	MFCS	1990	DBLP DOI BibTeX RDF
21	Asis K. Goswami, Lalit M. Patnaik	Functional Programming System Revisited.	FSTTCS	1984	DBLP DOI BibTeX RDF
21	Stephen D. Brookes, William C. Rounds	Behavioural Equivalence Relations Induced by Programming Logics.	ICALP	1983	DBLP DOI BibTeX RDF
21	David Harel, Vaughan R. Pratt	Nondeterminism in Logics of Programs.	POPL	1978	DBLP DOI BibTeX RDF
21	Detlef Wotschke	A characterization of boolean closures of families of languages.	Automatentheorie und Formale Sprachen	1973	DBLP DOI BibTeX RDF
21	Seymour Ginsburg, Sheila A. Greibach, Michael A. Harrison	Stack automata and compiling.	J. ACM	1967	DBLP DOI BibTeX RDF
21	Kazunori Ueda, Takayuki Ayano, Taisuke Hori, Hiroki Iwasawa, Seiji Ogawa	Hierarchical Graph Rewriting as a Unifying Tool for Analyzing and Understanding Nondeterministic Systems.	ICTAC	2009	DBLP DOI BibTeX RDF
21	Geert Jan Bex, Wouter Gelade, Wim Martens, Frank Neven	Simplifying XML schema: effortless handling of nondeterministic regular expressions.	SIGMOD Conference	2009	DBLP DOI BibTeX RDF	deterministic regular expressions, upa, xml schema
21	Mikhail N. Vyalyi	On Models of a Nondeterministic Computation.	CSR	2009	DBLP DOI BibTeX RDF	language, nondeterminism, automaton, complexity class
21	Alessandro Aldini, Marco Bernardo 0001	A General Framework for Nondeterministic, Probabilistic, and Stochastic Noninterference.	ARSPA-WITS	2009	DBLP DOI BibTeX RDF
21	Pedro García 0001, Manuel Vazquez de Parga, Gloria Inés Alvarez, José Ruiz 0001	Learning Regular Languages Using Nondeterministic Finite Automata.	CIAA	2008	DBLP DOI BibTeX RDF
21	Ahmed Bouajjani, Peter Habermehl, Lukás Holík, Tayssir Touili, Tomás Vojnar	Antichain-Based Universality and Inclusion Testing over Nondeterministic Finite Tree Automata.	CIAA	2008	DBLP DOI BibTeX RDF
21	Thiago R. Dória, Angelo E. M. Ciarlini, Alexandre A. Andreatta	A nondeterministic model for controlling the dramatization of interactive stories.	SRMC	2008	DBLP DOI BibTeX RDF	model checking, planning, interactive storytelling, digital entertainment
21	Alex Groce, Rajeev Joshi	Random testing and model checking: building a common framework for nondeterministic exploration.	WODA	2008	DBLP DOI BibTeX RDF	model checking, dynamic analysis, random testing, test frameworks
21	Matei David, Toniann Pitassi, Emanuele Viola	Improved Separations between Nondeterministic and Randomized Multiparty Communication.	APPROX-RANDOM	2008	DBLP DOI BibTeX RDF
21	Peter James Leadbitter, Dan Page, Nigel P. Smart	Nondeterministic Multithreading.	IEEE Trans. Computers	2007	DBLP DOI BibTeX RDF	Side-channel analysis, multithreaded processors
21	Paul Beame, Matei David, Toniann Pitassi, Philipp Woelfel	Separating Deterministic from Nondeterministic NOF Multiparty Communication Complexity.	ICALP	2007	DBLP DOI BibTeX RDF
21	Kai Salomaa	Descriptional Complexity of Nondeterministic Finite Automata.	Developments in Language Theory	2007	DBLP DOI BibTeX RDF
21	Jozef Jirásek 0001, Galina Jirásková, Alexander Szabari	Deterministic Blow-Ups of Minimal Nondeterministic Finite Automata over a Fixed Alphabet.	Developments in Language Theory	2007	DBLP DOI BibTeX RDF
21	Alan Mishchenko, Robert K. Brayton	A theory of nondeterministic networks.	IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.	2006	DBLP DOI BibTeX RDF
21	Nir Piterman	From Nondeterministic Buchi and Streett Automata to Deterministic Parity Automata.	LICS	2006	DBLP DOI BibTeX RDF
21	Chuang Lin 0002, Zhiguang Shan, Ting Liu, Yang Qu, Fengyuan Ren	Modeling and Inference of Extended Interval Temporal Logic for Nondeterministic Intervals.	IEEE Trans. Syst. Man Cybern. Part A	2005	DBLP DOI BibTeX RDF
21	Daniela Berardi, Diego Calvanese, Giuseppe De Giacomo, Massimo Mecella	Composition of Services with Nondeterministic Observable Behavior.	ICSOC	2005	DBLP DOI BibTeX RDF
21	Ian M. Mitchell, Jeremy A. Templeton	A Toolbox of Hamilton-Jacobi Solvers for Analysis of Nondeterministic Continuous and Hybrid Systems.	HSCC	2005	DBLP DOI BibTeX RDF
21	Alexandre Petrenko, Nina Yevtushenko 0001	Conformance Tests as Checking Experiments for Partial Nondeterministic FSM.	FATES	2005	DBLP DOI BibTeX RDF
21	Orna Kupferman, Moshe Y. Vardi	Complementation Constructions for Nondeterministic Automata on Infinite Words.	TACAS	2005	DBLP DOI BibTeX RDF
21	Robert M. Hierons	Testing from a Nondeterministic Finite State Machine Using Adaptive State Counting.	IEEE Trans. Computers	2004	DBLP DOI BibTeX RDF
21	Gwan-Hwan Hwang, Sheng-Jen Chang, Huey-Der Chu	Technology for Testing Nondeterministic Client/Server Database Applications.	IEEE Trans. Software Eng.	2004	DBLP DOI BibTeX RDF	database management system, Concurrent programming, client/server, reachability testing
21	Augusto Parma, Roberto Segala	Axiomatization of Trace Semantics for Stochastic Nondeterministic Processes.	QEST	2004	DBLP DOI BibTeX RDF