Search results for "infinity"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
68	Harvey L. Davies	Infinity Arithmetic, Comparisons and J.	APL	1995	DBLP DOI BibTeX RDF	NaN, error-trapping, indeterminate, infinity arithmetic, APL, comparison, precision, arithmetic, tolerance, comparative, J, limits, infinity, IEEE 754 Standard
63	Andreas Schmid 0002, Olaf Kandel, Christoph Steigner	Avoiding Counting to Infinity in Distance Vector Routing.	ICN (1)	2001	DBLP DOI BibTeX RDF	Routing Information Protocol, Counting to Infinity, Internet, Protocol Design
58	Chefi Ketata, Mysore G. Satish, M. Rafiqul Islam	The Meaningful Infinity.	CIMCA/IAWTIC	2006	DBLP DOI BibTeX RDF
52	Philippe Schnoebelen	Preface: Proceedings of INFINITY 2003, the 5th International Workshop on Verification of Infinite-State Systems, a satellite workshop of CONCUR 2003.	INFINITY	2003	DBLP DOI BibTeX RDF
49	Khaled Elmeleegy, Alan L. Cox, T. S. Eugene Ng	Understanding and mitigating the effects of count to infinity in Ethernet networks.	IEEE/ACM Trans. Netw.	2009	DBLP DOI BibTeX RDF	spanning tree protocols, reliability, ethernet, Ethernet
49	Fei Shen, Han Wang 0001	A linear algorithm to estimate the plane of infinity.	ICARCV	2002	DBLP DOI BibTeX RDF
49	Richard I. Hartley, Lourdes de Agapito, Ian D. Reid 0001, Eric Hayman	Camera Calibration and the Search for Infinity.	ICCV	1999	DBLP DOI BibTeX RDF
46	Mircea Lazar, Andrej Jokic	On infinity norms as Lyapunov functions for piecewise affine systems.	HSCC	2010	DBLP DOI BibTeX RDF	infinity norms, output feedback, stability, lyapunov methods, piecewise affine systems
46	Jyotirmay Gadewadikar, Frank L. Lewis, Kamesh Subbarao, Kemao Peng, Ben M. Chen	H-Infinity Static Output-feedback Control for Rotorcraft.	J. Intell. Robotic Syst.	2009	DBLP DOI BibTeX RDF	H-Infinity control, Unmanned aerial vehicles
40	Alvin Cheung, Tyrone Grandison, Christopher M. Johnson, Stefan Schönauer	Ïnfïnïty: a generic platform for application development and information sharing on mobile devices.	MobiDE	2007	DBLP DOI BibTeX RDF	collaboration, information sharing, privacy preservation, mobile middleware
40	Michael Beeson, Freek Wiedijk	The Meaning of Infinity in Calculus and Computer Algebra Systems.	AISC	2002	DBLP DOI BibTeX RDF
37	Lukás Holík, Lorenzo Clemente (eds.)	Proceedings 15th International Workshop on Verification of Infinite-State Systems, INFINITY 2013, Hanoi, Vietnam, 14th October 2013.	INFINITY	2014	DBLP DOI BibTeX RDF
37	Parosh Aziz Abdulla, Mohamed Faouzi Atig, Jari Stenman	Zenoness for Timed Pushdown Automata.	INFINITY	2013	DBLP DOI BibTeX RDF
37	Oded Maler	Algorithmic Verification of Continuous and Hybrid Systems.	INFINITY	2013	DBLP DOI BibTeX RDF
37	Johann Schuster, Markus Siegle	Lattice structures for bisimilar Probabilistic Automata.	INFINITY	2013	DBLP DOI BibTeX RDF
37	Gal Katz, Doron A. Peled	Synthesis of Parametric Programs using Genetic Programming and Model Checking.	INFINITY	2013	DBLP DOI BibTeX RDF
37	Yu-Fang Chen 0001, Bow-Yaw Wang, Di-De Yen	A Finite Exact Representation of Register Automata Configurations.	INFINITY	2013	DBLP DOI BibTeX RDF
37	Mohamed Faouzi Atig, Ahmed Rezine (eds.)	Proceedings 14th International Workshop on Verification of Infinite-State Systems, Infinity 2012, Paris, France, 27th August 2012.	Infinity	2012	DBLP DOI BibTeX RDF
37	Parosh Aziz Abdulla, Richard Mayr	Petri Nets with Time and Cost	Infinity	2012	DBLP DOI BibTeX RDF
37	Arnaud Gotlieb, Tristan Denmat, Nadjib Lazaar	Constraint-based reachability	Infinity	2012	DBLP DOI BibTeX RDF
37	Aurel Randolph, Hanifa Boucheneb, Abdessamad Imine, Alejandro Quintero	On Consistency of Operational Transformation Approach	Infinity	2012	DBLP DOI BibTeX RDF
37	Lukasz Fronc	Effective Marking Equivalence Checking in Systems with Dynamic Process Creation	Infinity	2012	DBLP DOI BibTeX RDF
37	Fang Yu 0001, Chao Wang (eds.)	Proceedings 13th International Workshop on Verification of Infinite-State Systems, INFINITY 2011, Taipei, Taiwan, 10th October 2011.	INFINITY	2011	DBLP DOI BibTeX RDF
37	Christian Krause 0001, Holger Giese	Model Checking Probabilistic Real-Time Properties for Service-Oriented Systems with Service Level Agreements	INFINITY	2011	DBLP DOI BibTeX RDF
37	Doron A. Peled, Sven Schewe	Practical Distributed Control Synthesis	INFINITY	2011	DBLP DOI BibTeX RDF
37	Laurent Fribourg, Bertrand Revol, Romain Soulat	Synthesis of Switching Rules for Ensuring Reachability Properties of Sampled Linear Systems	INFINITY	2011	DBLP DOI BibTeX RDF
37	Alex Spelten, Wolfgang Thomas, Sarah Winter	Trees over Infinite Structures and Path Logics with Synchronization	INFINITY	2011	DBLP DOI BibTeX RDF
37	Alberto Ciaffaglione	A coinductive semantics of the Unlimited Register Machine	INFINITY	2011	DBLP DOI BibTeX RDF
37	Takashi Tomita, Shigeki Hagihara, Naoki Yonezaki	A Probabilistic Temporal Logic with Frequency Operators and Its Model Checking	INFINITY	2011	DBLP DOI BibTeX RDF
37	Yu-Fang Chen 0001, Ahmed Rezine (eds.)	Proceedings 12th International Workshop on Verification of Infinite-State Systems, INFINITY 2010, Singapore, Singapore, 21st September 2010.	INFINITY	2010	DBLP DOI BibTeX RDF
37	Étienne André	IMITATOR II: A Tool for Solving the Good Parameters Problem in Timed Automata	INFINITY	2010	DBLP DOI BibTeX RDF
37	Nathalie Bertrand 0001, Christophe Morvan	Probabilistic regular graphs	INFINITY	2010	DBLP DOI BibTeX RDF
37	Frédéric Peschanski, Hanna Klaudel, Raymond R. Devillers	A Decidable Characterization of a Graphical Pi-calculus with Iterators	INFINITY	2010	DBLP DOI BibTeX RDF
37	Stéphane Demri	On Selective Unboundedness of VASS	INFINITY	2010	DBLP DOI BibTeX RDF
37	Bernard Boigelot, Julien Brusten, Jean-François Degbomont	Implicit Real Vector Automata	INFINITY	2010	DBLP DOI BibTeX RDF
37	Oded Maler, Kim G. Larsen, Bruce H. Krogh	On Zone-Based Analysis of Duration Probabilistic Automata	INFINITY	2010	DBLP DOI BibTeX RDF
37	Hanifa Boucheneb, Kamel Barkaoui	On interleaving in {P,A}-Time Petri nets with strong semantics	INFINITY	2010	DBLP DOI BibTeX RDF
37	Axel Legay (eds.)	Proceedings International Workshop on Verification of Infinite-State Systems, INFINITY 2009, Bologna, Italy, 31th August 2009.	INFINITY	2009	DBLP DOI BibTeX RDF
37	Peter Habermehl, Tomás Vojnar (eds.)	Joint Proceedings of the 8th, 9th, and 10th International Workshops on Verification of Infinite-State Systems, INFINITY 2006 / 2007 / 2008, Bonn, Germany, August 26, 2006 / Lisbon, Portugal, September 8, 2007 / Toronto, Canada, August 23, 2008	INFINITY	2009	DBLP BibTeX RDF
37	Christophe Morvan	On external presentations of infinite graphs	INFINITY	2009	DBLP DOI BibTeX RDF
37	Bahareh Badban, Stefan Leue, Jan-Georg Smaus	Automated Predicate Abstraction for Real-Time Models	INFINITY	2009	DBLP DOI BibTeX RDF
37	Nguyen Van Tang	A Tighter Bound for the Determinization of Visibly Pushdown Automata	INFINITY	2009	DBLP DOI BibTeX RDF
37	Florent Bouchy, Alain Finkel, Pierluigi San Pietro	Dense-choice Counter Machines revisited	INFINITY	2009	DBLP DOI BibTeX RDF
37	Laurent Fribourg, Étienne André	An Inverse Method for Policy-Iteration Based Algorithms	INFINITY	2009	DBLP DOI BibTeX RDF
37	Peter Habermehl, Tomás Vojnar	Preface.	INFINITY	2009	DBLP DOI BibTeX RDF
37	Ulrich Fahrenberg, Kim Guldstrand Larsen	Discount-Optimal Infinite Runs in Priced Timed Automata.	INFINITY	2009	DBLP DOI BibTeX RDF
37	Narjes Ben Rajeb, Brahim Nasraoui, Riadh Robbana, Tayssir Touili	Verifying Multithreaded Recursive Programs with Integer Variables.	INFINITY	2009	DBLP DOI BibTeX RDF
37	Mojmír Kretínský, Vojtech Rehák, Jan Strejcek	On Decidability of LTL+Past Model Checking for Process Rewrite Systems.	INFINITY	2009	DBLP DOI BibTeX RDF
37	Sibylle B. Fröschle, Slawomir Lasota 0001	Normed Processes, Unique Decomposition, and Complexity of Bisimulation Equivalences.	INFINITY	2009	DBLP DOI BibTeX RDF
37	Hanifa Boucheneb, Kamel Barkaoui	Covering Steps Graphs of Time Petri Nets.	INFINITY	2009	DBLP DOI BibTeX RDF
37	Emmanuelle Encrenaz, Alain Finkel	Automatic Verification of Counter Systems With Ranking Function.	INFINITY	2009	DBLP DOI BibTeX RDF
37	Parosh Aziz Abdulla, Pavel Krcál, Wang Yi 0001	Universality of R-automata with Value Copying.	INFINITY	2009	DBLP DOI BibTeX RDF
37	Florent Bouchy, Alain Finkel, Arnaud Sangnier	Reachability in Timed Counter Systems.	INFINITY	2009	DBLP DOI BibTeX RDF
37	Franck Pommereau, Raymond R. Devillers, Hanna Klaudel	Efficient Reachability Graph Representation of Petri Nets With Unbounded Counters.	INFINITY	2009	DBLP DOI BibTeX RDF
37	Giorgio Delzanno, Roberto Montagna	Deciding Reachability in Mobile Ambients with Name Restriction.	INFINITY	2009	DBLP DOI BibTeX RDF
37	Yohan Boichut, Pierre-Cyrille Héam, Olga Kouchnarenko	Tree Automata for Detecting Attacks on Protocols with Algebraic Cryptographic Primitives.	INFINITY	2009	DBLP DOI BibTeX RDF
37	Mihaela Sighireanu, Tayssir Touili	Bounded Communication Reachability Analysis of Process Rewrite Systems with Ordered Parallelism.	INFINITY	2009	DBLP DOI BibTeX RDF
37	Régis Gascon	An Automata-based Approach for CTL* With Constraints.	INFINITY	2009	DBLP DOI BibTeX RDF
37	Tomás Brázdil, Václav Brozek, Vojtech Forejt	Branching-Time Model-Checking of Probabilistic Pushdown Automata.	INFINITY	2009	DBLP DOI BibTeX RDF
37	Jirí Srba, Scott A. Smolka (eds.)	Proceedings of the 7th International Workshop on Verification of Infinite-State Systems, INFINITY 2005, San Francisco, CA, USA, August 27, 2005	INFINITY	2006	DBLP BibTeX RDF
37	Julian C. Bradfield, Faron Moller (eds.)	Proceedings of the 6th International Workshop on Verification of Infinite-State Systems, INFINITY 2004, London, UK, September 4, 2004	INFINITY	2005	DBLP BibTeX RDF
37	Jirí Srba, Scott A. Smolka	Preface.	INFINITY	2005	DBLP DOI BibTeX RDF
37	Ahmed Bouajjani, Peter Habermehl, Adam Rogalewicz, Tomás Vojnar	Abstract Regular Tree Model Checking.	INFINITY	2005	DBLP DOI BibTeX RDF
37	Viktor Schuppan, Armin Biere	Liveness Checking as Safety Checking for Infinite State Spaces.	INFINITY	2005	DBLP DOI BibTeX RDF
37	Paul C. Attie, Hana Chockler	Automatic Verification of Fault-Tolerant Register Emulations.	INFINITY	2005	DBLP DOI BibTeX RDF
37	Venkatesh Mysore, Bud Mishra	Algorithmic Algebraic Model Checking III: Approximate Methods.	INFINITY	2005	DBLP DOI BibTeX RDF
37	Antonín Kucera 0001	Methods for Quantitative Analysis of Probabilistic Pushdown Automata.	INFINITY	2005	DBLP DOI BibTeX RDF
37	Mojmír Kretínský, Vojtech Rehák, Jan Strejcek	Refining the Undecidability Border of Weak Bisimilarity.	INFINITY	2005	DBLP DOI BibTeX RDF
37	Philippe Schnoebelen (eds.)	Proceedings of INFINITY 2003, the 5th International Workshop on Verification of Infinite-State Systems, a satellite workshop of CONCUR 2003, Marseille, France, September 2, 2003	INFINITY	2004	DBLP BibTeX RDF
37	Olga Grinchtein, Bengt Jonsson 0001, Martin Leucker	Inference of Timed Transition Systems.	INFINITY	2004	DBLP DOI BibTeX RDF
37	Martin Kot, Zdenek Sawa	Bisimulation equivalence of a BPP and a finite-state system can be decided in polynomial time.	INFINITY	2004	DBLP DOI BibTeX RDF
37	Ahmed Bouajjani, Axel Legay, Pierre Wolper	Handling Liveness Properties in (omega-)Regular Model Checking.	INFINITY	2004	DBLP DOI BibTeX RDF
37	Jesse D. Bingham	A New Approach to Upward-Closed Set Backward Reachability Analysis.	INFINITY	2004	DBLP DOI BibTeX RDF
37	Peter Habermehl, Tomás Vojnar	Regular Model Checking Using Inference of Regular Languages.	INFINITY	2004	DBLP DOI BibTeX RDF
37	Parosh Aziz Abdulla, Johann Deneux, Pritha Mahata	Closed, Open, and Robust Timed Networks.	INFINITY	2004	DBLP DOI BibTeX RDF
37	Ahmed Bouajjani, Javier Esparza, Tayssir Touili	Reachability Analysis of Synchronized PA Systems.	INFINITY	2004	DBLP DOI BibTeX RDF
37	Ranko Lazic 0001	Decidability of Reachability for Polymorphic Systems with Arrays: A Complete Classification.	INFINITY	2004	DBLP DOI BibTeX RDF
37	Ranko Lazic 0001, Thomas Christopher Newcomb, Bill Roscoe	Polymorphic Systems with Arrays, 2-Counter Machines and Multiset Rewriting.	INFINITY	2004	DBLP DOI BibTeX RDF
37	Julian C. Bradfield, Faron Moller	Preface.	INFINITY	2004	DBLP DOI BibTeX RDF
37	Antonín Kucera 0001, Richard Mayr (eds.)	4th International Workshop on Verification of Infinite-State Systems (CONCUR 2002 Satellite Workshop), Infinity 2002, Brno, Czech Republic, August 24, 2002	INFINITY	2003	DBLP BibTeX RDF
37	Giorgio Delzanno	A Symbolic Procedure for Control Reachability in the Asynchronous Pi-calculus: Extended Abstract.	INFINITY	2003	DBLP DOI BibTeX RDF
37	Jean-François Raskin, Laurent Van Begin	Petri Nets with Non-blocking Arcs are Difficult to Analyze.	INFINITY	2003	DBLP DOI BibTeX RDF
37	Jérôme Leroux	The Affine Hull of a Binary Automaton is Computable in Polynomial Time.	INFINITY	2003	DBLP DOI BibTeX RDF
37	Jirí Srba	Completeness Results for Undecidable Bisimilarity Problems.	INFINITY	2003	DBLP DOI BibTeX RDF
37	Olga Grinchtein, Martin Leucker	Network Invariants for Real-Time Systems.	INFINITY	2003	DBLP DOI BibTeX RDF
37	Mojmír Kretínský, Vojtech Rehák, Jan Strejcek	On Extensions of Process Rewrite Systems: Rewrite Systems with Weak Finite-State Unit.	INFINITY	2003	DBLP DOI BibTeX RDF
37	Anders Møller	Verifying Programs that Manipulate Pointers: (Invited Talk).	INFINITY	2003	DBLP DOI BibTeX RDF
37	Antonín Kucera 0001, Richard Mayr	Preface.	INFINITY	2002	DBLP DOI BibTeX RDF
37	Thierry Cachat	Uniform Solution of Parity Games on Prefix-Recognizable Graphs.	INFINITY	2002	DBLP DOI BibTeX RDF
37	Jitka Stríbrná, Ivana Cerná	Modifications of Expansion Trees for Weak Bisimulation in BPA.	INFINITY	2002	DBLP DOI BibTeX RDF
37	Chloe Rispal	The synchronized graphs trace the context-sensitive languages.	INFINITY	2002	DBLP DOI BibTeX RDF
37	Thomas Colcombet	Rewriting in the partial algebra of typed terms modulo AC.	INFINITY	2002	DBLP DOI BibTeX RDF
37	Hans Hüttel	Deciding Framed Bisimilarity.	INFINITY	2002	DBLP DOI BibTeX RDF
37	Alain Finkel, Jean-François Raskin, Mathias Samuelides, Laurent Van Begin	Monotonic Extensions of Petri Nets: Forward and Backward Search Revisited.	INFINITY	2002	DBLP DOI BibTeX RDF
37	Bernhard Steffen, Didier Caucal (eds.)	First International Workshop on Verification of Infinite State Systems, Infinity 1996, Università di Pisa, Pisa, Italy, August 30-31, 1996	INFINITY	1997	DBLP BibTeX RDF
37	Faron Moller (eds.)	Second International Workshop on Verification of Infinite State Systems, Infinity 1997, Bologna, Italy, July 11-12, 1997	INFINITY	1997	DBLP BibTeX RDF
37	Alain Finkel, Bernard Willems, Pierre Wolper	A direct symbolic approach to model checking pushdown systems.	INFINITY	1997	DBLP DOI BibTeX RDF
37	Géraud Sénizergues	L(A) = L(B)?	INFINITY	1997	DBLP DOI BibTeX RDF
37	Felice Balarin	Verifying invariants by approximate image computation.	INFINITY	1997	DBLP DOI BibTeX RDF
37	Olaf Burkart	Model checking rationally restricted right closures of recognizable graphs.	INFINITY	1997	DBLP DOI BibTeX RDF