Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
23 | Liam Roditty, Uri Zwick |
Improved Dynamic Reachability Algorithms for Directed Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 43rd Symposium on Foundations of Computer Science (FOCS 2002), 16-19 November 2002, Vancouver, BC, Canada, Proceedings, pp. 679-, 2002, IEEE Computer Society, 0-7695-1822-2. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
23 | Oscar H. Ibarra, Zhe Dang |
On Removing the Pushdown Stack in Reachability Constructions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: Algorithms and Computation, 12th International Symposium, ISAAC 2001, Christchurch, New Zealand, December 19-21, 2001, Proceedings, pp. 244-256, 2001, Springer, 3-540-42985-9. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
23 | Kim Guldstrand Larsen, Gerd Behrmann, Ed Brinksma, Ansgar Fehnker, Thomas Hune, Paul Pettersson, Judi Romijn |
As Cheap as Possible: Efficient Cost-Optimal Reachability for Priced Timed Automata. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CAV ![In: Computer Aided Verification, 13th International Conference, CAV 2001, Paris, France, July 18-22, 2001, Proceedings, pp. 493-505, 2001, Springer, 3-540-42345-1. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
23 | Zhe Dang |
Binary Reachability Analysis of Pushdown Timed Automata with Dense Clocks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CAV ![In: Computer Aided Verification, 13th International Conference, CAV 2001, Paris, France, July 18-22, 2001, Proceedings, pp. 506-518, 2001, Springer, 3-540-42345-1. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
23 | Gerd Behrmann, Ansgar Fehnker, Thomas Hune, Kim Guldstrand Larsen, Paul Pettersson, Judi Romijn, Frits W. Vaandrager |
Minimum-Cost Reachability for Priced Timed Automata. ![Search on Bibsonomy](Pics/bibsonomy.png) |
HSCC ![In: Hybrid Systems: Computation and Control, 4th International Workshop, HSCC 2001, Rome, Italy, March 28-30, 2001, Proceedings, pp. 147-161, 2001, Springer, 3-540-41866-0. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
Optimization, Algorithms, Verification, Data Structures, Timed Automata |
23 | Eugene Asarin, Gerardo Schneider, Sergio Yovine |
On the Decidability of the Reachability Problem for Planar Differential Inclusions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
HSCC ![In: Hybrid Systems: Computation and Control, 4th International Workshop, HSCC 2001, Rome, Italy, March 28-30, 2001, Proceedings, pp. 89-104, 2001, Springer, 3-540-41866-0. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
23 | Keijo Heljanko |
Bounded Reachability Checking with Process Semantics. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CONCUR ![In: CONCUR 2001 - Concurrency Theory, 12th International Conference, Aalborg, Denmark, August 20-25, 2001, Proceedings, pp. 218-232, 2001, Springer, 3-540-42497-0. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
23 | Gerardo Lafferriere, Christopher Lee Miller |
Uniform Reachability Algorithms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
HSCC ![In: Hybrid Systems: Computation and Control, Third International Workshop, HSCC 2000, Pittsburgh, PA, USA, March 23-25, 2000, Proceedings, pp. 215-228, 2000, Springer, 3-540-67259-1. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
23 | Oscar H. Ibarra |
Reachability and Safety in Queue Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CIAA ![In: Implementation and Application of Automata, 5th International Conference, CIAA 2000, London, Ontario, Canada, July 24-25, 2000, Revised Papers, pp. 145-156, 2000, Springer, 3-540-42491-1. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
23 | Alain Finkel, Grégoire Sutre |
Decidability of Reachability Problems for Classes of Two Counters Automata. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: STACS 2000, 17th Annual Symposium on Theoretical Aspects of Computer Science, Lille, France, February 2000, Proceedings, pp. 346-357, 2000, Springer, 3-540-67141-2. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
23 | Aarti Gupta, Zijiang Yang 0006, Pranav Ashar, Anubhav Gupta 0001 |
SAT-Based Image Computation with Application in Reachability Analysis. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FMCAD ![In: Formal Methods in Computer-Aided Design, Third International Conference, FMCAD 2000, Austin, Texas, USA, November 1-3, 2000, Proceedings, pp. 354-371, 2000, Springer, 3-540-41219-0. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
23 | Patrice Boisieau, Olivier F. Roux |
Splitting reachability analysis in hybrid automata. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ECRTS ![In: 11th Euromicro Conference on Real-Time Systems (ECRTS 1999), 9-11 June 1999, York, England, UK, Proceedings, pp. 98-105, 1999, IEEE Computer Society, 0-7695-0240-7. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
23 | Andrew S. Miner, Gianfranco Ciardo |
Efficient Reachability Set Generation and Storage Using Decision Diagrams. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICATPN ![In: Application and Theory of Petri Nets 1999, 20th International Conference, ICATPN '99, Williamsburg, Virginia, USA, June 21-25, 1999, Proceedings, pp. 6-25, 1999, Springer, 3-540-66132-8. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
23 | Jörg Preußig, Olaf Stursberg, Stefan Kowalewski |
Reachability Analysis of a Class of Switched Continuous Systems by Integrating Rectangular Approximation and Rectangular Analysis. ![Search on Bibsonomy](Pics/bibsonomy.png) |
HSCC ![In: Hybrid Systems: Computation and Control, Second International Workshop, HSCC'99, Berg en Dal, The Netherlands, March 29-31, 1999, Proceedings, pp. 209-222, 1999, Springer, 3-540-65734-7. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
23 | Mark R. Greenstreet, Ian Mitchell 0001 |
Reachability Analysis Using Polygonal Projections. ![Search on Bibsonomy](Pics/bibsonomy.png) |
HSCC ![In: Hybrid Systems: Computation and Control, Second International Workshop, HSCC'99, Berg en Dal, The Netherlands, March 29-31, 1999, Proceedings, pp. 103-116, 1999, Springer, 3-540-65734-7. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
23 | Béatrice Bérard, Laurent Fribourg |
Reachability Analysis of (Timed) Petri Nets Using Real Arithmetic. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CONCUR ![In: CONCUR '99: Concurrency Theory, 10th International Conference, Eindhoven, The Netherlands, August 24-27, 1999, Proceedings, pp. 178-193, 1999, Springer, 3-540-66425-4. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
23 | Jerzy Marcinkowski |
Directed Reachability: From Ajtai-Fagin to Ehrenfeucht-Fraïssé Games. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CSL ![In: Computer Science Logic, 13th International Workshop, CSL '99, 8th Annual Conference of the EACSL, Madrid, Spain, September 20-25, 1999, Proceedings, pp. 338-349, 1999, Springer, 3-540-66536-6. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
23 | Stephen J. H. Yang, Sam Lin, Jonathan Lee, William C. Chu |
Specifying and Verifying Temporal Behavior of High Assurance Systems Using Reachability Tree Logic. ![Search on Bibsonomy](Pics/bibsonomy.png) |
HASE ![In: 3rd IEEE International Symposium on High-Assurance Systems Engineering (HASE '98), 13-14 November 1998, Washington, D.C, USA, Proceedings, pp. 150-157, 1998, IEEE Computer Society, 0-8186-9221-9. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
verification, formal methods, Petri nets, specification, temporal logic, High assurance systems |
23 | Harald Ganzinger, Florent Jacquemard, Margus Veanes |
Rigid Reachability. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ASIAN ![In: Advances in Computing Science - ASIAN '98, 4th Asian Computing Science Conference, Manila, The Philippines, December 8-10, 1998, Proceedings, pp. 4-21, 1998, Springer, 3-540-65388-0. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
|
23 | Kimmo Varpaaniemi, Keijo Heljanko, Johan Lilius |
prod 3.2: An Advanced Tool for Efficient Reachability Analysis. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CAV ![In: Computer Aided Verification, 9th International Conference, CAV '97, Haifa, Israel, June 22-25, 1997, Proceedings, pp. 472-475, 1997, Springer, 3-540-63166-6. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
|
23 | Jean-Michel Ilié, Khalil Ajami |
Model Checking Through Symbolic Reachability Graph. ![Search on Bibsonomy](Pics/bibsonomy.png) |
TAPSOFT ![In: TAPSOFT'97: Theory and Practice of Software Development, 7th International Joint Conference CAAP/FASE, Lille, France, April 14-18, 1997, Proceedings, pp. 213-224, 1997, Springer, 3-540-62781-2. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
|
23 | Ahmed Bouajjani, Peter Habermehl |
Symbolic Reachability Analysis of FIFO Channel Systems with Nonregular Sets of Configurations (Extended Abstract). ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 24th International Colloquium, ICALP'97, Bologna, Italy, 7-11 July 1997, Proceedings, pp. 560-570, 1997, Springer, 3-540-63165-8. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
|
23 | Keith P. Pomakis, Joanne M. Atlee |
Reachability Analysis of Feature Interactions: A Progress Report. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISSTA ![In: Proceedings of the 1996 International Symposium on Software Testing and Analysis, ISSTA 1996, San Diego, CA, USA, January 8-10, 1996, pp. 216-223, 1996, ACM, 0-89791-787-1. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
|
23 | Karsten Schmidt 0004 |
Parameterized Reachability Trees for Algebraic Petri Nets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Application and Theory of Petri Nets ![In: Application and Theory of Petri Nets 1995, 16th International Conference, Turin, Italy, June 26-30, 1995, Proceedings, pp. 392-411, 1995, Springer, 3-540-60029-9. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
Analysis of higher-level net models |
23 | Kavita Ravi, Fabio Somenzi |
High-density reachability analysis. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICCAD ![In: Proceedings of the 1995 IEEE/ACM International Conference on Computer-Aided Design, ICCAD 1995, San Jose, California, USA, November 5-9, 1995, pp. 154-158, 1995, IEEE Computer Society / ACM, 0-8186-7213-7. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
|
23 | Farn Wang |
Reachability Analysis at Procedure Level through Timing Coincidence. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CONCUR ![In: CONCUR '95: Concurrency Theory, 6th International Conference, Philadelphia, PA, USA, August 21-24, 1995, Proceedings, pp. 284-298, 1995, Springer, 3-540-60218-6. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
|
23 | Oded Maler, Amir Pnueli |
Reachability Analysis of Planar Multi-limear Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CAV ![In: Computer Aided Verification, 5th International Conference, CAV '93, Elounda, Greece, June 28 - July 1, 1993, Proceedings, pp. 194-209, 1993, Springer, 3-540-56922-7. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
|
23 | Alon Y. Levy, Inderpal Singh Mumick, Yehoshua Sagiv, Oded Shmueli |
Equivalence, Query-Reachability, and Satisfiability in Datalog Extensions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PODS ![In: Proceedings of the Twelfth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, May 25-28, 1993, Washington, DC, USA, pp. 109-122, 1993, ACM Press, 0-89791-593-3. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
Datalog |
23 | Anne-Cécile Caron |
Decidability of Reachability and Disjoint Union of Term Rewriting Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CAAP ![In: CAAP '92, 17th Colloquium on Trees in Algebra and Programming, Rennes, France, February 26-28, 1992, Proceedings, pp. 86-101, 1992, Springer, 3-540-55251-0. The full citation details ...](Pics/full.jpeg) |
1992 |
DBLP DOI BibTeX RDF |
|
23 | Fuchun J. Lin, P. M. Chu, Ming T. Liu |
Protocol verification using reachability analysis: the state space explosion problem and relief strategies. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. Commun. Rev. ![In: Comput. Commun. Rev. 17(5), pp. 126-135, 1987. The full citation details ...](Pics/full.jpeg) |
1987 |
DBLP DOI BibTeX RDF |
|
23 | Deborah A. Joseph, W. Harry Plantinga |
On the complexity of reachability and motion planning questions (extended abstract). ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCG ![In: Proceedings of the First Annual Symposium on Computational Geometry, Baltimore, Maryland, USA, June 5-7, 1985, pp. 62-66, 1985, ACM, 0-89791-163-6. The full citation details ...](Pics/full.jpeg) |
1985 |
DBLP DOI BibTeX RDF |
|
23 | Horst Müller |
Decidability of Reachability in Persistent Vector Replacement Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: Mathematical Foundations of Computer Science 1980 (MFCS'80), Proceedings of the 9th Symposium, Rydzyna, Poland, September 1-5, 1980, pp. 426-438, 1980, Springer, 3-540-10027-X. The full citation details ...](Pics/full.jpeg) |
1980 |
DBLP DOI BibTeX RDF |
|
23 | J. M. Barzdin |
The Problem of Reachability and Verification of Programs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: Mathematical Foundations of Computer Science 1979, Proceedings, 8th Symposium, Olomouc, Czechoslovakia, September 3-7, 1979, pp. 13-25, 1979, Springer, 0-387-09526-8. The full citation details ...](Pics/full.jpeg) |
1979 |
DBLP DOI BibTeX RDF |
|
21 | Jason J. Choi, Donggun Lee, Boyang Li, Jonathan P. How, Koushil Sreenath, Sylvia L. Herbert, Claire J. Tomlin |
A Forward Reachability Perspective on Robust Control Invariance and Discount Factors in Reachability Analysis. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2310.17180, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
21 | Honglu Sun, Maxime Folschette, Morgan Magnin |
Reachability Analysis of a Class of Hybrid Gene Regulatory Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RP ![In: Reachability Problems - 17th International Conference, RP 2023, Nice, France, October 11-13, 2023, Proceedings, pp. 56-69, 2023, Springer, 978-3-031-45285-7. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
21 | Thomas Brihaye, Aline Goeminne |
Multi-weighted Reachability Games. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RP ![In: Reachability Problems - 17th International Conference, RP 2023, Nice, France, October 11-13, 2023, Proceedings, pp. 85-97, 2023, Springer, 978-3-031-45285-7. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
21 | Adrian Wurm |
Complexity of Reachability Problems in Neural Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RP ![In: Reachability Problems - 17th International Conference, RP 2023, Nice, France, October 11-13, 2023, Proceedings, pp. 15-27, 2023, Springer, 978-3-031-45285-7. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
21 | Thomas Brihaye, Véronique Bruyère, Gaspard Reghem |
Quantitative Reachability Stackelberg-Pareto Synthesis Is NEXPTIME-Complete. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RP ![In: Reachability Problems - 17th International Conference, RP 2023, Nice, France, October 11-13, 2023, Proceedings, pp. 70-84, 2023, Springer, 978-3-031-45285-7. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
21 | Zhaokai Li, Zhanyou Ma, Xia Li, Yingnan Gao |
A Method Converting Multi-Properties Objective Reachability Problems to Multi-Objective Sets Reachability Problems over FKS. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Symmetry ![In: Symmetry 14(11), pp. 2278, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
21 | Lilla Tóthmérész |
Rotor-routing reachability is easy, chip-firing reachability is hard. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Eur. J. Comb. ![In: Eur. J. Comb. 101, pp. 103466, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
21 | Kazuyuki Asada, Hiroyuki Katsura, Naoki Kobayashi 0001 |
On Higher-Order Reachability Games vs May Reachability. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2203.08416, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
21 | Michele Boreale, Luisa Collodi |
Linearization, Model Reduction and Reachability in Nonlinear odes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RP ![In: Reachability Problems - 16th International Conference, RP 2022, Kaiserslautern, Germany, October 17-21, 2022, Proceedings, pp. 49-66, 2022, Springer, 978-3-031-19134-3. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
21 | Wei Liao, Xiaohui Wei, Jizhou Lai |
Cost-limited reachability: a new problem in reachability analysis. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2101.09646, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP BibTeX RDF |
|
21 | Elena Vladislavivna Strzheletska, Vassilis J. Tsotras |
Reachability and Top-k Reachability Queries with Transfer Decay. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2105.08312, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP BibTeX RDF |
|
21 | Marcelo Forets, Christian Schilling 0001 |
Reachability of Weakly Nonlinear Systems Using Carleman Linearization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RP ![In: Reachability Problems - 15th International Conference, RP 2021, Liverpool, UK, October 25-27, 2021, Proceedings, pp. 85-99, 2021, Springer, 978-3-030-89715-4. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
21 | Georg Zetzsche |
Recent Advances on Reachability Problems for Valence Systems (Invited Talk). ![Search on Bibsonomy](Pics/bibsonomy.png) |
RP ![In: Reachability Problems - 15th International Conference, RP 2021, Liverpool, UK, October 25-27, 2021, Proceedings, pp. 52-65, 2021, Springer, 978-3-030-89715-4. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
21 | Marco Sälzer, Martin Lange |
Reachability is NP-Complete Even for the Simplest Neural Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RP ![In: Reachability Problems - 15th International Conference, RP 2021, Liverpool, UK, October 25-27, 2021, Proceedings, pp. 149-164, 2021, Springer, 978-3-030-89715-4. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
21 | Ana L. Milanova |
FlowCFL: generalized type-based reachability analysis: graph reduction and equivalence of CFL-based and type-based reachability. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Proc. ACM Program. Lang. ![In: Proc. ACM Program. Lang. 4(OOPSLA), pp. 178:1-178:29, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
21 | Sergiy Bogomolov, Marcelo Forets, Kostiantyn Potomkin |
Case Study: Reachability and Scalability in a Unified Combat-Command-and-Control Model. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RP ![In: Reachability Problems - 14th International Conference, RP 2020, Paris, France, October 19-21, 2020, Proceedings, pp. 52-66, 2020, Springer, 978-3-030-61738-7. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
21 | Kousha Etessami, Emanuel Martinov |
Qualitative Multi-objective Reachability for Ordered Branching MDPs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RP ![In: Reachability Problems - 14th International Conference, RP 2020, Paris, France, October 19-21, 2020, Proceedings, pp. 67-82, 2020, Springer, 978-3-030-61738-7. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
21 | Shruti Biswal, Andrew S. Miner |
Reachability Set Generation Using Hybrid Relation Compatible Saturation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RP ![In: Reachability Problems - 14th International Conference, RP 2020, Paris, France, October 19-21, 2020, Proceedings, pp. 37-51, 2020, Springer, 978-3-030-61738-7. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
21 | Ventsislav Chonev |
Reachability in Augmented Interval Markov Chains. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RP ![In: Reachability Problems - 13th International Conference, RP 2019, Brussels, Belgium, September 11-13, 2019, Proceedings, pp. 79-92, 2019, Springer, 978-3-030-30805-6. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
21 | Andrei Sandler, Olga Tveretina |
Deciding Reachability for Piecewise Constant Derivative Systems on Orientable Manifolds. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RP ![In: Reachability Problems - 13th International Conference, RP 2019, Brussels, Belgium, September 11-13, 2019, Proceedings, pp. 178-192, 2019, Springer, 978-3-030-30805-6. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
21 | Hans van Ditmarsch, Malvin Gattinger, Ioannis Kokkinis, Louwe B. Kuijer |
Reachability of Five Gossip Protocols. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RP ![In: Reachability Problems - 13th International Conference, RP 2019, Brussels, Belgium, September 11-13, 2019, Proceedings, pp. 218-231, 2019, Springer, 978-3-030-30805-6. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
21 | Thomas Brihaye, Véronique Bruyère, Aline Goeminne, Nathan Thomasset |
On Relevant Equilibria in Reachability Games. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RP ![In: Reachability Problems - 13th International Conference, RP 2019, Brussels, Belgium, September 11-13, 2019, Proceedings, pp. 48-62, 2019, Springer, 978-3-030-30805-6. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
21 | Chris Köcher |
Reachability Problems on Partially Lossy Queue Automata. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RP ![In: Reachability Problems - 13th International Conference, RP 2019, Brussels, Belgium, September 11-13, 2019, Proceedings, pp. 149-163, 2019, Springer, 978-3-030-30805-6. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
21 | Dan You, Shouguang Wang, Wenhui Wu |
An Algorithm of Recognizing Unbounded Petri Nets With Semilinear Reachability Sets and Constructing Their Reachability Trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Access ![In: IEEE Access 6, pp. 43732-43742, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
21 | Shouguang Wang, Dan You, Mengchu Zhou |
New reachability trees for analyzing unbounded Petri nets with semilinear reachability sets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Sci. China Inf. Sci. ![In: Sci. China Inf. Sci. 61(12), pp. 129104:1-129104:3, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
21 | Julien Alexandre Dit Sandretto, Jian Wan 0002 |
Reachability Analysis of Nonlinear ODEs Using Polytopic Based Validated Runge-Kutta. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RP ![In: Reachability Problems - 12th International Conference, RP 2018, Marseille, France, September 24-26, 2018, Proceedings, pp. 1-14, 2018, Springer, 978-3-030-00249-7. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
21 | Jeremy Sproston |
Qualitative Reachability for Open Interval Markov Chains. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RP ![In: Reachability Problems - 12th International Conference, RP 2018, Marseille, France, September 24-26, 2018, Proceedings, pp. 146-160, 2018, Springer, 978-3-030-00249-7. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
21 | Ziyue Ma, Yin Tong, Zhiwu Li 0001, Alessandro Giua |
Basis Marking Representation of Petri Net Reachability Spaces and Its Application to the Reachability Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Autom. Control. ![In: IEEE Trans. Autom. Control. 62(3), pp. 1078-1093, 2017. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
21 | Reino Niskanen |
Reachability Problem for Polynomial Iteration Is PSPACE-complete. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RP ![In: Reachability Problems - 11th International Workshop, RP 2017, London, UK, September 7-9, 2017, Proceedings, pp. 132-143, 2017, Springer, 978-3-319-67088-1. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
21 | Giorgio Delzanno |
Reachability Predicates for Graph Assertions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RP ![In: Reachability Problems - 10th International Workshop, RP 2016, Aalborg, Denmark, September 19-21, 2016, Proceedings, pp. 63-76, 2016, Springer, 978-3-319-45993-6. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
21 | Eike Best, Harro Wimmel |
Plain, Bounded, Reversible, Persistent, and k-marked Petri Nets Have Marked Graph Reachability Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RP ![In: Reachability Problems - 10th International Workshop, RP 2016, Aalborg, Denmark, September 19-21, 2016, Proceedings, pp. 51-62, 2016, Springer, 978-3-319-45993-6. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
21 | Fedor Shmarov, Paolo Zuliani |
ProbReach: A Tool for Guaranteed Reachability Analysis of Stochastic Hybrid Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SNR@CAV ![In: 1st International Workshop on Symbolic and Numerical Methods for Reachability Analysis, SNR@CAV 2015, San Francisco, CA, USA, July 19, 2015, pp. 40-48, 2015, EasyChair. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
21 | Sriram Sankaranarayanan 0001 |
Symbolic-Numeric Reachability Analysis of Hybrid Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SNR@CAV ![In: 1st International Workshop on Symbolic and Numerical Methods for Reachability Analysis, SNR@CAV 2015, San Francisco, CA, USA, July 19, 2015, pp. 1, 2015, EasyChair. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
21 | Petr Jancar |
On Reachability-Related Games on Vector Addition Systems with States. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RP ![In: Reachability Problems - 9th International Workshop, RP 2015, Warsaw, Poland, September 21-23, 2015, Proceedings, pp. 50-62, 2015, Springer, 978-3-319-24536-2. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
21 | Paul Hunter |
Reachability in Succinct One-Counter Games. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RP ![In: Reachability Problems - 9th International Workshop, RP 2015, Warsaw, Poland, September 21-23, 2015, Proceedings, pp. 37-49, 2015, Springer, 978-3-319-24536-2. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
21 | Masaya Shimakawa, Shigeki Hagihara, Naoki Yonezaki |
Reducing Bounded Realizability Analysis to Reachability Checking. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RP ![In: Reachability Problems - 9th International Workshop, RP 2015, Warsaw, Poland, September 21-23, 2015, Proceedings, pp. 140-152, 2015, Springer, 978-3-319-24536-2. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
21 | Julian Rathke, Pawel Sobocinski 0001, Owen Stephens |
Compositional Reachability in Petri Nets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RP ![In: Reachability Problems - 8th International Workshop, RP 2014, Oxford, UK, September 22-24, 2014. Proceedings, pp. 230-243, 2014, Springer, 978-3-319-11438-5. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
21 | Arnaud Carayol, Matthew Hague |
Regular Strategies in Pushdown Reachability Games. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RP ![In: Reachability Problems - 8th International Workshop, RP 2014, Oxford, UK, September 22-24, 2014. Proceedings, pp. 58-71, 2014, Springer, 978-3-319-11438-5. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
21 | Gilles Geeraerts, Joël Goossens, Amélie Stainer |
Synthesising Succinct Strategies in Safety and Reachability Games. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RP ![In: Reachability Problems - 8th International Workshop, RP 2014, Oxford, UK, September 22-24, 2014. Proceedings, pp. 98-111, 2014, Springer, 978-3-319-11438-5. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
21 | Hugo Bazille, Olivier Bournez, Walid Gomaa 0001, Amaury Pouly |
On The Complexity of Bounded Time Reachability for Piecewise Affine Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RP ![In: Reachability Problems - 8th International Workshop, RP 2014, Oxford, UK, September 22-24, 2014. Proceedings, pp. 20-31, 2014, Springer, 978-3-319-11438-5. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
21 | Serge Haddad, Benjamin Monmege |
Reachability in MDPs: Refining Convergence of Value Iteration. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RP ![In: Reachability Problems - 8th International Workshop, RP 2014, Oxford, UK, September 22-24, 2014. Proceedings, pp. 125-137, 2014, Springer, 978-3-319-11438-5. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
21 | Paul C. Bell, Shang Chen, Lisa M. Jackson |
Reachability and Mortality Problems for Restricted Hierarchical Piecewise Constant Derivatives. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RP ![In: Reachability Problems - 8th International Workshop, RP 2014, Oxford, UK, September 22-24, 2014. Proceedings, pp. 32-44, 2014, Springer, 978-3-319-11438-5. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
21 | Nils Semmelrock |
Complexity Results for Reachability in Cooperating Systems and Approximated Reachability by Abstract Over-Approximations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
|
2013 |
RDF |
|
21 | Søren Kristoffer Stiil Frederiksen, Peter Bro Miltersen |
Monomial Strategies for Concurrent Reachability Games and Other Stochastic Games. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RP ![In: Reachability Problems - 7th International Workshop, RP 2013, Uppsala, Sweden, September 24-26, 2013 Proceedings, pp. 122-134, 2013, Springer, 978-3-642-41035-2. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
21 | Julien Reichert |
On the Complexity of Counter Reachability Games. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RP ![In: Reachability Problems - 7th International Workshop, RP 2013, Uppsala, Sweden, September 24-26, 2013 Proceedings, pp. 196-208, 2013, Springer, 978-3-642-41035-2. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
21 | Paul C. Bell, Shang Chen |
Reachability Problems for Hierarchical Piecewise Constant Derivative Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RP ![In: Reachability Problems - 7th International Workshop, RP 2013, Uppsala, Sweden, September 24-26, 2013 Proceedings, pp. 46-58, 2013, Springer, 978-3-642-41035-2. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
21 | Akash Lal, Shaz Qadeer |
Reachability Modulo Theories. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RP ![In: Reachability Problems - 7th International Workshop, RP 2013, Uppsala, Sweden, September 24-26, 2013 Proceedings, pp. 23-44, 2013, Springer, 978-3-642-41035-2. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
21 | Kais Klai, Naim Aber, Laure Petrucci |
Verification of Reachability Properties for Time Petri Nets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RP ![In: Reachability Problems - 7th International Workshop, RP 2013, Uppsala, Sweden, September 24-26, 2013 Proceedings, pp. 159-170, 2013, Springer, 978-3-642-41035-2. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
21 | Thomas Schwentick |
The Dynamic Complexity of the Reachability Problem on Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RP ![In: Reachability Problems - 7th International Workshop, RP 2013, Uppsala, Sweden, September 24-26, 2013 Proceedings, pp. 45, 2013, Springer, 978-3-642-41035-2. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
21 | Carlo Bellettini, Matteo Camilli, Lorenzo Capra, Mattia Monga |
MaRDiGraS: Simplified Building of Reachability Graphs on Large Clusters. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RP ![In: Reachability Problems - 7th International Workshop, RP 2013, Uppsala, Sweden, September 24-26, 2013 Proceedings, pp. 83-95, 2013, Springer, 978-3-642-41035-2. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
21 | Luca Benvenuti, Davide Bresolin, Pieter Collins, Alberto Ferrari, Luca Geretti, Tiziano Villa |
Ariadne: Dominance Checking of Nonlinear Hybrid Automata Using Reachability Analysis. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RP ![In: Reachability Problems - 6th International Workshop, RP 2012, Bordeaux, France, September 17-19, 2012. Proceedings, pp. 79-91, 2012, Springer, 978-3-642-33511-2. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
21 | Christoph Haase, Joël Ouaknine, James Worrell 0001 |
On the Relationship between Reachability Problems in Timed and Counter Automata. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RP ![In: Reachability Problems - 6th International Workshop, RP 2012, Bordeaux, France, September 17-19, 2012. Proceedings, pp. 54-65, 2012, Springer, 978-3-642-33511-2. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
21 | Shahab Kaynama, Meeko Oishi, Ian M. Mitchell, Guy Albert Dumont |
The continual reachability set and its computation using maximal reachability techniques. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CDC/ECC ![In: 50th IEEE Conference on Decision and Control and European Control Conference, 11th European Control Conference, CDC/ECC 2011, Orlando, FL, USA, December 12-15, 2011, pp. 6110-6115, 2011, IEEE, 978-1-61284-800-6. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
21 | Xin Chen 0002, Erika Ábrahám, Goran Frehse |
Efficient Bounded Reachability Computation for Rectangular Automata. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RP ![In: Reachability Problems - 5th International Workshop, RP 2011, Genoa, Italy, September 28-30, 2011. Proceedings, pp. 139-152, 2011, Springer, 978-3-642-24287-8. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
21 | Nataliya Skrypnyuk, Flemming Nielson |
Reachability for Finite-State Process Algebras Using Static Analysis. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RP ![In: Reachability Problems - 5th International Workshop, RP 2011, Genoa, Italy, September 28-30, 2011. Proceedings, pp. 231-244, 2011, Springer, 978-3-642-24287-8. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
21 | Christian Eggermont, Gerhard J. Woeginger |
Reachability and Deadlocking Problems in Multi-stage Scheduling. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RP ![In: Reachability Problems - 5th International Workshop, RP 2011, Genoa, Italy, September 28-30, 2011. Proceedings, pp. 153-164, 2011, Springer, 978-3-642-24287-8. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
21 | Fabio Fioravanti, Alberto Pettorossi, Maurizio Proietti, Valerio Senni |
Improving Reachability Analysis of Infinite State Systems by Specialization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RP ![In: Reachability Problems - 5th International Workshop, RP 2011, Genoa, Italy, September 28-30, 2011. Proceedings, pp. 165-179, 2011, Springer, 978-3-642-24287-8. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
21 | Krishnendu Chatterjee |
Graph Games with Reachability Objectives - (Invited Talk). ![Search on Bibsonomy](Pics/bibsonomy.png) |
RP ![In: Reachability Problems - 5th International Workshop, RP 2011, Genoa, Italy, September 28-30, 2011. Proceedings, pp. 1, 2011, Springer, 978-3-642-24287-8. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
21 | Jean-François Raskin |
Reachability Problems for Hybrid Automata. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RP ![In: Reachability Problems - 5th International Workshop, RP 2011, Genoa, Italy, September 28-30, 2011. Proceedings, pp. 28-30, 2011, Springer, 978-3-642-24287-8. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
21 | Roland Axelsson, Martin Lange |
Formal Language Constrained Reachability and Model Checking Propositional Dynamic Logics. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RP ![In: Reachability Problems - 5th International Workshop, RP 2011, Genoa, Italy, September 28-30, 2011. Proceedings, pp. 45-57, 2011, Springer, 978-3-642-24287-8. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
21 | Paulin Jacobé de Naurois, Virgile Mogbil |
Rewriting Systems for Reachability in Vector Addition Systems with Pairs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RP ![In: Reachability Problems, 4th International Workshop, RP 2010, Brno, Czech Republic, August 28-29, 2010. Proceedings, pp. 133-145, 2010, Springer, 978-3-642-15348-8. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
21 | Kim Guldstrand Larsen |
Symbolic and Compositional Reachability for Timed Automata. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RP ![In: Reachability Problems, 4th International Workshop, RP 2010, Brno, Czech Republic, August 28-29, 2010. Proceedings, pp. 24-28, 2010, Springer, 978-3-642-15348-8. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
21 | Fang Wei 0001 |
Efficient Graph Reachability Query Answering Using Tree Decomposition. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RP ![In: Reachability Problems, 4th International Workshop, RP 2010, Brno, Czech Republic, August 28-29, 2010. Proceedings, pp. 183-197, 2010, Springer, 978-3-642-15348-8. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
21 | Jakub Chaloupka |
Z-Reachability Problem for Games on 2-Dimensional Vector Addition Systems with States Is in P. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RP ![In: Reachability Problems, 4th International Workshop, RP 2010, Brno, Czech Republic, August 28-29, 2010. Proceedings, pp. 104-119, 2010, Springer, 978-3-642-15348-8. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
21 | Mohamed Faouzi Atig, Ahmed Bouajjani |
On the Reachability Problem for Dynamic Networks of Concurrent Pushdown Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RP ![In: Reachability Problems, 3rd International Workshop, RP 2009, Palaiseau, France, September 23-25, 2009. Proceedings, pp. 1-2, 2009, Springer, 978-3-642-04419-9. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
21 | Moshe Y. Vardi |
Model Checking as A Reachability Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RP ![In: Reachability Problems, 3rd International Workshop, RP 2009, Palaiseau, France, September 23-25, 2009. Proceedings, pp. 35, 2009, Springer, 978-3-642-04419-9. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
21 | Klaus Reinhardt |
Reachability in Petri Nets with Inhibitor Arcs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RP ![In: Proceedings of the Second Workshop on Reachability Problems in Computational Models, RP 2008, Liverpool, UK, September 15-17, 2008, pp. 239-264, 2008, Elsevier. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|