ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 2007.06248
  4. Cited By
Complexity of Verification and Synthesis of Threshold Automata

Complexity of Verification and Synthesis of Threshold Automata

13 July 2020
A. Balasubramanian
Javier Esparza
Marijana Lazić
ArXivPDFHTML

Papers citing "Complexity of Verification and Synthesis of Threshold Automata"

2 / 2 papers shown
Title
Decidability Issues for Petri Nets -- a survey
Decidability Issues for Petri Nets -- a survey
Javier Esparza
Mogens Nielsen
AI4CE
31
339
0
03 Nov 2024
A Short Counterexample Property for Safety and Liveness Verification of
  Fault-tolerant Distributed Algorithms
A Short Counterexample Property for Safety and Liveness Verification of Fault-tolerant Distributed Algorithms
I. Konnov
Marijana Lazić
H. Veith
Josef Widder
18
76
0
18 Aug 2016
1