Search results for "Reachability"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
21	Ingo Felscher	The Compositional Method and Regular Reachability.	RP	2008	DBLP DOI BibTeX RDF
21	Kerstin Bauer, Raffaella Gentilini, Klaus Schneider 0001	Approximated Reachability on Hybrid Automata: Falsification meets Certification.	RP	2008	DBLP DOI BibTeX RDF
21	Pieter Collins, Alexandre Goldsztejn	The Reach-and-Evolve Algorithm for Reachability Analysis of Nonlinear Dynamical Systems.	RP	2008	DBLP DOI BibTeX RDF
21	Pavel Martyugin	The Length of Subset Reachability in Nondeterministic Automata.	RP	2008	DBLP DOI BibTeX RDF
21	Juhani Karhumäki	Reachability via Cooperating Morphisms.	RP	2008	DBLP DOI BibTeX RDF
21	M. Praveen, Kamal Lodaya	Analyzing Reachability for Some Petri Nets With Fast Growing Markings.	RP	2008	DBLP DOI BibTeX RDF
21	Kai Lampka	A New Algorithm for Partitioned Symbolic Reachability Analysis.	RP	2008	DBLP DOI BibTeX RDF
21	Giorgio Delzanno, Roberto Montagna	On Reachability and Spatial Reachability in Fragments of BioAmbients.	MeCBIC@ICALP	2006	DBLP DOI BibTeX RDF
21	Wuxu Peng, Kia Makki	Reachability and reverse reachability analysis of CFSMs.	Comput. Commun.	1996	DBLP DOI BibTeX RDF
21	Helen Eliopoulou, Nicos Karcanias	Properties of reachability and almost reachability subspaces of implicit systems: The extension problem.	Kybernetika	1995	DBLP BibTeX RDF
21	Moisés E. Bonilla, Michel Malabre	External reachability (reachability with pole assignment by p. d. feedback) for implicit descriptions.	Kybernetika	1993	DBLP BibTeX RDF
20	Thao Dang 0001, Oded Maler, Romain Testylier	Accurate hybridization of nonlinear systems.	HSCC	2010	DBLP DOI BibTeX RDF	reachability computation, numerical analysis, non-linear systems
20	Guoqing Xu 0001, Atanas Rountev	Detecting inefficiently-used containers to avoid bloat.	PLDI	2010	DBLP DOI BibTeX RDF	cfl reachability, container bloat, points-to analysis
20	Andrew Begel, Yit Phang Khoo, Thomas Zimmermann 0001	Codebook: discovering and exploiting relationships in software repositories.	ICSE (1)	2010	DBLP DOI BibTeX RDF	inter-team coordination, regular language reachability, social networking, knowledge management, regular expression, mining software repositories
20	Sven Hartmann, Sebastian Link	Efficient reasoning about a robust XML key fragment.	ACM Trans. Database Syst.	2009	DBLP DOI BibTeX RDF	XML key, reachability, axiomatization, implication, XML data
20	Artur Boronat, Reiko Heckel, José Meseguer 0001	Rewriting Logic Semantics and Verification of Model Transformations.	FASE	2009	DBLP DOI BibTeX RDF	Model and graph transformations, LTL model checking, reachability analysis, rewriting logic, MOF, QVT, Maude
20	Bostjan Potocnik, Gasper Music, Igor Skrjanc, Borut Zupancic	Model-based Predictive Control of Hybrid Systems: A Probabilistic Neural-network Approach to Real-time Control.	J. Intell. Robotic Syst.	2008	DBLP DOI BibTeX RDF	Hybrid systems, Reachability analysis, Probabilistic neural networks, Model predictive control
20	Liam Roditty	A faster and simpler fully dynamic transitive closure.	ACM Trans. Algorithms	2008	DBLP DOI BibTeX RDF	directed graph, reachability, Dynamic graph algorithms
20	Alban Ponse, Mark van der Zwaag	Risk Assessment for One-Counter Threads.	Theory Comput. Syst.	2008	DBLP DOI BibTeX RDF	One-counter systems, Risk assessment, Reachability, Thread algebra
20	Xin Zheng, Radu Rugina	Demand-driven alias analysis for C.	POPL	2008	DBLP DOI BibTeX RDF	CFL reachability, pointer analysis, alias analysis, memory disambiguation, demand-driven analysis
20	Swarat Chaudhuri	Subcubic algorithms for recursive state machines.	POPL	2008	DBLP DOI BibTeX RDF	CFL-reachability, cubic bottleneck, recursive state machines, transitive closure, interprocedural analysis, context-free languages, pushdown systems
20	Liesbeth De Mol	Study of Limits of Solvability in Tag Systems.	MCU	2007	DBLP DOI BibTeX RDF	Limits of solvability, Reachability problem, Tag Systems, Halting Problem
20	Christof Löding, Alex Spelten	Transition Graphs of Rewriting Systems over Unranked Trees.	MFCS	2007	DBLP DOI BibTeX RDF	Infinite graphs, unranked trees, rewriting, reachability
20	Víctor A. Braberman, Alfredo Olivero, Fernando Schapachnik	Dealing with practical limitations of distributed timed model checking for timed automata.	Formal Methods Syst. Des.	2006	DBLP DOI BibTeX RDF	Distributed timed model checking, Kronos, Load-balance, Reconfiguration, Timed automata, Reachability, Redistribution, Zeus, DBM
20	M. Masadeh Bani Yassein, Mohamed Ould-Khaoua, Lewis M. Mackenzie, Stylianos Papanastasiou, Abdulai Jamal	Improving route discovery in on-demand routing protocols using local topology information in MANETs.	PM2HW2N	2006	DBLP DOI BibTeX RDF	probabilistic broadcasting, MANETs, AODV, reachability
20	Spring Berman, Ádám M. Halász, Vijay Kumar 0001, Stephen Pratt	Algorithms for the Analysis and Synthesis of a Bio-inspired Swarm Robotic System.	Swarm Robotics	2006	DBLP DOI BibTeX RDF	abstractions of swarms, insect house hunting, synthesis, reachability analysis, stochastic simulation, multiscale modeling
20	Jonathan Sprinkle, Aaron D. Ames, J. Mikael Eklund, Ian M. Mitchell, Shankar Sastry 0001	Online safety calculations for glide-slope recapture.	Innov. Syst. Softw. Eng.	2005	DBLP DOI BibTeX RDF	Reachability model analysis, Code generation, Unmanned aerial vehicles (UAVs), Controller synthesis
20	Alfons Geser, Dieter Hofbauer, Johannes Waldmann	Termination Proofs for String Rewriting Systems via Inverse Match-Bounds.	J. Autom. Reason.	2005	DBLP DOI BibTeX RDF	match-bounded, inhibitor, termination, normalization, reachability, regular languages, context-free languages, semi-Thue systems, string rewriting systems
20	Lu Yang, Naijun Zhan, Bican Xia, Chaochen Zhou	Program Verification by Using DISCOVERER.	VSTTE	2005	DBLP DOI BibTeX RDF	semi-algebraic systems, DISCOVERER, reachability computation, program verification, termination, invariant generation
20	Guy Edward Gallasch, Bing Han, Jonathan Billington	Sweep-Line Analysis of TCP Connection Management.	ICFEM	2005	DBLP DOI BibTeX RDF	TCP Connection Management, Sweep-line analysis, Verification, Coloured Petri Nets, Reachability analysis, State Space methods
20	Awny Sayed, Rainer Unland	HID: An Efficient Path Index for Complex XML Collections with Arbitrary Links.	DNIS	2005	DBLP DOI BibTeX RDF	descendants-or-self queries, XML, indexing, reachability queries
20	Hao Jin, Curtis E. Dyreson	Sanitizing using metadata in MetaXQuery.	SAC	2005	DBLP DOI BibTeX RDF	data reachability, XML, metadata, XQuery
20	W. Eric Wong, Yu Lei, Xiao Ma	Effective Generation of Test Sequences for Structural Testing of Concurrent Programs.	ICECCS	2005	DBLP DOI BibTeX RDF	concurrent program testing, all-node criterion, all-edge criterion, structural testing, reachability graph
20	Conrado Daws, Marta Z. Kwiatkowska, Gethin Norman	Automatic verification of the IEEE 1394 root contention protocol with KRONOS and PRISM.	Int. J. Softw. Tools Technol. Transf.	2004	DBLP DOI BibTeX RDF	Forwards reachability, Timed automata, Probabilistic model checking, IEEE standard, FireWire
20	Sébastien Bardin, Alain Finkel	Composition of Accelerations to Verify Infinite Heterogeneous Systems.	ATVA	2004	DBLP DOI BibTeX RDF	unbounded heterogeneous data, composition of symbolic representations and acceleration methods, reachability set
20	Oscar H. Ibarra, Zhe Dang, Ömer Egecioglu, Gaurav Saxena	Characterizations of Catalytic Membrane Computing Systems.	MFCS	2003	DBLP DOI BibTeX RDF	catalytic system, vector addition system, reachability problem, membrane computing, semilinear set
20	Siva Anantharaman, Paliath Narendran, Michaël Rusinowitch	Unification Modulo ACU I Plus Homomorphisms/Distributivity.	CADE	2003	DBLP DOI BibTeX RDF	E-Unification, Rewrite reachability, Minskymachine, Complexity, Set constraints, Post correspondence problem
20	Lars Michael Kristensen, Thomas Mailund	A Generalised Sweep-Line Method for Safety Properties.	FME	2002	DBLP DOI BibTeX RDF	explicit state space exploration methods, state space reduction methods, practical use and tool support, reachability analysis, theoretical foundations
20	Samir Roy, Biplab K. Sikdar, Monalisa Mukherjee, Debesh K. Das	Degree-of-Freedom Analysis for Sequential Machines Targeting BIST Quality and Gate Area.	ASP-DAC/VLSI Design	2002	DBLP DOI BibTeX RDF	FSM synthesis, emitability, BIST, reachability, degree of freedom
20	Leo Ojala, Nisse Husberg, Teemu Tynjälä	Modelling and analysing a distributed dynamic channel allocation algorithm for mobile computing using high-level net methods.	Int. J. Softw. Tools Technol. Transf.	2001	DBLP DOI BibTeX RDF	Mobile computing, Reachability analysis, High-level Petri nets
20	Hervé Fournier	Quantifier Rank for Parity of Embedded Finite Models.	MFCS	2001	DBLP DOI BibTeX RDF	Ehrenfeucht-Fraïssé games, Uniform Quantifier Elimination, Connectivity, Reachability, Parity, Constraint databases
20	Thomas W. Reps	Undecidability of context-sensitive data-independence analysis.	ACM Trans. Program. Lang. Syst.	2000	DBLP DOI BibTeX RDF	?, context-sensitive program-analysis, graph-reachability problem, linear matche-parenthesis language, structure-transmitted data-dependence, dependence analysis, control-flow analysis, set constraints, set-based analysis
20	Roberto Bruni, Ugo Montanari	Executing Transactions in Zero-Safe Nets.	ICATPN	2000	DBLP DOI BibTeX RDF	PT nets, zero-safe nets, net unfolding, reachability, distributed transactions
20	Oleg Botchkarev, Stavros Tripakis	Verification of Hybrid Systems with Linear Differential Inclusions Using Ellipsoidal Approximations.	HSCC	2000	DBLP DOI BibTeX RDF	ellipsoidal approximations, verification, hybrid systems, reachability analysis
20	Peter Buchholz 0001	Hierarchical Structuring of Superposed GSPNs.	IEEE Trans. Software Eng.	1999	DBLP DOI BibTeX RDF	Superposed GSPNs, structured matrix representation, reachability analysis, numerical analysis, equivalence
20	Karsten Strehl	Interval Diagrams: Increasing Efficiency of Symbolic Real-Time Verification.	RTCSA	1999	DBLP DOI BibTeX RDF	timed reachability analysis, real-time symbolic model checking, Formal verification, timed automata, binary decision diagrams
20	Jens Knoop	Formal Callability and Its Relevance and Application to Interprocedural Data-Flow Analysis.	ICCL	1998	DBLP DOI BibTeX RDF	Formal callability, formal reachability, call graph analysis, program optimization, interprocedural data-flow analysis
20	Jeff Magee, Jeff Kramer, Dimitra Giannakopoulou	Analysing the behaviour of distributed software architectures: a case study.	FTDCS	1997	DBLP DOI BibTeX RDF	distributed software architecture, software behaviour analysis, behavioural specifications, compositional reachability analysis, composite system models, active badge system, distributed processing, case study, software components, labelled transition systems
20	Sol M. Shatz, Shengru Tu, Tadao Murata, Sastry Duri	An Application of Petri Net Reduction for Ada Tasking Deadlock Analysis.	IEEE Trans. Parallel Distributed Syst.	1996	DBLP DOI BibTeX RDF	deadlock analysis, net reduction, concurrent software, Petri nets, reachability analysis, Ada tasking
20	Eric Y. T. Juan, Jeffrey J. P. Tsai, Tadao Murata	A new compositional method for condensed state-space verification.	HASE	1996	DBLP DOI BibTeX RDF	compositional method, condensed state-space verification, large-scale systems analysis, condensation rules, tightly coupled modules, reachable marking detection, Petri nets, program verification, reachability analysis, concurrent systems, compositional verification, deadlock detection, dynamic behavior, dynamic properties, state space explosion
20	Kyo Chul Kang, Kwang-Il Ko	Formalization and Verification of Safety Properties of Statechart Specifications.	APSEC	1996	DBLP DOI BibTeX RDF	real-time system, temporal logic, Statecharts, safety property, specification technique, reachability graph
20	Roberta Mancini	Interacting with a visual editor.	AVI	1996	DBLP DOI BibTeX RDF	visual editor, formal model, reachability, undo, visual query system
20	Tino Pyssysalo, Leo Ojala	Causal Modeling of a Video-on-Demand System Using Predicate/Transition Net Formalism.	EUROMICRO	1996	DBLP DOI BibTeX RDF	high-level net model, bunching property, resource allocation mechanism, request service, refusal by choice feature, predicate/transition net formalism, stochastic net theoretical methods, time formalisms, performance analysis, reachability analysis, interactive television, parallel machine scheduling, causal modeling, FIFO queues, video-on-demand system
20	Gang Luo, Gregor von Bochmann, Alexandre Petrenko	Test Selection Based on Communicating Nondeterministic Finite-State Machines Using a Generalized WP-Method.	IEEE Trans. Software Eng.	1994	DBLP DOI BibTeX RDF	communicating nondeterministic finite-state machines, generalized Wp-method, conformance relation, trace-equivalence, deterministic finite-state machines, software engineering, software engineering, protocols, software testing, finite state machines, specification languages, program testing, concurrent programs, communication protocols, fault coverage, conformance testing, programming theory, SDL, reachability analysis, test suites, multiprocessing programs, test selection, protocol engineering, test sequence generation, protocol conformance testing
20	Jörg Desel	Proving Non-Reachabililty by Modulo-Place-Invariants.	FSTTCS	1994	DBLP DOI BibTeX RDF	Petri nets, Invariants, Reachability analysis
20	Yigang Chen, Wei-Tek Tsai, Daniel Y. Chao	Dependency Analysis - A Petri-Net-Based Technique for Synthesizing Large Concurrent Systems.	IEEE Trans. Parallel Distributed Syst.	1993	DBLP DOI BibTeX RDF	computational complexity, computational complexity, parallel processing, Petri nets, liveness, concurrent systems, reachability, boundedness, dependency relations, Petrinets
20	Yannis E. Ioannidis, Raghu Ramakrishnan 0001, Linda Winger	Transitive Closure Algorithms Based on Graph Traversal.	ACM Trans. Database Syst.	1993	DBLP DOI BibTeX RDF	node reachability, transitive closure, depth-first search, path computations
20	Richard Gerber 0001, Insup Lee 0001	A Layered Approach to Automating the Verification of Real-Time Systems.	IEEE Trans. Software Eng.	1992	DBLP DOI BibTeX RDF	CSR Application Language, high-level language constructs, periodic processes, configuration schema, CCSR process algebra, resource-based computation model, prioritized transition system, reachability analyzer, CCSR semantics, exception state, multisensor robot example, calculus of communicating systems, real-time systems, real-time systems, verification, formal specification, formal verification, specification, exception handling, exception handling, interrupts, correctness, deadlines, high level languages, timeouts, communication links, system resources, layered approach
20	Gerard Florin, Stéphane Natkin	Generalization of Queueing Network Product Form Solutions to Stochastic Petri Nets.	IEEE Trans. Software Eng.	1991	DBLP DOI BibTeX RDF	queueing network product form solutions, closed synchronized queuing networks, Markov stochastic Petri net, strongly connected reachability graph, constant firing rates, Gordon-Newell theorem, performance evaluation, performance evaluation, Petri nets, queueing theory, stochastic Petri nets, matrix products, steady-state probability
20	Sol M. Shatz, Khanh Mai, Christopher Black, Shengru Tu	Design and Implementation of a Petri Net Based Toolkit for Ada Tasking Analysis.	IEEE Trans. Parallel Distributed Syst.	1990	DBLP DOI BibTeX RDF	Ada tasking analysis, analysis framework, tasking-oriented toolkit for the Ada language, TOTAL, front-end translator subsystem, FETS, back-end information display subsystem, Ada-net reachability graphs, Petri net, Petri nets, Ada, software tools, query, toolkit, utility, BIDS, Ada tasking
20	Jonathan S. Ostroff	Deciding Properties of Timed Transition Models.	IEEE Trans. Parallel Distributed Syst.	1990	DBLP DOI BibTeX RDF	parallel program design, timed transition models, finite-state TTM, system reachability graph, eventuality, real-time response specifications, real-time systems, formal specification, parallel programming, petri nets, invariance, decidability, programming theory, decision procedures, formal logic, precedence, real-time temporal logic
20	Reg G. Willson, Bruce H. Krogh	Petri Net Tools for the Specification and Analysis of Discrete Controllers.	IEEE Trans. Software Eng.	1990	DBLP DOI BibTeX RDF	Petri net tools, discrete controllers, discrete-state systems, rule-based state-variable-specification formalism, interconnected state machines, reduced reachability graphs, discrete manufacturing systems, modeling, formal specification, Petri nets, specification, controllers, computerised control, discrete systems
20	Jonathan Billington, Geoffrey R. Wheeler, Michael C. Wilbur-Ham	PROTEAN: A High-Level Petri Net Tool for the Specification and Verification of Communication Protocols.	IEEE Trans. Software Eng.	1988	DBLP DOI BibTeX RDF	PROTEAN, high-level Petri net tool, numerical Petri nets, textual interfaces, exhaustive reachability analysis, directed graph analysis, engineering workstation, verification, protocols, specification, software tools, finite state machines, specification languages, directed graphs, communication protocols, finite automata, graphical interfaces, interactive simulation
20	Ching-Hua Chow, Simon S. Lam	PROSPEC: An Interactive Programming Environment for Designing and Verifying Communication Protocols.	IEEE Trans. Software Eng.	1988	DBLP DOI BibTeX RDF	communication protocols verification, PROSPEC, interactive programming environment, fair reachability analysis, multiphase construction, protocol projection, BSC, X.21, X.25, Telnet document transfer protocols, protocols, specification, software tools, programming environments, graphical interface, interactive programming
20	Sudhir Aggarwal, Daniel Barbará, Kalman Z. Meth	A Software Environment for the Specification and Analysis of Problems of Coordination and Concurrency.	IEEE Trans. Software Eng.	1988	DBLP DOI BibTeX RDF	SPANNER software environment, selection/resolution model, cluster variables, simulation, parallel programming, concurrency, distributed computing, specification, coordination, distributed processing, programming environments, concurrent programming, reachability analysis, software environment, dining philosophers, finite-state machine model
19	Nathalie Bertrand 0001, Blaise Genest, Hugo Gimbert	Qualitative Determinacy and Decidability of Stochastic Games with Signals.	LICS	2009	DBLP DOI BibTeX RDF
19	Hervé Baumann, Pierluigi Crescenzi, Pierre Fraigniaud	Parsimonious flooding in dynamic graphs.	PODC	2009	DBLP DOI BibTeX RDF	evolving graphs, broadcasting, gossip protocol, epidemic protocol
19	Theophilus Benson, Aditya Akella, David A. Maltz	Mining policies from enterprise network configuration.	Internet Measurement Conference	2009	DBLP DOI BibTeX RDF	configuration management
19	Hongzhi Wang 0001, Jianzhong Li 0001, Wei Wang 0011, Xuemin Lin 0001	Coding-based Join Algorithms for Structural Queries on Graph-Structured XML Document.	World Wide Web	2008	DBLP DOI BibTeX RDF	subgraph query, XML, query processing, coding, structural join
19	Xenofon D. Koutsoukos, Derek Riley	Computational Methods for Verification of Stochastic Hybrid Systems.	IEEE Trans. Syst. Man Cybern. Part A	2008	DBLP DOI BibTeX RDF
19	Emilie Balland, Yohan Boichut, Thomas Genet, Pierre-Etienne Moreau	Towards an Efficient Implementation of Tree Automata Completion.	AMAST	2008	DBLP DOI BibTeX RDF
19	Changhoon Kim, Alexandre Gerber, Carsten Lund, Dan Pei, Subhabrata Sen	Scalable VPN routing via relaying.	SIGMETRICS	2008	DBLP DOI BibTeX RDF	optimization, routing, measurement, VPN
19	Mani Swaminathan, Martin Fränzle, Joost-Pieter Katoen	The Surprising Robustness of (Closed) Timed Automata against Clock-Drift.	IFIP TCS	2008	DBLP DOI BibTeX RDF
19	Alberto Casagrande, Pietro Corvaja, Carla Piazza, Bud Mishra	Composing Semi-algebraic O-Minimal Automata.	HSCC	2007	DBLP DOI BibTeX RDF
19	El maati Chabbar, Mohamed Bouhdadi	On Verification of Communicating Finite State Machines Using Residual Languages.	Asia International Conference on Modelling and Simulation	2007	DBLP DOI BibTeX RDF
19	Davide D'Aprile, Susanna Donatelli, Arnaud Sangnier, Jeremy Sproston	From Time Petri Nets to Timed Automata: An Untimed Approach.	TACAS	2007	DBLP DOI BibTeX RDF
19	Mani Swaminathan, Martin Fränzle	A Symbolic Decision Procedure for Robust Safety of Timed Systems.	TIME	2007	DBLP DOI BibTeX RDF
19	Andrew S. Miner	Saturation for a General Class of Models.	IEEE Trans. Software Eng.	2006	DBLP DOI BibTeX RDF	Model checking, stochastic analysis
19	Hans Hüttel, Jirí Srba	Decidability Issues for Extended Ping-Pong Protocols.	J. Autom. Reason.	2006	DBLP DOI BibTeX RDF	replication, cryptographic protocols, formal modelling, recursion
19	Gordon J. Pace, Gerardo Schneider	A Compositional Algorithm for Parallel Model Checking of Polygonal Hybrid Systems.	ICTAC	2006	DBLP DOI BibTeX RDF
19	Amit Sasturkar, Ping Yang 0002, Scott D. Stoller, C. R. Ramakrishnan 0001	Policy Analysis for Administrative Role Based Access Control.	CSFW	2006	DBLP DOI BibTeX RDF
19	Stéphanie Delaune, Pascal Lafourcade 0001, Denis Lugiez, Ralf Treinen	Symbolic Protocol Analysis in Presence of a Homomorphism Operator and Exclusive Or.	ICALP (2)	2006	DBLP DOI BibTeX RDF
19	Marius Bozga, Radu Iosif, Yassine Lakhnech	Flat Parametric Counter Automata.	ICALP (2)	2006	DBLP DOI BibTeX RDF
19	Frantisek Capkovic	Modelling, Analyzing and Control of Interactions Among Agents in MAS.	International Conference on Computational Science (3)	2006	DBLP DOI BibTeX RDF
19	Srinath Perur, Sridhar Iyer	Characterization of a Connectivity Measure for Sparse Wireless Multi-hop Networks.	ICDCS Workshops	2006	DBLP DOI BibTeX RDF
19	Silvio Ranise, Calogero G. Zarba	A Theory of Singly-Linked Lists and its Extensible Decision Procedure.	SEFM	2006	DBLP DOI BibTeX RDF
19	Rajeev Alur, P. Madhusudan, Wonhong Nam	Symbolic computational techniques for solving games.	Int. J. Softw. Tools Technol. Transf.	2005	DBLP DOI BibTeX RDF	QBF solving, Games, Formal verification, Symbolic model checking, Bounded model checking
19	Jianhua Zhao, Xiuyi Zhou, Xuandong Li, Guoliang Zheng	Compatibility Between Shared Variable Valuations in Timed Automaton Network Model-Checking.	IPDPS	2005	DBLP DOI BibTeX RDF
19	Andreas Blass, Yuri Gurevich, Lev Nachmanson, Margus Veanes	Play to Test.	FATES	2005	DBLP DOI BibTeX RDF
19	Jin Guo, Mingyuan Liu, Lifang Liu	Research on the Performance Analysis of the Concurrent System.	PDCAT	2005	DBLP DOI BibTeX RDF
19	Victor Khomenko, Maciej Koutny, Alexandre Yakovlev	Logic Synthesis for Asynchronous Circuits Based on Petri Net Unfoldings and Incremental SAT.	ACSD	2004	DBLP DOI BibTeX RDF	net unfoldings, partial order techniques, Petri nets, logic synthesis, asynchronous circuits, SAT, signal transition graphs, STG, self-timed circuits
19	François Laroussinie, Nicolas Markey, Philippe Schnoebelen	Model Checking Timed Automata with One or Two Clocks.	CONCUR	2004	DBLP DOI BibTeX RDF
19	Jérôme Leroux, Grégoire Sutre	On Flatness for 2-Dimensional Vector Addition Systems with States.	CONCUR	2004	DBLP DOI BibTeX RDF
19	Debashis Sahoo, Subramanian K. Iyer, Jawahar Jain, Christian Stangier, Amit Narayan, David L. Dill, E. Allen Emerson	A Partitioning Methodology for BDD-Based Verification.	FMCAD	2004	DBLP DOI BibTeX RDF
19	Yann Thierry-Mieg, Claude Dutheillet, Isabelle Mounier	Automatic Symmetry Detection in Well-Formed Nets.	ICATPN	2003	DBLP DOI BibTeX RDF	Well-Formed Petri nets, partial symmetry, symbolic model-checking, symmetry detection
19	Rajeev Alur, Salvatore La Torre, P. Madhusudan	Modular Strategies for Recursive Game Graphs.	TACAS	2003	DBLP DOI BibTeX RDF
19	Hsu-Chun Yen, Lien-Po Yu	Petri Nets with Simple Circuits.	COCOON	2003	DBLP DOI BibTeX RDF
19	Jianhua Zhao, Xuandong Li, Tao Zheng, Guoliang Zheng	Removing Irrelevant Atomic Formulas for Checking Timed Automata Efficiently.	FORMATS	2003	DBLP DOI BibTeX RDF
19	Aleksander Malnic, Dragan Marusic, Norbert Seifter, Boris Zgrablic	Highly Arc-Transitive Digraphs With No Homomorphism Onto Z.	Comb.	2002	DBLP DOI BibTeX RDF	AMS Subject Classification (2000) Classes: 05C25, 05C20
19	Yiorgos Makris, Jamison Collins, Alex Orailoglu	Fast Hierarchical Test Path Construction for Circuits with DFT-Free Controller-Datapath Interface.	J. Electron. Test.	2002	DBLP DOI BibTeX RDF	controller-datapath circuit, hierarchical test path, influence tables, transparency