Automatic verification of finite-state concurrent systems using temporal logic specifications
ACM Transactions on Programming Languages and Systems (TOPLAS)
A structural induction theorem for processes
Proceedings of the eighth annual ACM Symposium on Principles of distributed computing
Verifying properties of large sets of processes with network invariants
Proceedings of the international workshop on Automatic verification methods for finite state systems
Reduction and covering of infinite reachability trees
Information and Computation
Modeling and Verification of Time Dependent Systems Using Time Petri Nets
IEEE Transactions on Software Engineering
A Unified High-Level Petri Net Formalism for Time-Critical Systems
IEEE Transactions on Software Engineering
Decidability of a temporal logic problem for petri nets
IDTC Second international conference on Database theory
CCS + time = an interleaving model for real time systems
Proceedings of the 18th international colloquium on Automata, languages and programming
Reasoning about systems with many processes
Journal of the ACM (JACM)
An introduction to assertional reasoning for concurrent systems
ACM Computing Surveys (CSUR)
Using partial orders for the efficient verification of deadlock freedom and safety properties
Formal Methods in System Design - Special issue on computer-aided verification: special methods II
Deciding bisimulation equivalences for a class of non-finite-state programs
Information and Computation
Fischer's protocol revisited: a simple proof using modal constraints
Proceedings of the DIMACS/SYCON workshop on Hybrid systems III : verification and control: verification and control
Undecidable verification problems for programs with unreliable channels
Information and Computation
Algorithmic analysis of programs with well quasi-ordered domains
Information and Computation - Special issue: LICS 1996—Part 1
Expressing interesting properties of programs in propositional temporal logic
POPL '86 Proceedings of the 13th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Composition, decomposition and model checking of pushdown processes
Nordic Journal of Computing
Feasibility of Finite and Infinite Paths in Data Dependent Programs
TVER '92 Proceedings of the Second International Symposium on Logical Foundations of Computer Science
Deciding Properties of Integral Relational Automata
ICALP '94 Proceedings of the 21st International Colloquium on Automata, Languages and Programming
Hybrid Automata with Finite Bisimulatioins
ICALP '95 Proceedings of the 22nd International Colloquium on Automata, Languages and Programming
Deciding Finiteness of Petri Nets Up To Bisimulation
ICALP '96 Proceedings of the 23rd International Colloquium on Automata, Languages and Programming
A Compositional Proof of a Real-Time Mutual Exclusion Protocol
TAPSOFT '97 Proceedings of the 7th International Joint Conference CAAP/FASE on Theory and Practice of Software Development
Checking Regular Properties of Petri Nets
CONCUR '95 Proceedings of the 6th International Conference on Concurrency Theory
Veryfying Parameterized Networks using Abstraction and Regular Languages
CONCUR '95 Proceedings of the 6th International Conference on Concurrency Theory
CONCUR '95 Proceedings of the 6th International Conference on Concurrency Theory
Decidability of Bisimulation Equivalence for Normed Pushdown Processes
CONCUR '96 Proceedings of the 7th International Conference on Concurrency Theory
Specification and verification of concurrent systems in CESAR
Proceedings of the 5th Colloquium on International Symposium on Programming
Decidability of Bisimulation Equivalences for Parallel Timer Processes
CAV '92 Proceedings of the Fourth International Workshop on Computer Aided Verification
Verification of Real-Time Systems Using PVS
CAV '93 Proceedings of the 5th International Conference on Computer Aided Verification
Petri Nets, Commutative Context-Free Grammars, and Basic Parallel Processes
FCT '95 Proceedings of the 10th International Symposium on Fundamentals of Computation Theory
Putting Time into Proof Outlines
Proceedings of the Real-Time: Theory in Practice, REX Workshop
An Old-Fashioned Recipe for Real Time
Proceedings of the Real-Time: Theory in Practice, REX Workshop
General decidability theorems for infinite-state systems
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
Constraint-based automatic verification of abstract models of multithreaded programs
Theory and Practice of Logic Programming
Monotonic Abstraction for Programs with Dynamic Memory Heaps
CAV '08 Proceedings of the 20th international conference on Computer Aided Verification
Nets with Tokens which Carry Data
Fundamenta Informaticae - PETRI NETS 2007
Forcing Monotonicity in Parameterized Verification: From Multisets to Words
SOFSEM '10 Proceedings of the 36th Conference on Current Trends in Theory and Practice of Computer Science
Closed, Open, and Robust Timed Networks
Electronic Notes in Theoretical Computer Science (ENTCS)
Automatic verification of multi-queue discrete timed automata
COCOON'03 Proceedings of the 9th annual international conference on Computing and combinatorics
Nets with tokens which carry data
ICATPN'07 Proceedings of the 28th international conference on Applications and theory of Petri nets and other models of concurrency
On the verification of timed ad hoc networks
FORMATS'11 Proceedings of the 9th international conference on Formal modeling and analysis of timed systems
Automated termination in model checking modulo theories
RP'11 Proceedings of the 5th international conference on Reachability problems
Automated symbolic analysis of ARBAC-policies
STM'10 Proceedings of the 6th international conference on Security and trust management
Verification of parameterized timed systems
FORMATS'05 Proceedings of the Third international conference on Formal Modeling and Analysis of Timed Systems
Decidability and complexity results for timed automata via channel machines
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Decidability of zenoness, syntactic boundedness and token-liveness for dense-timed petri nets
FSTTCS'04 Proceedings of the 24th international conference on Foundations of Software Technology and Theoretical Computer Science
Safety metric temporal logic is fully decidable
TACAS'06 Proceedings of the 12th international conference on Tools and Algorithms for the Construction and Analysis of Systems
ICCPS '12 Proceedings of the 2012 IEEE/ACM Third International Conference on Cyber-Physical Systems
Automated analysis of parametric timing-based mutual exclusion algorithms
NFM'12 Proceedings of the 4th international conference on NASA Formal Methods
Nets with Tokens which Carry Data
Fundamenta Informaticae - PETRI NETS 2007
A small model theorem for rectangular hybrid automata networks
FMOODS'12/FORTE'12 Proceedings of the 14th joint IFIP WG 6.1 international conference and Proceedings of the 32nd IFIP WG 6.1 international conference on Formal Techniques for Distributed Systems
Comparing the expressive power of well-structured transition systems
CSL'07/EACSL'07 Proceedings of the 21st international conference, and Proceedings of the 16th annuall conference on Computer Science Logic
Journal of Computer Security - STM'10
Hi-index | 5.24 |
Over the last years there has been an increasing research effort directed towards the automatic verification of infinite state systems, such as timed automata, hybrid automata, data-independent systems, relational automata, Petri nets, lossy channel systems, context-free and push-down processes. We present a method for deciding reachability properties of networks of timed processes. Such a network consists of an arbitrary set of identical timed automata, each with a single real-valued clock. Using a standard reduction from safety properties to reachability properties, we can use our algorithm to decide general safety properties of timed networks. To our knowledge, this is the first decidability result concerning verification of systems that are infinite-state in "two dimensions": they contain an arbitrary set of (identical) processes, and they use infinite data-structures, viz real-valued clocks. We illustrate our method by showing how it can be used to automatically verify Fischer's protocol, a timer-based protocol for enforcing mutual exclusion among an arbitrary number of processes.Finally, we show undecidability of the recurrent state problem: given a state in a timed network, check whether there is a computation of the network visiting the state infinitely often. This implies undecidability of model checking for any temporal logic which is sufficiently expressive to encode the recurrent state problem, such as PTL, CTL, etc.