Constructing Efficient Formal Models from High-Level Descriptions Using Symbolic Simulation

2005 ◽  
Vol 33 (6) ◽  
pp. 645-666 ◽  
Author(s):  
Alfred Koelbl ◽  
Carl Pixley
Keyword(s):  
Formal Models ◽  
Symbolic Simulation ◽  
High Level

Action language ℬ𝒞+

2015 ◽  
Vol 30 (4) ◽  
pp. 899-922 ◽  
Author(s):  
Joseph Babb ◽  
Joohyung Lee
Keyword(s):  
Main Idea ◽  
Answer Set Programming ◽  
Stable Model ◽  
Formal Models ◽  
Transition Systems ◽  
Action Languages ◽  
Action Language ◽  
Language Constructs ◽  
High Level ◽  
Answer Set

Abstract Action languages are formal models of parts of natural language that are designed to describe effects of actions. Many of these languages can be viewed as high-level notations of answer set programs structured to represent transition systems. However, the form of answer set programs considered in the earlier work is quite limited in comparison with the modern Answer Set Programming (ASP) language, which allows several useful constructs for knowledge representation, such as choice rules, aggregates and abstract constraint atoms. We propose a new action language called BC +, which closes the gap between action languages and the modern ASP language. The main idea is to define the semantics of BC + in terms of general stable model semantics for propositional formulas, under which many modern ASP language constructs can be identified with shorthands for propositional formulas. Language BC  + turns out to be sufficiently expressive to encompass the best features of other action languages, such as languages B , C , C + and BC . Computational methods available in ASP solvers are readily applicable to compute BC +, which led to an implementation of the language by extending system cplus2asp .

scholarly journals Representing Harmony in Computational Music Cognition

2020 ◽  
Author(s):  
Peter M. C. Harrison ◽  
Marcus Thomas Pearce
Keyword(s):  
Music Theory ◽  
Cognitive Modeling ◽  
Music Cognition ◽  
Object Oriented ◽  
Formal Models ◽  
Roman Numeral ◽  
Low Level ◽  
Cognitive Theories ◽  
High Level ◽  
Lead Sheet

Cognitive theories of harmony require unambiguous formal models of how listeners internally represent chords and chord progressions. Previous modeling work often uses representation schemes heavily reliant on Western music theory, such as Roman-numeral and lead-sheet notation; however, we argue that such work should be complemented by models using representations that are closer to psychoacoustics and rely less on Western-specific assumptions. In support of this goal, we compile a network of 13 low-level harmonic representations relevant for cognitive modeling, organised into three symbolic, acoustic, and sensory categories. We implement this collection of representations in an easy-to-use object-oriented framework written for the programming language R and distributed in an open-source package called hrep (http://hrep.pmcharrison.com). We also discuss computational methods for deriving higher-level representations from these low-level representations. This work should ultimately help researchers to construct high-level models of harmony cognition that are nonetheless rooted in low-level auditory principles.

Enhancing bug hunting using high-level symbolic simulation

2009 ◽  
Author(s):  
Hong-Zu Chou ◽  
I-Hui Lin ◽  
Ching-Sung Yang ◽  
Kai-Hui Chang ◽  
Sy-Yen Kuo
Keyword(s):  
Symbolic Simulation ◽  
High Level

scholarly journals Constraint-based deadlock checking of high-level specifications

2011 ◽  
Vol 11 (4-5) ◽  
pp. 767-782 ◽  
Author(s):  
STEFAN HALLERSTEDE ◽  
MICHAEL LEUSCHEL
Keyword(s):  
Formal Models ◽  
Cruise Control ◽  
Industrial Case Study ◽  
General Technique ◽  
Constraint Solver ◽  
Smt Solvers ◽  
Deadlock Freedom ◽  
Cruise Control System ◽  
High Level

AbstractEstablishing the absence of deadlocks is important in many applications of formal methods. The use of model checking for finding deadlocks in formal models is often limited. In this paper, we propose a constraint-based approach to finding deadlocks employing the ProB constraint solver. We present the general technique, as well as various improvements that had to be performed on ProB's Prolog kernel, such as reification of membership and arithmetic constraints. This work was guided by an industrial case study, where a team from Bosch was modelling a cruise control system. Within this case study, ProB was able to quickly find counterexamples to very large deadlock-freedom constraints. In the paper, we also present other successful applications of this new technique. Experiments using SAT and SMT solvers on these constraints were thus far unsuccessful.

scholarly journals Towards programming languages for genetic engineering of living cells

2009 ◽  
Vol 6 (suppl_4) ◽  
Author(s):  
Michael Pedersen ◽  
Andrew Phillips
Keyword(s):  
Synthetic Biology ◽  
Genetic Engineering ◽  
Programming Languages ◽  
Programming Language ◽  
Protein Interactions ◽  
Dna Sequences ◽  
Living Cells ◽  
Formal Models ◽  
Practical Applications ◽  
High Level

Synthetic biology aims at producing novel biological systems to carry out some desired and well-defined functions. An ultimate dream is to design these systems at a high level of abstraction using engineering-based tools and programming languages, press a button, and have the design translated to DNA sequences that can be synthesized and put to work in living cells. We introduce such a programming language, which allows logical interactions between potentially undetermined proteins and genes to be expressed in a modular manner. Programs can be translated by a compiler into sequences of standard biological parts, a process that relies on logic programming and prototype databases that contain known biological parts and protein interactions. Programs can also be translated to reactions, allowing simulations to be carried out. While current limitations on available data prevent full use of the language in practical applications, the language can be used to develop formal models of synthetic systems, which are otherwise often presented by informal notations. The language can also serve as a concrete proposal on which future language designs can be discussed, and can help to guide the emerging standard of biological parts which so far has focused on biological, rather than logical, properties of parts.

Sign in / Sign up

Export Citation Format

Share Document