Verifying complex continuous real-time systems with coinductive CLP(R)

Authors:
Neda Saeedloei;Gopal Gupta
Affiliations:
Department of Computer Science, University of Texas at Dallas, Richardson, TX;Department of Computer Science, University of Texas at Dallas, Richardson, TX
Venue:
LATA'10 Proceedings of the 4th international conference on Language and Automata Theory and Applications
Year:
2010

Citing 10
Cited 8

Automata on infinite objects

Handbook of theoretical computer science (vol. B)
A theory of timed automata

Theoretical Computer Science
Automata For Modeling Real-Time Systems

ICALP '90 Proceedings of the 17th International Colloquium on Automata, Languages and Programming
Binary Reachability Analysis of Pushdown Timed Automata with Dense Clocks

CAV '01 Proceedings of the 13th International Conference on Computer Aided Verification
A constraint-based approach for specification and verification of real-time systems

RTSS '97 Proceedings of the 18th IEEE Real-Time Systems Symposium
A Solution to the Generalized Railroad Crossing Problem in ESTEREL

A Solution to the Generalized Railroad Crossing Problem in ESTEREL
A CLP Proof Method for Timed Automata

RTSS '04 Proceedings of the 25th IEEE International Real-Time Systems Symposium
Cyber Physical Systems: Design Challenges

ISORC '08 Proceedings of the 2008 11th IEEE Symposium on Object Oriented Real-Time Distributed Computing
Coinductive logic programming and its applications

ICLP'07 Proceedings of the 23rd international conference on Logic programming
Co-logic programming: extending logic programming with coinduction

ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming

Abstract compilation of object-oriented languages into coinductive CLP(X): can type inference meet verification?

FoVeOOS'10 Proceedings of the 2010 international conference on Formal verification of object-oriented software
A logic-based modeling and verification of CPS

ACM SIGBED Review - Work-in-Progress (WiP) Session of the 2nd International Conference on Cyber Physical Systems
Infinite computation, co-induction and computational logic

CALCO'11 Proceedings of the 4th international conference on Algebra and coalgebra in computer science
Regular corecursion in Prolog

Proceedings of the 27th Annual ACM Symposium on Applied Computing
Corecursive Featherweight Java

Proceedings of the 14th Workshop on Formal Techniques for Java-like Programs
Coinductive constraint logic programming

FLOPS'12 Proceedings of the 11th international conference on Functional and Logic Programming
Safe corecursion in coFJ

Proceedings of the 15th Workshop on Formal Techniques for Java-like Programs
Regular corecursion in Prolog

Computer Languages, Systems and Structures

Quantified Score

Hi-index	0.00

Visualization

Abstract

Timed automata have been used as a powerful formalism for specifying, designing, and analyzing real-time systems. We consider the generalization of timed automata to Pushdown Timed Automata (PTA). We show how PTA can be elegantly modeled via logic programming extended with co-induction and constraints over reals. We propose a general framework based on constraint logic programming and co-induction for modeling/verifying real-time systems. We use this framework to develop an elegant solution to the generalized railroad crossing problem of Lynch and Heitmeyer. Interesting properties of the system can be verified merely by posing appropriate queries.