Search results for "preorder"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
133	Jun Liu 0002, Lu Jiang 0001, Zhaohui Wu 0003, Qinghua Zheng, Ya-nan Qian	Mining preorder relation between knowledge units from text.	SAC	2010	DBLP DOI BibTeX RDF	knowledge unit, preorder relation, locality, text
112	V. Natarajan 0001, Rance Cleaveland	Predictability of real-time systems: a process-algebraic approach.	RTSS	1996	DBLP DOI BibTeX RDF	real time systems predictability, testing-based semantic preorder, process description language, TPL, activity-completion times, semantic preorder, must-preorder, optimality, process algebra, process algebra, variability, timing behavior
84	Flavio Corradini, Roberto Gorrieri, Marco Roccetti	Performance Preorder: Ordering Processes with Respect to Speed.	MFCS	1995	DBLP DOI BibTeX RDF
84	Lucia Pomello, Carla Simone	A state transformation preorder over a class of EN systems.	Applications and Theory of Petri Nets	1989	DBLP DOI BibTeX RDF	behaviour of systems, observability of states, equivalence, morphisms
73	Gerald Lüttgen, Walter Vogler	Bisimulation on Speed: Lower Time Bounds.	FoSSaCS	2004	DBLP DOI BibTeX RDF
72	Flavio Corradini, Roberto Gorrieri, Marco Roccetti	Performance Preorder and Competitive Equivalence.	Acta Informatica	1997	DBLP DOI BibTeX RDF
60	Gerald Lüttgen, Walter Vogler	Bisimulation on Speed: A Unified Approach.	FoSSaCS	2005	DBLP DOI BibTeX RDF
60	Diego Latella, Mieke Massink	On testing and conformance relations for UML statechart diagrams behaviours.	ISSTA	2002	DBLP DOI BibTeX RDF	UML statechart diagrams, formal testing theory, conformance testing, formal semantics, testing theory
60	Luca Aceto	On Relating Concurency and Nondeterminism.	MFPS	1991	DBLP DOI BibTeX RDF
60	Guangming Xing, Dongli Zhang	Refined Extended Preorder Index with Path Information.	ITCC (1)	2004	DBLP DOI BibTeX RDF
60	Ferucio Laurentiu Tiplea, Aurora Tiplea	A Simulation Preorder for Abstraction of Reactive Systems.	VMCAI	2002	DBLP DOI BibTeX RDF
60	Rance Cleaveland, Bernhard Steffen	A Preorder for Partial Process Specifications.	CONCUR	1990	DBLP DOI BibTeX RDF
49	Ghassan Chehaibar	Replacement of Open Interface Subnets and Stable State Transformation Equivalence.	Applications and Theory of Petri Nets	1991	DBLP DOI BibTeX RDF	Place-Transition Nets, Hierarchical Design and Analysis, Open Interface, Nets and Systems, Stable State Transformation Equivalence and Preorder, Robust Open Interface Nets, Expansion, Replacement
48	David de Frutos-Escrig, Carlos Gregorio-Rodríguez	Universal Coinductive Characterisations of Process Semantics.	IFIP TCS	2008	DBLP DOI BibTeX RDF
48	Flavio Corradini, Walter Vogler, Lars Jenner	Comparing the worst-case efficiency of asynchronous systems with PAFAS.	Acta Informatica	2002	DBLP DOI BibTeX RDF
48	Anna Ingólfsdóttir	Weak Semantics Based on Lighted Button Pressing Experiments.	CSL	1996	DBLP DOI BibTeX RDF
48	Roberto Segala	Quiescence, Fairness, Testing, and the Notion of Implementation (Extended Abstract).	CONCUR	1993	DBLP DOI BibTeX RDF
48	Luca Aceto, Matthew Hennessy	Termination, Deadlock, and Divergence.	J. ACM	1992	DBLP DOI BibTeX RDF
48	Ufuk Celikkan, Rance Cleaveland	Generating Diagnostic Information for Behavioral Preorders.	CAV	1992	DBLP DOI BibTeX RDF
48	Lucia Pomello	Refinement of Concurrent Systems Based on Local State Transformations.	REX Workshop	1989	DBLP DOI BibTeX RDF	functional abstraction and refinement, observable local/global states, local state transformations, morphisms preserving local state transformations
48	Taolue Chen, Wan J. Fokkink	On the Axiomatizability of Impossible Futures: Preorder versus Equivalence.	LICS	2008	DBLP DOI BibTeX RDF
48	Cosimo Laneve, Luca Padovani	The Must Preorder Revisited.	CONCUR	2007	DBLP DOI BibTeX RDF
48	Wim Martens, Frank Neven, Thomas Schwentick	Which XML Schemas Admit 1-Pass Preorder Typing?	ICDT	2005	DBLP DOI BibTeX RDF
48	Bernard De Baets, Hans E. De Meyer, Helga Naessens	A top-down algorithm for generating the Hasse tree of a fuzzy preorder closure.	IEEE Trans. Fuzzy Syst.	2004	DBLP DOI BibTeX RDF
48	Juhana Helovuo, Antti Valmari	Checking for CFFD-Preorder with Tester Processes.	TACAS	2000	DBLP DOI BibTeX RDF
37	Takashi Kitamura 0001, Huimin Lin	Controlling Process Modularity in Mobile Computing.	ICTAC	2007	DBLP DOI BibTeX RDF	process modularity, bisimulation-preorder, interaction-costs, Mobile computing
36	Parosh Aziz Abdulla, Ahmed Bouajjani, Jonathan Cederberg, Frédéric Haziza, Ahmed Rezine	Monotonic Abstraction for Programs with Dynamic Memory Heaps.	CAV	2008	DBLP DOI BibTeX RDF
36	Gerald Lüttgen, Walter Vogler	Conjunction on Processes: Full-Abstraction Via Ready-Tree Semantics.	FoSSaCS	2006	DBLP DOI BibTeX RDF
36	Doron Bustan, Orna Grumberg	Simulation-based minimazation.	ACM Trans. Comput. Log.	2003	DBLP DOI BibTeX RDF	Simulation, Minimization
36	Bartek Klin, Pawel Sobocinski 0001	Syntactic Formats for Free.	CONCUR	2003	DBLP DOI BibTeX RDF
36	Christel Baier, Joost-Pieter Katoen, Holger Hermanns, Boudewijn R. Haverkort	Simulation for Continuous-Time Markov Chains.	CONCUR	2002	DBLP DOI BibTeX RDF
36	Roope Kaivola	Using Compositional Preorders in the Verification of Sliding Window Protocal.	CAV	1997	DBLP DOI BibTeX RDF
36	Orna Grumberg, David E. Long	Model Checking and Modular Verification.	ACM Trans. Program. Lang. Syst.	1994	DBLP DOI BibTeX RDF	Moore machines, model checking, formal verification, temporal logics, CTL, computer-aided verification
36	Shoji Yuen, Rance Cleaveland, Zeynep Dayar, Scott A. Smolka	Fully Abstract Characterizations of Testing Preorders for Probabilistic Processes.	CONCUR	1994	DBLP DOI BibTeX RDF
36	Rance Cleaveland, Scott A. Smolka, Amy E. Zwarico	Testing Preorders for Probabilistic Processes.	ICALP	1992	DBLP DOI BibTeX RDF
36	Matthew Hennessy	Concurrent Testing of Processes (Extended Abstract).	CONCUR	1992	DBLP DOI BibTeX RDF
36	Orna Grumberg, David E. Long	Model Checking and Modular Verification.	CONCUR	1991	DBLP DOI BibTeX RDF
36	Luca Aceto, Uffe Engberg	Failures Semantics for a Simple Process Language with Refinement.	FSTTCS	1991	DBLP DOI BibTeX RDF
36	Xiaowei Huang, Li Jiao, Weiming Lu	A Semantic Preorder on Refinement and Fairness.	TASE	2007	DBLP DOI BibTeX RDF
36	Martin F. O'Connor, Zohra Bellahsene, Mark Roantree	An Extended Preorder Index for Optimising XPath Expressions.	XSym	2005	DBLP DOI BibTeX RDF
36	Ugo de'Liguoro, Adolfo Piperno	Must Preorder in Non-Deterministic Untyped Lambda-Calculus.	CAAP	1992	DBLP DOI BibTeX RDF
25	Fritz Henglein	Generic discrimination: sorting and paritioning unshared data in linear time.	ICFP	2008	DBLP DOI BibTeX RDF	multiset discrimination, total preorder, partitioning, generic, sorting, functional, equivalence, discrimination, discriminator, order
25	Hyeokki Kwon, Il Im, Bartel A. Van de Walle	Are You Thinking What I Am Thinking? A Comparison of Decision Makers' Cognitive Maps by Means of a New Similarity Measure.	HICSS	2002	DBLP DOI BibTeX RDF	Relational product, Similarity measure, Cognitive map, Fuzzy relation, Preorder
25	Reinhold Heckmann	Approximation of Metric Spaces by Partial Metric Spaces.	Appl. Categorical Struct.	1999	DBLP DOI BibTeX RDF	generalised metric spaces, Scott topology, domains, preorder
25	Hans-E. Porst	The algebraic theory of order.	Appl. Categorical Struct.	1993	DBLP DOI BibTeX RDF	Essentially equational theory, essentially algebraic category, order and preorder, ordered algebras
24	Xiao-ping Ye, Yong Tang 0001, LuoWu Chen, Huan Guo, Jun Zhu, KaiYuan Chen	Study and application of temporal index technology.	Sci. China Ser. F Inf. Sci.	2009	DBLP DOI BibTeX RDF	temporal equivalence and inclusion, query and incremental update, dynamical management and implemention, temporal relation and XML
24	Leila Amgoud, Srdjan Vesic	On Revising Argumentation-Based Decision Systems.	ECSQARU	2009	DBLP DOI BibTeX RDF
24	Francesco Ranzato, Francesco Tapparo	Computing Stuttering Simulations.	CONCUR	2009	DBLP DOI BibTeX RDF
24	Patrice Godefroid, Nir Piterman	LTL Generalized Model Checking Revisited.	VMCAI	2009	DBLP DOI BibTeX RDF
24	Manfred Schmidt-Schauß, Elena Machkasova	A Finite Simulation Method in a Non-deterministic Call-by-Need Lambda-Calculus with Letrec, Constructors, and Case.	RTA	2008	DBLP DOI BibTeX RDF
24	Dan Olteanu	Forward node-selecting queries over trees.	ACM Trans. Database Syst.	2007	DBLP DOI BibTeX RDF	XML, streams, XPath, Expressiveness, rewriting
24	Maria Carla Palmeri, Rocco De Nicola, Mieke Massink	Basic Observables for Probabilistic May Testing.	QEST	2007	DBLP DOI BibTeX RDF
24	Yuxin Deng, Rob J. van Glabbeek, Matthew Hennessy, Carroll Morgan, Chenyi Zhang	Characterising Testing Preorders for Finite Probabilistic Processes.	LICS	2007	DBLP DOI BibTeX RDF
24	Thomas Ball, Orna Kupferman	An Abstraction-Refinement Framework for Multi-Agent Systems.	LICS	2006	DBLP DOI BibTeX RDF
24	Taolue Chen, Wan J. Fokkink	On Finite Alphabets and Infinite Bases III: Simulation.	CONCUR	2006	DBLP DOI BibTeX RDF
24	Peter A. Boncz, Jan Flokstra, Torsten Grust, Maurice van Keulen, Stefan Manegold, K. Sjoerd Mullender, Jan Rittinger, Jens Teubner	MonetDB/XQuery-Consistent and Efficient Updates on the Pre/Post Plane.	EDBT	2006	DBLP DOI BibTeX RDF
24	Caroline J. Klivans	Obstructions to Shiftedness.	Discret. Comput. Geom.	2005	DBLP DOI BibTeX RDF
24	David de Frutos-Escrig, Carlos Gregorio-Rodríguez	Bisimulations Up-to for the Linear Time Branching Time Spectrum.	CONCUR	2005	DBLP DOI BibTeX RDF
24	Robi Malik, David Streader, Steve Reeves	Fair Testing Revisited: A Process-Algebraic Characterisation of Conflicts.	ATVA	2004	DBLP DOI BibTeX RDF
24	Radu Mateescu 0001	A Generic On-the-Fly Solver for Alternation-Free Boolean Equation Systems.	TACAS	2003	DBLP DOI BibTeX RDF
24	Thomas A. Henzinger, Shaz Qadeer, Sriram K. Rajamani, Serdar Tasiran	An assume-guarantee rule for checking simulation.	ACM Trans. Program. Lang. Syst.	2002	DBLP DOI BibTeX RDF	verification rules, Simulation relations
24	Antonín Kucera 0001, Richard Mayr	On the Complexity of Semantic Equivalences for Pushdown Automata and BPA.	MFCS	2002	DBLP DOI BibTeX RDF
24	Antonín Kucera 0001, Richard Mayr	Why Is Simulation Harder than Bisimulation?	CONCUR	2002	DBLP DOI BibTeX RDF
24	Gerald Lüttgen, Walter Vogler	A Faster-than Relation for Asynchronous Processes.	CONCUR	2001	DBLP DOI BibTeX RDF
24	Antti Valmari	Composition and Abstraction.	MOVEP	2000	DBLP DOI BibTeX RDF
24	Glenn Bruns, Patrice Godefroid	Model Checking Partial State Spaces with 3-Valued Temporal Logics.	CAV	1999	DBLP DOI BibTeX RDF
24	Lars Jenner, Walter Vogler	Comparing the Efficiency of Asynchronous Systems.	ARTS	1999	DBLP DOI BibTeX RDF
24	Parosh Aziz Abdulla, Karlis Cerans	Simulation Is Decidable for One-Counter Nets (Extended Abstract).	CONCUR	1998	DBLP DOI BibTeX RDF
24	Thomas A. Henzinger, Shaz Qadeer, Sriram K. Rajamani, Serdar Tasiran	An Assume-Guarantee Rule for Checking Simulation.	FMCAD	1998	DBLP DOI BibTeX RDF
24	Michele Boreale, Rocco De Nicola, Rosario Pugliese	Basic Observables for Processes.	ICALP	1997	DBLP DOI BibTeX RDF
24	Luis Fernando Llana Díaz, Manuel Núñez 0001	Testing Semantics for Unbounded Nondeterminism.	Euro-Par	1997	DBLP DOI BibTeX RDF	unbounded nondeterminism, testing semantics, Process algebra, CSP, operational semantics
24	Thomas A. Henzinger, Orna Kupferman, Sriram K. Rajamani	Fair Simulation.	CONCUR	1997	DBLP DOI BibTeX RDF
24	Luca Aceto, Anna Ingólfsdóttir	CPO Models for a Class of GSOS Languages.	TAPSOFT	1995	DBLP DOI BibTeX RDF
24	Roberto Segala	A Compositional Trace-Based Semantics for Probabilistic Automata.	CONCUR	1995	DBLP DOI BibTeX RDF
24	André Arnold, Anne Dicky	Equivalences and Preorders of Transition Systems.	MFCS	1993	DBLP DOI BibTeX RDF	temporal logic, bisimulation, transition system
24	Ilaria Castellani	Observing Distribution in Processes.	MFCS	1993	DBLP DOI BibTeX RDF
24	Ahmed Bouajjani, Jean-Claude Fernandez, Susanne Graf, Carlos Rodriguez, Joseph Sifakis	Safety for Branching Time Semantics.	ICALP	1991	DBLP DOI BibTeX RDF
24	Stephan Olariu, C. Michael Overstreet, Zhaofang Wen	An Optimal Parallel Algorithm to Reconstruct a Binary Tree from its Traversals.	ICCI	1991	DBLP DOI BibTeX RDF	Algorithms, Parallel algorithms, PRAM, Binary trees, Traversals, Ordered trees
24	Faron Moller, Chris M. N. Tofts	Relating Processes With Respect to Speed.	CONCUR	1991	DBLP DOI BibTeX RDF
24	Luca Aceto, Matthew Hennessy	Termination, Deadlock and Divergence.	Mathematical Foundations of Programming Semantics	1989	DBLP DOI BibTeX RDF
23	Anqing Wang, Alexander Guzman-Urbina, Hajime Ohno, Yasuhiro Fukushima	An automatic distillation sequence synthesis framework based on a preorder traversal algorithm.	Comput. Chem. Eng.	2024	DBLP DOI BibTeX RDF
23	Antoine Aspeel, Necmiye Ozay	A Simulation Preorder for Koopman-like Lifted Control Systems.	CoRR	2024	DBLP DOI BibTeX RDF
23	Yizhao Zhao, Zaiwu Gong, Guo Wei 0004, Roman Slowinski	Consensus modeling with interactive utility and partial preorder of decision-makers, involving fairness and tolerant behavior.	Inf. Sci.	2023	DBLP DOI BibTeX RDF
23	Jun Yang, Wei Yao	Fuzzy preorder based fuzzy rough sets using multiplication and division.	J. Intell. Fuzzy Syst.	2022	DBLP DOI BibTeX RDF
23	Abbas Safaei, Mohammad T. Khasawneh	Possibility Extent and Possible Alternatives Preorder Type-2 Fuzzy Analytical Hierarchy Process (PE&PAP-AHP) to improve pharmaceutical R&D productivity.	Appl. Soft Comput.	2022	DBLP DOI BibTeX RDF
23	Zhan Pang, Wenqiang Xiao, Xuying Zhao	Preorder Price Guarantee in e-Commerce.	Manuf. Serv. Oper. Manag.	2021	DBLP DOI BibTeX RDF
23	Koko Muroya, Takahiro Sanada, Natsuki Urabe	Preorder-Constrained Simulation for Nondeterministic Automata (Early Ideas).	CALCO	2021	DBLP DOI BibTeX RDF
23	Zhaofang Bai, Shuanping Du	Coherent preorder of quantum states.	Quantum Inf. Comput.	2020	DBLP DOI BibTeX RDF
23	Md. Rakibul Hasan, Yosef Daryanto, Tutul Chandra Roy, Yi Feng	Inventory management with online payment and preorder discounts.	Ind. Manag. Data Syst.	2020	DBLP DOI BibTeX RDF
23	Íñigo X. Íncer Romeo, Leonardo Mangeruca, Tiziano Villa, Alberto L. Sangiovanni-Vincentelli	The Quotient in Preorder Theories.	GandALF	2020	DBLP DOI BibTeX RDF
23	Natanael Alpay, Peter Jipsen	Commutative Doubly-Idempotent Semirings Determined by Chains and by Preorder Forests.	RAMiCS	2020	DBLP DOI BibTeX RDF
23	Luisa Iturrioz	About a 'concrete' Rauszer Boolean algebra generated by a preorder.	CoRR	2019	DBLP BibTeX RDF
23	Anupam K. Singh	Bipolar Fuzzy Preorder, Alexandrov Bipolar Fuzzy Topology and Bipolar Fuzzy Automata.	New Math. Nat. Comput.	2019	DBLP DOI BibTeX RDF
23	Kumar Sankar Ray, Sandip Paul, Diganta Saha	Preorder-based triangle: a modified version of bilattice-based triangle for belief revision in nonmonotonic reasoning.	J. Exp. Theor. Artif. Intell.	2018	DBLP DOI BibTeX RDF
23	Evgeny Kusmenko, Igor Shumeiko, Bernhard Rumpe, Michael von Wenckstern	Fast Simulation Preorder Algorithm.	MODELSWARD	2018	DBLP DOI BibTeX RDF
23	Weiye Wang, Xibao Wu, Tian Tian, Jiayuan Wang	Autonomous Conflict Resolution Method for multi-UAVs Based on Preorder Flight Information.	ACAI	2018	DBLP DOI BibTeX RDF
23	Zhongjun Tian, Yefeng Wang	Advance selling with preorder-dependent customer valuation.	Oper. Res. Lett.	2016	DBLP DOI BibTeX RDF
23	Franz Baader, Pierre Ludmann	The Unification Type of ACUI w.r.t. the Unrestricted Instantiation Preorder is not Finitary.	UNIF	2016	DBLP BibTeX RDF
23	Makoto Nakayama, Kenichi Yamazaki, Satoshi Tanaka	Parallelization of Recursive Preorder Traversal Based on Building and Winding Call Stacks.	IPDPS Workshops	2016	DBLP DOI BibTeX RDF
23	Robi Malik, Ryan J. Leduc	Hierarchical modelling of manufacturing systems using discrete event systems and the conflict preorder.	Discret. Event Dyn. Syst.	2015	DBLP DOI BibTeX RDF