显示样式： 排序： IF:  GO 导出

Semantics of temporal constrained objects J. Log. Algebr. Methods Program. (IF 0.685) Pub Date : 20201125
Jinesh M. Kannimoola; Bharat Jayaraman; Krishnashree AchuthanThis paper presents the declarative and operational semantics for the paradigm of temporal constrained objects (TCOB). This modeling paradigm is an extension of basic constrained objects where objects specify the structure of a system and constraints specify its behavior. Temporal constrained objects have been shown to provide a clear and highlevel declarative specification of the timedependent behavior

Conflict vs causality in event structures J. Log. Algebr. Methods Program. (IF 0.685) Pub Date : 20201125
Daniele Gorla; Ivano SalvoEvent structures are one of the best known models for concurrency. Many variants of the basic model and many possible notions of equivalence for them have been devised in the literature. In this paper, we study how the spectrum of equivalences for Labeled Prime Event Structures built by Van Glabbeek and Goltz changes if we consider two simplified notions of event structures: the first one is obtained

Deciding the consistency of nonlinear real arithmetic constraints with a conflict driven search using cylindrical algebraic coverings J. Log. Algebr. Methods Program. (IF 0.685) Pub Date : 20201127
Erika Ábrahám; James H. Davenport; Matthew England; Gereon KremerWe present a new algorithm for determining the satisfiability of conjunctions of nonlinear polynomial constraints over the reals, which can be used as a theory solver for satisfiability modulo theory (SMT) solving for nonlinear real arithmetic. The algorithm is a variant of Cylindrical Algebraic Decomposition (CAD) adapted for satisfiability, where solution candidates (sample points) are constructed

Wellstructuredness, safeness and soundness: A formal classification of BPMN Collaborations J. Log. Algebr. Methods Program. (IF 0.685) Pub Date : 20201126
Flavio Corradini; Chiara Muzi; Andrea Morichetta; Barbara Re; Francesco TiezziThe BPMN standard has a huge uptake in modelling business processes within the same organisation or collaborations involving multiple interacting participants. It is widely accepted by the Business Process Management community that a solid formal framework for the notation can help designers to properly understand their BPMN models as well as to state and verify model properties. With this aim in mind

Checking deadlockfreedom of parametric componentbased systems J. Log. Algebr. Methods Program. (IF 0.685) Pub Date : 20201113
Marius Bozga; Radu Iosif; Joseph SifakisWe propose an automated method for computing inductive invariants used to proving deadlock freedom of parametric componentbased systems. The method generalizes the approach for computing structural trap invariants from bounded to parametric systems with general architectures. It symbolically extracts trap invariants from interaction formulae defining the system architecture. The paper presents the

The Cπcalculus: A model for confidential name passing J. Log. Algebr. Methods Program. (IF 0.685) Pub Date : 20201117
Ivan Prokić; Hugo Torres VieiraSharing confidential information in distributed systems is often a necessity in the context of many applications, however, it opens the problem of controlling information sharing even among trusted parties. In this paper, we present a formal model in which dissemination of information, in particular information forwarding, is not allowed. Namely, we introduce a fragment of the πcalculus where forwarding

Composition and decomposition of multiparty sessions J. Log. Algebr. Methods Program. (IF 0.685) Pub Date : 20201104
Franco Barbanera; Mariangiola DezaniCiancaglini; Ivan Lanese; Emilio TuostoMultiparty sessions are systems of concurrent processes, which allow several participants to communicate by sending and receiving messages. Their overall behaviour can be described by means of global types. Typable multiparty sessions enjoy lockfreedom. We look at multiparty sessions as open systems by allowing one to compose multiparty sessions by transforming two of their participants into a pair

Soft constraint automata with memory J. Log. Algebr. Methods Program. (IF 0.685) Pub Date : 20201021
Kasper Dokter; Fabio Gadducci; Benjamin Lion; Francesco SantiniWe revise soft constraint automata, wherein transitions are weighted and each action has an associated preference value. We first relax the underlying algebraic structure to allow bipolar preferences. We then equip automata with memory locations, that is, with an internal state to remember and update information from transition to transition. We furthermore revise automata operators, such as composition

Runtime verification for dynamic architectures J. Log. Algebr. Methods Program. (IF 0.685) Pub Date : 20201022
Diego Marmsoler; Ana PetrovskaThe architecture of a system captures important design decisions for the system. Over time, changes in a system's implementation may lead to violations of specific design decisions. This problem is common in industry and known as architectural erosion. Since it may have severe consequences on the quality of a system, research has focused on the development of tools and techniques to address the presented

(Co)inductive proof systems for compositional proofs in reachability logic J. Log. Algebr. Methods Program. (IF 0.685) Pub Date : 20201029
Vlad Rusu; David NowakReachability Logic is a formalism that can be used, among others, for expressing partialcorrectness properties of transition systems. In this paper we present three proof systems for this formalism, all of which are sound and complete and inherit the coinductive nature of the logic. The proof systems differ, however, in several aspects. First, they use induction and coinduction in different proportions

A navigational logic for reasoning about graph properties J. Log. Algebr. Methods Program. (IF 0.685) Pub Date : 20201012
Marisa Navarro; Fernando Orejas; Elvira Pino; Leen LambersGraphs play an important role in many areas of Computer Science. In particular, our work is motivated by modeldriven software development and by graph databases. For this reason, it is very important to have the means to express and to reason about the properties that a given graph may satisfy. With this aim, in this paper we present a visual logic that allows us to describe graph properties, including

Actorbased model checking for SoftwareDefined Networks J. Log. Algebr. Methods Program. (IF 0.685) Pub Date : 20201012
Elvira Albert; Miguel GómezZamalloa; Miguel Isabel; Albert Rubio; Matteo Sammartino; Alexandra SilvaSoftwareDefined Networking (SDN) is a networking paradigm that has become increasingly popular in the last decade. The unprecedented control over the global behaviour of the network it provides opens a range of new opportunities for formal methods and much work has appeared in the last few years on providing bridges between SDN and verification. This article advances this research line and provides

Free Kleene algebras with domain J. Log. Algebr. Methods Program. (IF 0.685) Pub Date : 20200925
Brett McLeanFirst we identify the free algebras of the class of algebras of binary relations equipped with the composition and domain operations. Elements of the free algebras are pointed labelled finite rooted trees. Then we extend to the analogous case when the signature includes all the Kleene algebra with domain operations; that is, we add union and reflexive transitive closure to the signature. In this second

On the group memory complexity of extended finite automata over groups J. Log. Algebr. Methods Program. (IF 0.685) Pub Date : 20200917
Fernando Arroyo; Victor Mitrana; Andrei Păun; Mihaela Păun; Jose Ramon Sanchez CousoWe define and investigate a complexity measure defined for extended finite automata over groups (EFA). Roughly, an EFA is a finite automaton augmented with a register storing an element of a group, initially the identity element. When a transition is performed, not only the state, but the register contents are updated. A word is accepted if, after reading completely the word, the automaton reached

Relation algebras of Sugihara, Belnap, Meyer, and Church J. Log. Algebr. Methods Program. (IF 0.685) Pub Date : 20200912
R.L. Kramer; R.D. MadduxAlgebras introduced by, or attributed to, Sugihara, Belnap, Meyer, and Church are representable as algebras of binary relations with settheoretically defined operations. They are definitional reducts or subreducts of proper relation algebras. The representability of Sugihara matrices yields sound and complete settheoretical semantics for Rmingle.

Relational characterisations of paths J. Log. Algebr. Methods Program. (IF 0.685) Pub Date : 20200817
Rudolf Berghammer, Hitoshi Furusawa, Walter Guttmann, Peter HöfnerBinary relations are one of the standard ways to encode, characterise and reason about graphs. Relation algebras provide equational axioms for a large fragment of the calculus of binary relations. Although relations are standard tools in many areas of mathematics and computing, researchers usually fall back to pointwise reasoning when it comes to arguments about paths in a graph. We present a purely

Calculational relationalgebraic proofs in the teaching tool CalcCheck J. Log. Algebr. Methods Program. (IF 0.685) Pub Date : 20200720
Wolfram KahlThe proof checker CALCCHECK has been developed for teaching calculational proofs in the style of Gries and Schneider's textbook classic “A Logical Approach to Discrete Math”. While originally only ACrewriting was supported, we now added also support for operators that are only associative, which is essential for convenience in reasoning about composition of (in particular) relations. We demonstrate

Specifying reversibility with TLA+ J. Log. Algebr. Methods Program. (IF 0.685) Pub Date : 20200715
Tatjana KapusIn the past, actionbased, processalgebraic formalisms for the description and analysis of concurrent reversible computations were mainly developed. In this paper, we present a statebased approach to the specification of concurrent systems in which forwardexecuted actions may either be executed in reverse in a causalconsistent uncontrolled fashion or are irreversible. The basic underlying system

Replacement freeness: A criterion for separating process calculi J. Log. Algebr. Methods Program. (IF 0.685) Pub Date : 20200707
Rosario Pugliese, Francesco TiezziWe introduce a new criterion to discern the relative expressiveness of process calculi. Intuitively, a calculus is replacement free if replacing a subprocess that cannot perform any visible action by an arbitrary one never affects the capability of the resulting process to perform a visible action. By relying on two slightly different formulations of our criterion we partition the set of process calculi

Preface to the special issue on Formal Approaches to Parallel and Distributed Systems 2018 J. Log. Algebr. Methods Program. (IF 0.685) Pub Date : 20200707
Frédéric LoulergueThis special issue contains extended versions of selected papers from the 5th International Symposium on Formal Approaches to Parallel and Distributed Systems (4PAD 2018). The symposium was held in Orléans, France on July 19th, 2020 in conjunction with the 2018 International Conference on High Performance Computing & Simulation (HPCS 2018).

From global choreographies to verifiable efficient distributed implementations J. Log. Algebr. Methods Program. (IF 0.685) Pub Date : 20200701
Mohamad Jaber, Yliès Falcone, Paul Attie, AlAbbass Khalil, Rayan Hallal, Antoine ElHokayemWe define a method to automatically synthesize efficient distributed implementations from highlevel global choreographies. A global choreography describes the execution and communication logic between a set of provided processes which are described by their interfaces. At the choreography level, the operations include multiparty communications, choice, loop, and branching. A choreography is master

Algebraic solution of minimax singlefacility constrained location problems with Chebyshev and rectilinear distances J. Log. Algebr. Methods Program. (IF 0.685) Pub Date : 20200630
Nikolai KrivulinWe consider location problems to find the optimal sites of placement of a new facility, which minimize the maximum weighted Chebyshev or rectilinear distance to existing facilities under constraints on a feasible location domain. We examine Chebyshev location problems in multidimensional space to represent and solve the problems in the framework of tropical (idempotent) algebra, which deals with the

Preface to the special issue on the 12th International Conference on Graph Transformation J. Log. Algebr. Methods Program. (IF 0.685) Pub Date : 20200608
Esther Guerra, Fernando OrejasThis special issue contains extended versions of four selected papers from the 12th International Conference on Graph Transformation (ICGT 2019). The articles cover a method for graph pattern matching, the use of graph hierarchies for knowledge representation, the construction of constraint preserving transformation rules, and the definition of a formal framework, extending the theory DPO rewriting

Doublepushoutrewriting in SCartesian functor categories: Rewriting theory and application to partial triple graphs J. Log. Algebr. Methods Program. (IF 0.685) Pub Date : 20200527
Jens Kosiol, Lars Fritsche, Andy Schürr, Gabriele TaentzerA variety of restricted functor categories has been investigated independently and for different purposes to provide doublepushoutrewriting in the areas of modeldriven development and graph transformation. We introduce Scartesian functor categories as a unifying formal framework for these different examples. Scartesian functor categories are certain subcategories of functor categories that preserve

Constructing optimized constraintpreserving application conditions for model transformation rules J. Log. Algebr. Methods Program. (IF 0.685) Pub Date : 20200527
Nebras Nassar, Jens Kosiol, Thorsten Arendt, Gabriele TaentzerThere is an increasing need for model transformations ensuring valid result models w.r.t. a given constraint. In model refactoring, for example, each performed refactoring should yield a valid model again. Given a constraint, if a model transformation rule always produces valid output, it is called constraintguaranteeing; if only when applied to an already valid model, it is called constraintpreserving

Hybrid search plan generation for generalized graph pattern matching J. Log. Algebr. Methods Program. (IF 0.685) Pub Date : 20200527
Matthias Barkowsky, Holger GieseIn recent years, the increased interest in application areas such as social networks has resulted in a rising popularity of graphbased approaches for storing and processing large amounts of interconnected data. To extract useful information from the growing network structures, efficient querying techniques are required. In this paper, we propose an approach for graph pattern matching that allows a

A collaborative access control framework for online social networks J. Log. Algebr. Methods Program. (IF 0.685) Pub Date : 20200525
Hanaa Alshareef, Raúl Pardo, Gerardo Schneider, Pablo PicazoSanchezMost Online Social Networks allow users to set their privacy settings concerning posting information, but current implementations do not allow a fine grained enforcement in case the posted item concerns other users. In this paper we propose a new collaborative access control framework that takes into account the relation of multiple users for viewing as well as for sharing items, eventually solving

Knowledge representation and update in hierarchies of graphs J. Log. Algebr. Methods Program. (IF 0.685) Pub Date : 20200525
Russ Harmer, Eugenia OshurkoA mathematical theory is presented for the representation of knowledge in the form of a directed acyclic hierarchy of objects in a category where all paths between any given pair of objects are required to be equal. The conditions under which knowledge update, in the form of the sesquipushout rewriting of an object in a hierarchy, can be propagated to the rest of the hierarchy, in order to maintain

Replicated data types that unify eventual consistency and observable atomic consistency J. Log. Algebr. Methods Program. (IF 0.685) Pub Date : 20200522
Xin Zhao, Philipp HallerStrong consistency is widely used in systems such as relational databases. In a distributed system, strong consistency ensures that all clients observe consistent data updates atomically on all servers. However, such systems need to sacrifice availability when synchronization occurs. We propose a new consistency protocol, the observable atomic consistency protocol (OACP) to make writedominant applications

Realizable causalconsistent reversible choreographies for systems with firstinfirstout communication channels J. Log. Algebr. Methods Program. (IF 0.685) Pub Date : 20200521
Monika KapusKolarWe reengineer a pomsetbased abstract semantics (and the associated semantic constraints) recently proposed for compositionally specified choreographies for systems of components communicating over firstinfirstout channels. We prove that the original semantics overspecifies components' behaviour and that for this (but not only this) reason, the original semantic constraints are insufficient for

Specifying with syntactic theory functors J. Log. Algebr. Methods Program. (IF 0.685) Pub Date : 20200402
Magne Haveraaen, Markus RoggenbachWe propose a framework, syntactic theory functors (STFs), for creating syntactic structuring mechanisms for specification languages. Good support for common reuse patterns is important for systematically developing specifications for large systems. Though immaterial to foundational theory, lack of support otherwise causes lengthy writing of boilerplate code or repeated adaptation from one context to

Instantaneous reactiontime in dynamic consistency checking of conditional simple temporal networks J. Log. Algebr. Methods Program. (IF 0.685) Pub Date : 20200319
Massimo Cairo, Carlo Comin, Romeo RizziConditional Simple Temporal Networks (CSTNs) is a constraint based graphformalism for conditional temporal planning. Three notions of consistency arise for CSTNs: weak, strong, and dynamic. DynamicConsistency (DC) is the most interesting notion, but it is also the most challenging. In order to address the DCChecking problem, Comin and Rizzi [12] introduced εDC (a refined, more realistic, notion

Intervalvalued fuzzy reasoning method based on similarity measure J. Log. Algebr. Methods Program. (IF 0.685) Pub Date : 20200312
Minxia Luo, Yajing Wang, Ruirui ZhaoIn this paper, a new similarity measure of intervalvalued fuzzy sets is introduced. Meanwhile, intervalvalued fuzzy reasoning method based on similarity measure for Fuzzy Modus Ponens and Fuzzy Modus Tollens are proposed, and the solutions of intervalvalued fuzzy reasoning method based on similarity measure are given. Moreover, the robustness of intervalvalued fuzzy reasoning method based on similarity

Twenty years of coordination technologies: COORDINATION contribution to the state of art J. Log. Algebr. Methods Program. (IF 0.685) Pub Date : 20200224
Giovanni Ciatto, Stefano Mariani, Giovanna Di Marzo Serugendo, Maxime Louvel, Andrea Omicini, Franco ZambonelliComplexity of intra and intersystems interactions is steadily increasing in modern application scenarios such as the Internet of Things, therefore coordination technologies are required to take a crucial step forward towards full maturity. In this paper we look back at the history of the COORDINATION conference series with the goal of shedding light on the current status of the coordination technologies

On the expressiveness of multiplicities in databased coordination languages J. Log. Algebr. Methods Program. (IF 0.685) Pub Date : 20200219
Denis Darquennes, JeanMarie Jacquet, Isabelle LindenCoordination languages and models have proved to be well suited to program the interaction of a wide variety of dataintensive distributed systems. Building upon previous work by the authors, this paper aims at exploring how the addition of multiplicity information to tuples increases the expressiveness of Lindalike languages. It proposes a set of languages integrating the multiplicity in different

The complexity of identifying characteristic formulae J. Log. Algebr. Methods Program. (IF 0.685) Pub Date : 20200217
Luca Aceto, Antonis Achilleos, Adrian Francalanza, Anna IngólfsdóttirWe introduce the completeness problem for Modal Logic (possibly with fixpoint operators) and examine its complexity. A formula is called complete, if any two satisfying processes are bisimilar. The completeness problem is closely connected to the characterization problem, which asks whether a given formula characterizes a given process up to bisimulation equivalence. We discover that completeness,

A verified proof checker for higherorder logic J. Log. Algebr. Methods Program. (IF 0.685) Pub Date : 20200217
Oskar AbrahamssonWe present a computer program for checking proofs in higherorder logic (HOL) that is verified to accept only valid proofs. The proof checker is defined as functions in HOL and synthesized to CakeML code, and uses the Candle theorem prover kernel to check logical inferences. The checker reads proofs in the OpenTheory article format, which means proofs produced by various HOL proof assistants are supported

Process calculi as a tool for studying coordination, contracts and session types J. Log. Algebr. Methods Program. (IF 0.685) Pub Date : 20200217
Mario Bravetti, Gianluigi ZavattaroWe recall techniques, mainly based on the theory of process calculi, that we used to prove results in twenty years of research, spanning across the old and the new millennium, on the expressiveness of coordination languages and on behavioural contracts for ServiceOriented Computing. Then, we show how such techniques recently contributed to the clarification of aspects that were unclear about session

Spreading nets: A uniform approach to unfoldings J. Log. Algebr. Methods Program. (IF 0.685) Pub Date : 20200214
G. Michele Pinna, Eric FabreThis paper is devoted to the study of the notion of spread net. A spread net is a (safe) Petri nets where each place is annotated with some information, taken from a suitable information domain, about how such place can get marked. Spread nets generalize various kinds of nets used to represent the non sequential behaviours of a safe net, like unfoldings, merged processes or trellis processes. The spreading

Preface to the special issue on the 11th International Conference on Graph Transformation J. Log. Algebr. Methods Program. (IF 0.685) Pub Date : 20200124
Leen Lambers, Jens WeberThis special issue contains extended versions of four selected papers from the 11th International Conference on Graph Transformation (ICGT 2018). The articles cover a tool for computing core graphs via SAT/SMT solvers (graph language definition), graph transformation through graph surfing in reaction systems (a new graph transformation formalism), the essence and initiality of conflicts in Madhesive

Determinizing monitors for HML with recursion J. Log. Algebr. Methods Program. (IF 0.685) Pub Date : 20191231
Luca Aceto, Antonis Achilleos, Adrian Francalanza, Anna Ingólfsdóttir, Sævar Örn KjartanssonWe examine the determinization of monitors for HML with recursion. We demonstrate that every monitor is equivalent to a deterministic one, which is at most doubly exponential in size with respect to the original monitor. When monitors are described as CCSlike processes, this doubly exponential bound is optimal. When (deterministic) monitors are described as finite automata (or as their labeled transition

Abstracting models of strong normalization for classical calculi J. Log. Algebr. Methods Program. (IF 0.685) Pub Date : 20191220
Paul Downen, Philip JohnsonFreyd, Zena M. AriolaModern programming languages have effects and mix multiple calling conventions, and their core calculi should too. We characterize calling conventions by their “substitution discipline” that says what variables stand for, and design calculi for mixing disciplines in a single program. Building on variations of the reducibility candidates method, including biorthogonality and symmetric candidates which

Ground confluence of ordersorted conditional specifications modulo axioms J. Log. Algebr. Methods Program. (IF 0.685) Pub Date : 20191126
Francisco Durán, José Meseguer, Camilo RochaTerminating functional programs should be deterministic, i.e., should evaluate to a unique result, regardless of the evaluation order. For equational functional programs such determinism is exactly captured by the ground confluence property. For operationally terminating conditional equations this is equivalent to ground local confluence, which follows from local confluence. Checking local confluence

A formal approach to the engineering of domainspecific distributed systems J. Log. Algebr. Methods Program. (IF 0.685) Pub Date : 20191126
Rocco De Nicola, Gianluigi Ferrari, Rosario Pugliese, Francesco TiezziWe review some results regarding specification, programming and verification of different classes of distributed systems which stemmed from the research of the Concurrency and Mobility Group at University of Firenze. More specifically, we examine the distinguishing features of networkaware programming, serviceoriented computing, autonomic computing, and collective adaptive systems programming. We

A partial evaluation framework for ordersorted equational programs modulo axioms J. Log. Algebr. Methods Program. (IF 0.685) Pub Date : 20191031
M. Alpuente, A. CuencaOrtega, S. Escobar, J. MeseguerPartial evaluation is a powerful and general program optimization technique with many successful applications. Existing PE schemes do not apply to expressive rulebased languages like Maude, CafeOBJ, OBJ, ASF+SDF, and ELAN, which support: 1) rich type structures with sorts, subsorts, and overloading; and 2) equational rewriting modulo various combinations of axioms such as associativity, commutativity

Introducing complexity to formal testing J. Log. Algebr. Methods Program. (IF 0.685) Pub Date : 20191031
Ismael Rodríguez, Fernando RosaVelardo, Fernando RubioA general theory introducing asymptotic complexity to testing is presented. Our goal is measuring how fast the effort of testing must increase to reach higher levels of partial certainty on the correctness of the implementation under test (IUT). By recent works it is known that, for many practical testing scenarios, any partial level of correctness certainty less than 1 (where 1 means full certainty)

Preface for the special issue on Interaction and Concurrency Experience 2017 J. Log. Algebr. Methods Program. (IF 0.685) Pub Date : 20191025
Massimo Bartoletti, Laura Bocchi, Ludovic Henrio, Sophia KnightWe present the content of the special issue consisting of selected articles from the 10th Interaction and Concurrency Experience workshop (ICE 2017). The theoretical results contributed by the ICE workshops and by these articles in particular aim at being applicable to real concurrent and distributed systems.

A lineartime–branchingtime spectrum for behavioral specification theories J. Log. Algebr. Methods Program. (IF 0.685) Pub Date : 20191018
Uli Fahrenberg, Axel LegayWe propose behavioral specification theories for most equivalences in the lineartime–branchingtime spectrum. Almost all previous work on specification theories focuses on bisimilarity, but there is a clear interest in specification theories for other preorders and equivalences. We show that specification theories for preorders cannot exist and develop a general scheme which allows us to define behavioral

A calculus of concurrent graphrewriting processes J. Log. Algebr. Methods Program. (IF 0.685) Pub Date : 20191016
Géza Kulcsár, Andrea Corradini, Malte LochauStateoftheart approaches to controlled graph rewriting focus on the specification of an external control layer over graphrewriting rule applications and on the inputoutput semantics of the resulting systems, leading to a decreased relevance of many interesting operational aspects of graph transformation, as studied in the classical theory of algebraic graph rewriting. We propose a novel approach

Leveraging access mode declarations in a model for memory consistency in heterogeneous systems J. Log. Algebr. Methods Program. (IF 0.685) Pub Date : 20191009
Ludovic Henrio, Christoph Kessler, Lu LiOn a system that exposes disjoint memory spaces to the software, a program has to address memory consistency issues and perform data transfers so that it always accesses valid data. Several approaches exist to ensure the consistency of the memory accessed. Here we are interested in the verification of a declarative approach where each component of a computation is annotated with an access mode declaring

Programming and symbolic computation in Maude J. Log. Algebr. Methods Program. (IF 0.685) Pub Date : 20191008
Francisco Durán, Steven Eker, Santiago Escobar, Narciso MartíOliet, José Meseguer, Rubén Rubio, Carolyn TalcottRewriting logic is both a flexible semantic framework within which widely different concurrent systems can be naturally specified and a logical framework in which widely different logics can be specified. Maude programs are exactly rewrite theories. Maude has also a formal environment of verification tools. Symbolic computation is a powerful technique for reasoning about the correctness of concurrent

A coordination protocol language for power grid operation control J. Log. Algebr. Methods Program. (IF 0.685) Pub Date : 20190920
Yehia Abd Alrahman, Hugo Torres VieiraFuture power distribution grids will comprise a large number of components, each potentially able to carry out operations autonomously. Clearly, in order to ensure safe operation of the grid, individual operations must be coordinated among the different components. Since operation safety is a global property, modelling component coordination typically involves reasoning about systems at a global level

From distributed coordination to field calculus and aggregate computing J. Log. Algebr. Methods Program. (IF 0.685) Pub Date : 20190910
Mirko Viroli, Jacob Beal, Ferruccio Damiani, Giorgio Audrito, Roberto Casadei, Danilo PianiniAggregate computing is an emerging approach to the engineering of complex coordination for distributed systems, based on viewing system interactions in terms of information propagating through collectives of devices, rather than in terms of individual devices and their interaction with their peers and environment. The foundation of this approach is the distillation of a number of prior approaches,

Connecting open systems of communicating finite state machines J. Log. Algebr. Methods Program. (IF 0.685) Pub Date : 20190906
Franco Barbanera, Ugo de'Liguoro, Rolf HennickerCommunicating Finite State Machines (CFSMs) are an established model for describing and analysing distributed systems whose concurrently running components communicate via FIFOchannels. Systems of CFSMs are usually considered as closed systems which do not provide access points for communication with the environment. In our study we relax this view such that certain components of a CFSM system can

A dynamic logic for learning theory J. Log. Algebr. Methods Program. (IF 0.685) Pub Date : 20190903
Alexandru Baltag, Nina Gierasimczuk, Aybüke Özgün, Ana Lucia Vargas Sandoval, Sonja SmetsBuilding on previous work [4], [5] that bridged Formal Learning Theory and Dynamic Epistemic Logic in a topological setting, we introduce a Dynamic Logic for Learning Theory (DLLT), extending Subset Space Logics [18], [10] with dynamic observation modalities [o]φ, as well as with a learning operator L(o→), which encodes the learner's conjecture after observing a finite sequence of data o→. We completely

On the essence and initiality of conflicts in Madhesive transformation systems J. Log. Algebr. Methods Program. (IF 0.685) Pub Date : 20190826
Guilherme Grochau Azzi, Andrea Corradini, Leila RibeiroUnderstanding conflicts between transformation steps and rules is an important topic in algebraic graph transformation. A conflict occurs when two transformation steps are not parallel independent, that is, when after applying one of them the other can no longer occur. A static analysis technique called Critical Pair Analysis allows the detection of all potential conflicts between pairs of rules, by

CoReS: A tool for computing core graphs via SAT/SMT solvers J. Log. Algebr. Methods Program. (IF 0.685) Pub Date : 20190823
Barbara König, Maxime Nederkorn, Dennis NolteWhen specifying graph languages via type graphs, cores provide a convenient way to minimize the type graph without changing the corresponding graph language, i.e. the set of graphs that can be mapped homomorphically into the given type graph. However, given a type graph, the problem of finding its core is NPhard. Using the tool CoReS, we automatically encode all required properties into SAT and SMTformulas

Generalized rewrite theories, coherence completion, and symbolic methods J. Log. Algebr. Methods Program. (IF 0.685) Pub Date : 20190821
José MeseguerA new notion of generalized rewrite theory suitable for symbolic reasoning and generalizing the standard notion in [19] is motivated and defined. Also, new requirements for symbolic executability of generalized rewrite theories that extend those in [33] for standard rewrite theories, including a generalized notion of coherence, are given. Symbolic executability, including coherence, is both ensured

Graph transformation through graph surfing in reaction systems J. Log. Algebr. Methods Program. (IF 0.685) Pub Date : 20190813
HansJörg Kreowski, Grzegorz RozenbergIn this paper, we introduce graphbased reaction systems as a generalization of setbased reaction systems, a novel and wellinvestigated model of interactive computation. Graphbased reaction systems allow us to introduce a new methodology for graph transformation, which is not based on the traditional “cut, add, and paste” approach, but rather on moving within a “universe” graph B (surfing on B)

Ensuring liveness properties of distributed systems: Open problems J. Log. Algebr. Methods Program. (IF 0.685) Pub Date : 20190731
Rob van GlabbeekOften fairness assumptions need to be made in order to establish liveness properties of distributed systems, but in many situations they lead to false conclusions. This document presents a research agenda aiming at laying the foundations of a theory of concurrency that is equipped to ensure liveness properties of distributed systems without making fairness assumptions. This theory will encompass process