Algebraic laws for nondeterminism and concurrency
Journal of the ACM (JACM)
Automatic verification of finite-state concurrent systems using temporal logic specifications
ACM Transactions on Programming Languages and Systems (TOPLAS)
Semirings, automata, languages
Semirings, automata, languages
Reduced systems in Markov chains and their applications in queueing theory
Queueing Systems: Theory and Applications
Bisimulation through probabilistic testing
Information and Computation
Quantitative temporal reasoning
Real-Time Systems
Symbolic model checking: 1020 states and beyond
Information and Computation - Special issue: Selections from 1990 IEEE symposium on logic in computer science
Model-checking in dense real-time
Information and Computation - Special issue: selections from 1990 IEEE symposium on logic in computer science
Theoretical Computer Science
IEEE Spectrum
Formal methods: state of the art and future directions
ACM Computing Surveys (CSUR) - Special ACM 50th-anniversary issue: strategic directions in computing research
Model checking
TCP is max-plus linear and what it tells us on its throughput
Proceedings of the conference on Applications, Technologies, Architectures, and Protocols for Computer Communication
A more general algorithm for computing closed semiring costs between vertices of a directed graph
Communications of the ACM
Min-max computation tree logic
Artificial Intelligence
Communication and Concurrency
Automata, Languages, and Machines
Automata, Languages, and Machines
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
Multi-Terminal Binary Decision Diagrams: An Efficient DataStructure for Matrix Representation
Formal Methods in System Design
Semiring frameworks and algorithms for shortest-distance problems
Journal of Automata, Languages and Combinatorics
Concurrency and Automata on Infinite Sequences
Proceedings of the 5th GI-Conference on Theoretical Computer Science
Model-Checking Algorithms for Continuous-Time Markov Chains
IEEE Transactions on Software Engineering
Weak bisimulation for (max/+) automata and related models
Journal of Automata, Languages and Combinatorics - Special issue: Selected papers of the workshop weighted automata: Theory and applications (Dresden University of Technology (Germany), March 4-8, 2002)
Model checking stochastic automata
ACM Transactions on Computational Logic (TOCL)
Parameter estimation for probabilistic finite-state transducers
ACL '02 Proceedings of the 40th Annual Meeting on Association for Computational Linguistics
Model Checking Markov Chains with Actions and State Labels
IEEE Transactions on Software Engineering
CSL^TA: an Expressive Logic for Continuous-Time Markov Chains
QEST '07 Proceedings of the Fourth International Conference on Quantitative Evaluation of Systems
Bisimulation relations for weighted automata
Theoretical Computer Science
Weighted Timed Automata: Model-Checking and Games
Electronic Notes in Theoretical Computer Science (ENTCS)
Adding pebbles to weighted automata
CIAA'12 Proceedings of the 17th international conference on Implementation and Application of Automata
Hi-index | 0.00 |
A large number of different model checking approaches has been proposed during the last decade. The different approaches are applicable to different model types including untimed, timed, probabilistic and stochastic models. This paper presents a new framework for model checking techniques which includes some of the known approaches and enlarges the class of models to which model checking can be applied to the general class of weighted automata. The approach allows an easy adaption of model checking to models which have not been considered yet for this purpose. Examples for those new model types for which model checking can be applied are max/plus or min/plus automata which are well established models to describe different forms of dynamic systems and optimization problems. In this context, model checking can be used to verify temporal or quantitative properties of a system. The paper first presents briefly our class of weighted automata, as a very general model type. Then Valued Computational Tree Logic (CTL$) is introduced as a natural extension of the well known branching time logic CTL. Afterwards, algorithms to check a weighted automaton with respect to a CTL$ formula are presented. As a last result, bisimulation equivalence is extended to weighted automata and CTL$.