Filters








30,018 Hits in 6.0 sec

dT-Calculus: A Formal Method to Specify Distributed Mobile Real-Time IoT Systems [chapter]

Sunghyeon Lee, Yeongbok Choe, Moonkun Lee
2018 Internet of Things - Technology, Applications and Standardization  
In order to overcome the limitations, this paper presents a process algebra, called, dT-Calculus, extended from d-Calculus, by providing with capability of specifying the set of time properties, as well  ...  In general, process algebra can be the most suitable formal method to specify IoT systems due to the equivalent notion of processes as things.  ...  If not, the existing process is intentionally terminated and a safe process is executed instead, in order to handle this abnormal situation.  ... 
doi:10.5772/intechopen.75138 fatcat:qe2vwu4rprdpnahl7hktoevpde

Formalization of Signaling System by Process Calculus

Yasuaki Ibayashi, Shin-ya Nishizaki
2014 Information Engineering Research Institute procedia  
The Spice calculus, which was proposed by Nishizaki et al., is a calculus process which enables us to formalize and analyze the resistance of communication protocols against Denial-of-Service attacks.  ...  We set up ISUP of Signaling System No. 7 as a target and formalized a simple telephone network based on it in the framework of the Spice calculus.  ...  Acknowledgements This work was supported by Grant-in-Aid for Scientific Research (C) (24500009).  ... 
doi:10.1016/j.ieri.2014.09.071 fatcat:eqtdtxt6mzffrpas76xefrpzqy

Book announcements

1993 Discrete Applied Mathematics  
The situation calculus. Points or intervals? Review of temporal logics. Chapter 7: Non-Monotonic Reasoning.  ...  Chupter 2: Basic Process Algebra.The basic system. Deadlock and termination. The term model. Projective limit model. Process graphs. Regular processes. Stack. Chapfer 3: Concurrent Processes.  ... 
doi:10.1016/0166-218x(93)90173-l fatcat:l4psazjvkjcm5ksswvubyespla

Using Situation Calculus for Normative Agents in Urban Wastewater Systems [chapter]

Juan-Carlos Nieves, Dario Garcia, Montse Aulinas, Ulises Cortés
2010 Advances in Intelligent and Soft Computing  
The implementation of the normative agents is based on Situation Calculus. Keywords. Rational agents, environmental decision support systems, practical normative reasoning, situation calculus.  ...  In this paper, we present an analysis and implementation of normative agents that capture concrete regulations of the Catalan pollutionprevention policies.  ...  This work has been partially supported by the FP7 European project ALIVE IST-215890. The views expressed in this paper are not necessarily those of the ALIVE consortium.  ... 
doi:10.1007/978-3-642-12384-9_30 dblp:conf/paams/NievesGAC10 fatcat:6fooywo2crhfhnl6j3ahs5upgu

Event Calculus Planning Through Satisfiability

M. Shanahan
2004 Journal of Logic and Computation  
By contrast, this paper presents a formal framework for tackling event calculus planning through satisfiability, in the style of Kautz and Selman.  ...  A provably correct conjunctive normal form encoding for event calculus planning problems is supplied, rendering them soluble by an off-the-shelf SAT solver.  ...  Thanks to Erik Mueller and the two anonymous referees.  ... 
doi:10.1093/logcom/14.5.731 fatcat:fkbgfgp2ovaa7ax5jtgyj247wa

DISC: A Declarative Framework for Self-Healing Web Services Composition

Ehtesham Zahoor, Olivier Perrin, Claude Godart
2010 2010 IEEE International Conference on Web Services  
Then, it allows for instantiating, verifying and executing the composition design and for monitoring the process while in execution.  ...  In this paper we propose a declarative event-oriented framework, called DISC, that serves as a unified framework to bridge the gap between the process design, verification and monitoring.  ...  based approaches (using situation calculus [10] , rule-based planning [11] , and others), as discussed in [12] .  ... 
doi:10.1109/icws.2010.70 dblp:conf/icws/ZahoorPG10 fatcat:57n4ak4d2vbadgkadilhub47fy

Event calculus planning revisited [chapter]

Murray Shanahan
1997 Lecture Notes in Computer Science  
In 1969 Cordell Green presented his seminal description of planning as theorem proving with the situation calculus.  ...  Furthermore, if we extend the event calculus in a natural way to accommodate compound actions, then using exactly the same abductive theorem prover we obtain a hierarchical planner.  ...  This work was carried out as part of the EPSRC funded project GR/L20023 "Cognitive Robotics".  ... 
doi:10.1007/3-540-63912-8_101 fatcat:khujelm2knhgldpl636vzpcroa

Equational rules for rewriting logic

Patrick Viry
2002 Theoretical Computer Science  
In addition to equations and rules, we introduce equational rules that are oriented while having an equational interpretation.  ...  We present applications of this theory to three examples where the rewrite relation is interpreted, respectively, as equality, transition and deduction.  ...  Acknowledgements My thanks go to the anonymous referees who provided many constructive comments.  ... 
doi:10.1016/s0304-3975(01)00366-8 fatcat:fzzau65375gd7otg2vljgbeptm

Parallel computing with the Pi-calculus

Frédéric Peschanski
2011 Proceedings of the sixth workshop on Declarative aspects of multicore programming - DAMP '11  
issue of collecting cyclic structures -reinterpreted as the (in our case, much simpler) problem of detecting partial terminations.  ...  Our approach mimics the evolution from lambda-calculi to functional programming languages, but with the pi-calculus as a starting point.  ...  In the π-calculus there is no termination construct per se, however we need the end terminator to take care of some clean-up in the operational semantics.  ... 
doi:10.1145/1926354.1926363 dblp:conf/popl/Peschanski11 fatcat:jorf5pkbx5c4vf4yeumz22sux4

Modeling Terms by Graphs with Structure Constraints (Two Illustrations)

Clemens Grabmayer
2019 Electronic Proceedings in Theoretical Computer Science  
In this extended abstract I describe the underlying problems, give references, provide examples, indicate the chosen approaches, and compare the initial situations as well as the results that have been  ...  In the talk at the workshop my aim was to demonstrate the usefulness of graph techniques for tackling problems that have been studied predominantly as problems on the term level: increasing sharing in  ...  Perhaps this can be of help in similar situations.  ... 
doi:10.4204/eptcs.288.1 fatcat:yiy2b7k6fvfztcschsstmvrrlq

CCS with Replication in the Chomsky Hierarchy: The Expressive Power of Divergence [chapter]

Jesús Aranda, Cinzia Di Giusto, Mogens Nielsen, Frank D. Valencia
2007 Lecture Notes in Computer Science  
We finally show that the languages generated by termination-preserving CCS ! processes are Type 1 .  ...  The encoding is said to be non-faithful because it may move from a state which can lead to termination into a divergent one which do not correspond to any configuration of the encoded RAM.  ...  Her influential research on expressiveness is inspirational to us: may she rest in peace.  ... 
doi:10.1007/978-3-540-76637-7_26 fatcat:wljwhmgttzcqzin7n34v6c66ee

Automated Agent Synthesis for Situation Awareness in Service-Based Systems

S. Yau, H. Gong, D. Huang, W. Gao, L. Zhu
2006 30th Annual International Computer Software and Applications Conference (COMPSAC'06)  
Hence, to greatly reduce the effort of situation-aware application software development in service-based systems as well as supporting runtime system adaptation, it is necessary to automate the development  ...  In this paper, an automated agent synthesis approach for SAW in service-based systems is presented. This approach is based on AS 3 calculus and logic, and our declarative model for SAW.  ...  (d) The timeout process and recursive process in AS 3 calculus are used to model periodical context acquisition and situation analysis.  ... 
doi:10.1109/compsac.2006.30 dblp:conf/compsac/YauGHGZ06 fatcat:hy25qxekdrgqpet2v4lxdqeljy

The cognitive agents specification language and verification environment for multiagent systems

Steven Shapiro, Yves Lespérance, Hector J. Levesque
2002 Proceedings of the first international joint conference on Autonomous agents and multiagent systems part 1 - AAMAS '02  
To illustrate the verification system, we discuss a proof we carried out in it, namely, that all bounded-loop CASL specifications terminate.  ...  In this paper, we describe CASL and a verification environment (CASLve) for it based on the PVS verification system.  ...  Since the organizer agent processes terminate, it should follow that the entire system terminates.  ... 
doi:10.1145/544741.544746 dblp:conf/atal/ShapiroLL02 fatcat:cyqqxa4lljgotkzaldtpzbxwme

The cognitive agents specification language and verification environment for multiagent systems

Steven Shapiro, Yves Lespérance, Hector J. Levesque
2002 Proceedings of the first international joint conference on Autonomous agents and multiagent systems part 1 - AAMAS '02  
To illustrate the verification system, we discuss a proof we carried out in it, namely, that all bounded-loop CASL specifications terminate.  ...  In this paper, we describe CASL and a verification environment (CASLve) for it based on the PVS verification system.  ...  Since the organizer agent processes terminate, it should follow that the entire system terminates.  ... 
doi:10.1145/544743.544746 fatcat:xykyw7xng5hedo7q6pxlk3hzvy

GOLOG: A logic programming language for dynamic domains

Hector J. Levesque, Raymond Reiter, Yves Lespérance, Fangzhen Lin, Richard B. Scherl
1997 The Journal of Logic Programming  
It is based on a formal theory of action specified in an extended version of the situation calculus. A prototype implementation in Prolog has been developed. 0 Elsevier Science Inc., 1997 a  ...  The language appears well suited for applications in high level control of robots and industrial processes, intelligent software agents, discrete event simulation, etc.  ...  The answer is that the definition of do is too weak: it is sufficient for finding a terminating situation (when it exists) given an initial one,5 but it cannot be used to show non-termination.  ... 
doi:10.1016/s0743-1066(96)00121-5 fatcat:4fn7qhkw7veuvlewbnexmutizq
« Previous Showing results 1 — 15 out of 30,018 results