Automatic verification of finite-state concurrent systems using temporal logic specifications
ACM Transactions on Programming Languages and Systems (TOPLAS)
Communication and concurrency
Journal of the ACM (JACM)
Symbolic model checking for real-time systems
Information and Computation
The algebra of timed processes, ATP: theory and application
Information and Computation
Abstract interpretation of reactive systems
ACM Transactions on Programming Languages and Systems (TOPLAS)
Selective mu-calculus and formula-based equivalence of transition systems
Journal of Computer and System Sciences
From Timed Automata to Logic - and Back
MFCS '95 Proceedings of the 20th International Symposium on Mathematical Foundations of Computer Science
Concept of Quantified Abstract Quotient Automaton and its Advantage
FORTE X / PSTV XVII '97 Proceedings of the IFIP TC6 WG6.1 Joint International Conference on Formal Description Techniques for Distributed Systems and Communication Protocols (FORTE X) and Protocol Specification, Testing and Verification (PSTV XVII)
Model Checking via Reachability Testing for Timed Automata
TACAS '98 Proceedings of the 4th International Conference on Tools and Algorithms for Construction and Analysis of Systems
Generalized Quantitative Temporal Reasoning: An Automata Theoretic Approach
TAPSOFT '97 Proceedings of the 7th International Joint Conference CAAP/FASE on Theory and Practice of Software Development
Property Preserving Simulations
CAV '92 Proceedings of the Fourth International Workshop on Computer Aided Verification
Generation of Reduced Models for Checking Fragments of CTL
CAV '93 Proceedings of the 5th International Conference on Computer Aided Verification
Local Model Checking for Real-Time Systems (Extended Abstract)
Proceedings of the 7th International Conference on Computer Aided Verification
CADP - A Protocol Validation and Verification Toolbox
CAV '96 Proceedings of the 8th International Conference on Computer Aided Verification
The NCSU Concurrency Workbench
CAV '96 Proceedings of the 8th International Conference on Computer Aided Verification
Logics and Models of Real Time: A Survey
Proceedings of the Real-Time: Theory in Practice, REX Workshop
Real-Time and the Mu-Calculus (Preliminary Report)
Proceedings of the Real-Time: Theory in Practice, REX Workshop
Selective µ-calculus: New Modal Operators for Proving Properties on Reduced Transition Systems
FORTE X / PSTV XVII '97 Proceedings of the IFIP TC6 WG6.1 Joint International Conference on Formal Description Techniques for Distributed Systems and Communication Protocols (FORTE X) and Protocol Specification, Testing and Verification (PSTV XVII)
Verifying Temporal Properties of Processes
CONCUR '90 Proceedings of the Theories of Concurrency: Unification and Extension
| Hi-index | 0.02 |
When verifying concurrent systems described by transition systems, state explosion is one of the most serious problems. If quantitative temporal information (expressed by clock ticks) are considered, state explosion is even more serious. In this paper we present a non-standard (abstract) semantics for the ASTP language able to produce reduced transition systems. The important point is that the abstract semantics produces transition systems equivalent to the standard ones for what concerns the satisfiability of a given set of formulae of a temporal logic with quantitative modal operators. The equivalence of transition systems with respect to formulae is expressed by means of 〈ρ, n〉-equivalence: two 〈ρ, n〉-equivalent transition systems give the same truth value to all formulae such that the actions occurring in the modal operators are contained in ρ, and with time constraints whose values are less than or equal to n.