3,439 research outputs found
Extending the Real-Time Maude Semantics of Ptolemy to Hierarchical DE Models
This paper extends our Real-Time Maude formalization of the semantics of flat
Ptolemy II discrete-event (DE) models to hierarchical models, including modal
models. This is a challenging task that requires combining synchronous
fixed-point computations with hierarchical structure. The synthesis of a
Real-Time Maude verification model from a Ptolemy II DE model, and the formal
verification of the synthesized model in Real-Time Maude, have been integrated
into Ptolemy II, enabling a model-engineering process that combines the
convenience of Ptolemy II DE modeling and simulation with formal verification
in Real-Time Maude.Comment: In Proceedings RTRTS 2010, arXiv:1009.398
Object-Based Unawareness
The goal of this paper is to construct a user-friendly model of unawareness. We start from an axiom system (in first-order modal logic) that enables us to express the following kinds of sentences: âthe agent is not sure whether or not there is anything that he is unaware ofâ, and âI am not sure whether or not you are aware of something that I am notâ. We then prove a characterization theorem which describes a class of structures, called object-based unawareness structures, that correspond to this axiom system. As an application, we explain how an object-based unawareness structure can be use to model those American founding fathers who were opposed to the inclusion of the Bill of Rights in the constitution.unawareness, object-based, modal logic, bill of rights
LCM and MCM: specification of a control system using dynamic logic and process algebra
LCM 3.0 is a specification language based on dynamic logic and process algebra, and can be used to specify systems of dynamic objects that communicate synchronously. LCM 3.0 was developed for the specification of object-oriented information systems, but contains sufficient facilities for the specification of control to apply it to the specification of control-intensive systems as well. In this paper, the results of such an application are reported. The paper concludes with a discussion of the need for theorem-proving support and of the extensions that would be needed to be able to specify real-time properties
A Logic with Reverse Modalities for History-preserving Bisimulations
We introduce event identifier logic (EIL) which extends Hennessy-Milner logic
by the addition of (1) reverse as well as forward modalities, and (2)
identifiers to keep track of events. We show that this logic corresponds to
hereditary history-preserving (HH) bisimulation equivalence within a particular
true-concurrency model, namely stable configuration structures. We furthermore
show how natural sublogics of EIL correspond to coarser equivalences. In
particular we provide logical characterisations of weak history-preserving (WH)
and history-preserving (H) bisimulation. Logics corresponding to HH and H
bisimulation have been given previously, but not to WH bisimulation (when
autoconcurrency is allowed), as far as we are aware. We also present
characteristic formulas which characterise individual structures with respect
to history-preserving equivalences.Comment: In Proceedings EXPRESS 2011, arXiv:1108.407
A Survey of Languages for Specifying Dynamics: A Knowledge Engineering Perspective
A number of formal specification languages for knowledge-based systems has been developed. Characteristics for knowledge-based systems are a complex knowledge base and an inference engine which uses this knowledge to solve a given problem. Specification languages for knowledge-based systems have to cover both aspects. They have to provide the means to specify a complex and large amount of knowledge and they have to provide the means to specify the dynamic reasoning behavior of a knowledge-based system. We focus on the second aspect. For this purpose, we survey existing approaches for specifying dynamic behavior in related areas of research. In fact, we have taken approaches for the specification of information systems (Language for Conceptual Modeling and TROLL), approaches for the specification of database updates and logic programming (Transaction Logic and Dynamic Database Logic) and the generic specification framework of abstract state machine
Categories for Dynamic Epistemic Logic
The primary goal of this paper is to recast the semantics of modal logic, and
dynamic epistemic logic (DEL) in particular, in category-theoretic terms. We
first review the category of relations and categories of Kripke frames, with
particular emphasis on the duality between relations and adjoint homomorphisms.
Using these categories, we then reformulate the semantics of DEL in a more
categorical and algebraic form. Several virtues of the new formulation will be
demonstrated: The DEL idea of updating a model into another is captured
naturally by the categorical perspective -- which emphasizes a family of
objects and structural relationships among them, as opposed to a single object
and structure on it. Also, the categorical semantics of DEL can be merged
straightforwardly with a standard categorical semantics for first-order logic,
providing a semantics for first-order DEL.Comment: In Proceedings TARK 2017, arXiv:1707.0825
A Logic for True Concurrency
We propose a logic for true concurrency whose formulae predicate about events
in computations and their causal dependencies. The induced logical equivalence
is hereditary history preserving bisimilarity, and fragments of the logic can
be identified which correspond to other true concurrent behavioural
equivalences in the literature: step, pomset and history preserving
bisimilarity. Standard Hennessy-Milner logic, and thus (interleaving)
bisimilarity, is also recovered as a fragment. We also propose an extension of
the logic with fixpoint operators, thus allowing to describe causal and
concurrency properties of infinite computations. We believe that this work
contributes to a rational presentation of the true concurrent spectrum and to a
deeper understanding of the relations between the involved behavioural
equivalences.Comment: 31 pages, a preliminary version appeared in CONCUR 201
Modal Interface Automata
De Alfaro and Henzinger's Interface Automata (IA) and Nyman et al.'s recent
combination IOMTS of IA and Larsen's Modal Transition Systems (MTS) are
established frameworks for specifying interfaces of system components. However,
neither IA nor IOMTS consider conjunction that is needed in practice when a
component shall satisfy multiple interfaces, while Larsen's MTS-conjunction is
not closed and Bene\v{s} et al.'s conjunction on disjunctive MTS does not treat
internal transitions. In addition, IOMTS-parallel composition exhibits a
compositionality defect. This article defines conjunction (and also
disjunction) on IA and disjunctive MTS and proves the operators to be
'correct', i.e., the greatest lower bounds (least upper bounds) wrt. IA- and
resp. MTS-refinement. As its main contribution, a novel interface theory called
Modal Interface Automata (MIA) is introduced: MIA is a rich subset of IOMTS
featuring explicit output-must-transitions while input-transitions are always
allowed implicitly, is equipped with compositional parallel, conjunction and
disjunction operators, and allows a simpler embedding of IA than Nyman's. Thus,
it fixes the shortcomings of related work, without restricting designers to
deterministic interfaces as Raclet et al.'s modal interface theory does.Comment: 28 page
- âŠ