scholarly journals A Linear-Time Transition System for Crossing Interval Trees

2015 ◽  
Author(s):  
Emily Pitler ◽  
Ryan McDonald
Keyword(s):  
Linear Time ◽  
Transition System ◽  
Interval Trees

MODEL CHECKING OF COMPONENT BASED SOFTWARE USING COMPOSITIONAL REDUCTIONS

2008 ◽  
Vol 18 (05) ◽  
pp. 683-712 ◽  
Author(s):  
MOHAMMAD IZADI ◽  
ALI MOVAGHAR
Keyword(s):  
Model Checking ◽  
Composition Operators ◽  
Linear Time ◽  
Operational Semantics ◽  
Computing System ◽  
Transition System ◽  
Compositional Model ◽  
Temporal Properties ◽  
Labeled Transition System ◽  
Constraint Automata

A component-based computing system consists of two main parts: a set of components and a coordination subsystem. Reo is an exogenous coordination language for compositional construction of the coordination subsystem. Constraint automaton has been defined as the operational semantics of Reo. The main goal of this paper is to prepare a model checking method for verifying linear time temporal properties of component-based systems whose coordinating subsystems are modeled by Reo and components are modeled by labeled transition systems. For this purpose, we introduce modified definitions of constraint automata and their composition operators by which, every constraint automaton can be considered as a labeled transition system and each labeled transition system can be translated into a constraint automaton. We show that failure-based equivalences CFFD and NDFD are congruences with respect to the composition operators of constraint automata. Also we present a method for compositional model checking of component-based systems using these equivalences for reducing the sizes of constraint automata models.

scholarly journals Constrained Arc-Eager Dependency Parsing

2014 ◽  
Vol 40 (2) ◽  
pp. 249-527 ◽  
Author(s):  
Joakim Nivre ◽  
Yoav Goldberg ◽  
Ryan McDonald
Keyword(s):  
Time Complexity ◽  
Linear Time ◽  
Transition System ◽  
Dependency Graph ◽  
Dependency Parsing ◽  
Beam Search ◽  
Different Types

Arc-eager dependency parsers process sentences in a single left-to-right pass over the input and have linear time complexity with greedy decoding or beam search. We show how such parsers can be constrained to respect two different types of conditions on the output dependency graph: span constraints, which require certain spans to correspond to subtrees of the graph, and arc constraints, which require certain arcs to be present in the graph. The constraints are incorporated into the arc-eager transition system as a set of preconditions for each transition and preserve the linear time complexity of the parser.

scholarly journals A Linear Parallel Algorithm to Compute Bisimulation and Relational Coarsest Partitions

2021 ◽  
pp. 115-133
Author(s):  
Jan Martens ◽  
Jan Friso Groote ◽  
Lars van den Haak ◽  
Pieter Hijma ◽  
Anton Wijs
Keyword(s):  
Parallel Algorithm ◽  
Time Complexity ◽  
Linear Time ◽  
Random Access ◽  
Time Algorithm ◽  
Transition System ◽  
Linear Time Algorithm

AbstractThe most efficient way to calculate strong bisimilarity is by finding the relational coarsest partition of a transition system. We provide the first linear-time algorithm to calculate strong bisimulation using parallel random access machines (PRAMs). More precisely, with n states, m transitions and $$| Act |\le m$$ | A c t | ≤ m action labels, we provide an algorithm for $$\max (n,m)$$ max ( n , m ) processors that calculates strong bisimulation in time $$\mathcal {O}(n+| Act |)$$ O ( n + | A c t | ) and space $$\mathcal {O}(n+m)$$ O ( n + m ) . The best-known PRAM algorithm has time complexity $$\mathcal {O}(n\log n)$$ O ( n log n ) on a smaller number of processors making it less suitable for massive parallel devices such as GPUs. An implementation on a GPU shows that the linear time-bound is achievable on contemporary hardware.

scholarly journals Joint Incremental Disfluency Detection and Dependency Parsing

2014 ◽  
Vol 2 ◽  
pp. 131-142 ◽  
Author(s):  
Matthew Honnibal ◽  
Mark Johnson
Keyword(s):  
State Of The Art ◽  
Linear Time ◽  
Joint Model ◽  
Transition System ◽  
Dependency Parsing ◽  
Pipeline Systems

We present an incremental dependency parsing model that jointly performs disfluency detection. The model handles speech repairs using a novel non-monotonic transition system, and includes several novel classes of features. For comparison, we evaluated two pipeline systems, using state-of-the-art disfluency detectors. The joint model performed better on both tasks, with a parse accuracy of 90.5% and 84.0% accuracy at disfluency detection. The model runs in expected linear time, and processes over 550 tokens a second.

A Theory of Distributed Markov Chains

2020 ◽  
Author(s):  
P.S. Thiagarajan ◽  
Shaofa Yang
Keyword(s):  
Markov Chains ◽  
Petri Net ◽  
Linear Time ◽  
Transition System ◽  
Bounded Linear ◽  
Core Theory ◽  
Disjoint Sets ◽  
Linear Time Temporal Logic ◽  
Dynamical Properties ◽  
Checking Procedure

We present the theory of distributed Markov chains (DMCs). A DMC consists of a collection of communicating probabilistic agents in which the synchronizations determine the probability distribution for the next moves of the participating agents. The key feature of a DMC is that the synchronizations are deterministic, in the sense that any two simultaneously enabled synchronizations involve disjoint sets of agents. Using our theory of DMCs we show how one can analyze the behavior using the interleaved semantics of the model. A key point is, the transition system which defines the interleaved semantics is—except in degenerate cases—not a Markov chain. Hence one must develop new techniques to analyze these behaviors exhibiting both concurrency and stochasticity. After establishing the core theory we develop a statistical model checking procedure which verifies the dynamical properties of the trajectories generated by the the model. The specifications consist of Boolean combinations of component-wise bounded linear time temporal logic formulas. We also provide a probabilistic Petri net representation of DMCs and use it to derive a probabilistic event structure semantics.

scholarly journals A logic for synchronous transitions with dynamic conflict resolution

2000 ◽  
Vol 3 (2) ◽  
Author(s):  
Vanderlei Moraes Rodrigues ◽  
Flavio Rech Wagner
Keyword(s):  
Conflict Resolution ◽  
Linear Time ◽  
Transition System ◽  
Temporal Logics ◽  
Computation Model ◽  
Formal Reasoning ◽  
Resolution Method ◽  
Transition Systems ◽  
Synchronous Computation ◽  
Linear Time Temporal Logic

This paper introduces a formalism named DSYNC aimed at. the design and verification of synchronous concurrent systems. The components of this formalism are a transition system and first-order linear-time temporal logic. The DSYNC transition system adopts a synchronous computation model, includes a method to solve write-conflicts, and represents transitions as possibly non-terminating imperative commands. The conflict resolution method is dynamic because it detects conflicts at run-time. The DSYNC logic allows for formal reasoning about DSYNC transition systems using compositional and modular proofs. Such features are missing in other formalisms based on transition systems and temporal logics, although they are important for the verification of a large class of systems. This paper also discusses some of the pragmatics in verifying systems with DSYNC; and considers some extensions to the formalism. DSYNC is based on hte Hoare logic and the UNITY formalism. 

A Real Time Control Architecture for Continuously Managing Patients in a Care Unit

1995 ◽  
Vol 34 (05) ◽  
pp. 475-488
Author(s):  
B. Seroussi ◽  
J. F. Boisvieux ◽  
V. Morice
Keyword(s):  
Real Time ◽  
Linear Time ◽  
Treatment Plan ◽  
Control Architecture ◽  
Real Time Control ◽  
Time Representation ◽  
Time Control ◽  
Continuous Support ◽  
Definition Of ◽  
Computerized System

Abstract:The monitoring and treatment of patients in a care unit is a complex task in which even the most experienced clinicians can make errors. A hemato-oncology department in which patients undergo chemotherapy asked for a computerized system able to provide intelligent and continuous support in this task. One issue in building such a system is the definition of a control architecture able to manage, in real time, a treatment plan containing prescriptions and protocols in which temporal constraints are expressed in various ways, that is, which supervises the treatment, including controlling the timely execution of prescriptions and suggesting modifications to the plan according to the patient’s evolving condition. The system to solve these issues, called SEPIA, has to manage the dynamic, processes involved in patient care. Its role is to generate, in real time, commands for the patient’s care (execution of tests, administration of drugs) from a plan, and to monitor the patient’s state so that it may propose actions updating the plan. The necessity of an explicit time representation is shown. We propose using a linear time structure towards the past, with precise and absolute dates, open towards the future, and with imprecise and relative dates. Temporal relative scales are introduced to facilitate knowledge representation and access.

Sign in / Sign up

Export Citation Format

Share Document