Kleene Theorems for Synchronous Products with Matching
نویسندگان
چکیده
In earlier work [LMP11], we showed that a graph-theoretic condition called “structural cyclicity” enables us to extract syntax from a conflict-equivalent product system of automata. In this paper we have a “pairing” property in our syntax which allows us to connect to a broader class of synchronous product systems [Arn94] with a “matching” property, where the conflict-equivalence is not statically fixed. These systems have been related to labelled free choice nets.
منابع مشابه
PMU-Based Matching Pursuit Method for Black-Box Modeling of Synchronous Generator
This paper presents the application of the matching pursuit method to model synchronous generator. This method is useful for online analysis. In the proposed method, the field voltage is considered as input signal, while the terminal voltage and active power of the generator are output signals. Usually, the difference equation with a second degree polynomial structure is used to estimate the co...
متن کاملDeciding Synchronous Kleene Algebra with Derivatives
Synchronous Kleene algebra (SKA) is a decidable framework that combines Kleene algebra (KA) with a synchrony model of concurrency. Elements of SKA can be seen as processes taking place within a fixed discrete time frame and that, at each time step, may execute one or more basic actions or then come to a halt. The synchronous Kleene algebra with tests (SKAT) combines SKA with a Boolean algebra. ...
متن کاملSynchronous Kleene Algebra vs. Concurrent Kleene Algebra
In this year’s CONCUR conference Concurrent Kleene Algebra (CKA) is presented as a general formalism for reasoning about concurrent programs. Also recently Synchronous Kleene Algebra (SKA) was investigated by this author with the purpose of representing and reasoning about actions/programs that have a notion of concurrency in the style of synchrony of the SCCS calculus. CKA has, at first sight,...
متن کاملKleene Theorems for skew formal power series
We investigate the theory of skew (formal) power series introduced by Droste, Kuske [5, 6], if the basic semiring is a Conway semiring. This yields Kleene Theorems for skew power series, whose supports contain finite and infinite words. We then develop a theory of convergence in semirings of skew power series based on the discrete convergence. As an application this yields a Kleene Theorem prov...
متن کاملKleene Theorems for Labelled Free Choice Nets without product acceptance condition
In an earlier work [18], we provided expressions for free choice nets having “distributed choice property” which makes the nets “direct product” representable. In a recent work [17], we gave equivalent syntax for a larger class of free choice nets obtained by dropping “distributed choice property”, thus syntactically characterizing nets which are not representable by direct products also. In bo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Trans. Petri Nets and Other Models of Concurrency
دوره 10 شماره
صفحات -
تاریخ انتشار 2015