Go beyond the SCOPE: a temporal situation calculus-based software tool for time petri nets

Authors:
Xing Tan
Affiliations:
Center for Technology in Government, University at Albany/SUNY
Venue:
IEA/AIE'12 Proceedings of the 25th international conference on Industrial Engineering and Other Applications of Applied Intelligent Systems: advanced research in applied artificial intelligence
Year:
2012

Citing 8
Cited 0

On the specification of real-time systems using logic programming

Proc. of the 1st European Software Engineering Conference on ESEC '87
Implementing LTL model checking with net unfoldings

SPIN '01 Proceedings of the 8th international SPIN workshop on Model checking of software
Knowlege in action: logical foundations for specifying and implementing dynamical systems

Knowlege in action: logical foundations for specifying and implementing dynamical systems
Model checking object petri nets in prolog

PPDP '04 Proceedings of the 6th ACM SIGPLAN international conference on Principles and practice of declarative programming
A formal modeling approach for supply chain event management

Decision Support Systems
SCOPE: A Situation Calculus Ontology of Petri Nets

Proceedings of the 2010 conference on Formal Ontology in Information Systems: Proceedings of the Sixth International Conference (FOIS 2010)
Towards Axiomatizing the Semantics of UML Activity Diagrams: A Situation-Calculus Perspective

WI-IAT '10 Proceedings of the 2010 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology - Volume 01
Time supervision of concurrent systems using symbolic unfoldings of time petri nets

FORMATS'05 Proceedings of the Third international conference on Formal Modeling and Analysis of Timed Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents a straightforward and mathematically rigorous software tool for Time Petri Nets (TPN). More precisely, we first build up a formal process ontology of TPNs by extending SCOPE (Situation Calculus Ontology for PEtri nets) with temporal constraints. We then demonstrate that, with this temporal SCOPE, sequential, iterative, or nondeterministic composite sequences of transition firings in TPNs can be further axiomatized through macro-expanding the basic action of transition firing. Finally, it is shown that theorem-proving, i.e., computing the consequences of such an ontology, can be carried out efficiently through logic programming in Prolog. Potential future applications of our approach are also discussed.