Publication

Soundness and Equivalence of Petri Nets and Annotated Finite State Automate: A Comparison in the SOA Context

Related publications (56)

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

Lower Bounds for Unambiguous Automata via Communication Complexity

Mika Tapani Göös, Weiqiang Yuan

We use results from communication complexity, both new and old ones, to prove lower bounds for unambiguous finite automata (UFAs). We show three results. 1) Complement: There is a language L recognised by an n-state UFA such that the complement language ...

Schloss Dagstuhl - Leibniz-Zentrum für Informatik2022

, ,

Claude Shannon, in his famous thesis (1938), revolutionized circuit design by showing that Boolean algebra subsumes all ad-hoc methods that are used in designing switching circuits, or combinational circuits as they are commonly known today. But what is ...

2020

Extending Business Process Models with Appreciation

Gil Regev, Alain Wegmann, Irina Rychkova

We use homeostasis, the maintenance of steady states in an organism, to explain some of the decisions made by participants in a business process. We use Vickers’ Appreciative System to model the homeostatic states with Harel’s statecharts. We take the exam ...

2019

This paper discusses Five Management Pillars for Digital Transformation integrating the Lean Thinking Philosophy. It proposes a "Digital Lean Transformation Framework" where its five management pillars - (Digital) Strategic Management, Processes (Re-)Engin ...

IEEE2019

The traditional synthesis question given a specification asks for the automatic construction of a system that satisfies the specification, whereas often there exists a preference order among the different systems that satisfy the given specification. Under ...

Assoc Computing Machinery2015

This paper studies the second-order coding rates for memoryless channels with a state sequence known non-causally at the encoder. In the case of finite alphabets, an achievability result is obtained using constant-composition random coding, and by using a ...

Institute of Electrical and Electronics Engineers2015

Architecture and characterization of a calibrator for PMUs operating in power distribution systems

Mario Paolone, Paolo Romano, Marco Pignati, Lorenzo Zanni, Daniele Colangelo, Jean-Pierre Braun

In recent years, the Phasor Measurement Unit (PMU) technology is rapidly evolving towards the potential deployment also in power distribution systems (DSs). In general, this specific field of applications requires PMUs whose accuracy levels are beyond thos ...

IEEE2015

For Coordination, State Component Transitions

Simon Bliudze, Anastasia Mavridou, Radoslaw Szymanek, Alina Zolotukhina

Coordinating component behaviour and, in particular, concurrent access to resources is among the key difficulties of building large concurrent systems. To address this, developers must be able to manipulate high-level concepts, such as Finite State Machine ...

2013

Integration of BIP into Connectivity Factory: Implementation

Simon Bliudze, Anastasia Mavridou, Radoslaw Szymanek, Alina Zolotukhina

2013

Control design for specifications on stochastic hybrid systems

Maryam Kamgarpour

We synthesize controllers for discrete-time stochastic hybrid systems such that the probability of satisfying a given specification on the system is maximized. The specifications are defined with finite state automata. It is shown that automata satisfactio ...

2012