Mathematical Operational Semantics and Finitary System Behaviour Stefan Milius, Marcello Bonsangue, Robert Myers, Jurriaan Rot.

Slides:



Advertisements
Similar presentations
Lecture 6 Nondeterministic Finite Automata (NFA)
Advertisements

Event structures Mauro Piccolo. Interleaving Models Trace Languages:  computation described through a non-deterministic choice between all sequential.
Deterministic Negotiations: Concurrency for Free Javier Esparza Technische Universität München Joint work with Jörg Desel and Philipp Hoffmann.
Process Algebra (2IF45) Probabilistic Process Algebra Suzana Andova.
Process Algebra (2IF45) Probabilistic Process Algebra Suzana Andova.
Platzhalter für Bild, Bild auf Titelfolie hinter das Logo einsetzen Marcello Bonsangue, Stefan Milius, Alexandra Silva Coalgebras and Generalized Regular.
1 Introduction to Computability Theory Lecture3: Regular Expressions Prof. Amos Israeli.
A Semantic Characterization of Unbounded-Nondeterministic Abstract State Machines Andreas Glausch and Wolfgang Reisig 1.
1 Introduction to Computability Theory Lecture3: Regular Expressions Prof. Amos Israeli.
Courtesy Costas Busch - RPI1 Non Deterministic Automata.
Finite Automata Finite-state machine with no output. FA consists of States, Transitions between states FA is a 5-tuple Example! A string x is recognized.
Specification Formalisms Book: Chapter 5. Properties of formalisms Formal. Unique interpretation. Intuitive. Simple to understand (visual). Succinct.
1 Ivan Lanese Computer Science Department University of Bologna Roberto Bruni Computer Science Department University of Pisa A mobile calculus with parametric.
Functional Design and Programming Lecture 10: Regular expressions and finite state machines.
1 Formal Models for Distributed Negotiations Concurrent Languages Translation Roberto Bruni Dipartimento di Informatica Università di Pisa XVII Escuela.
1212 Models of Computation: Automata and Processes Jos Baeten.
Model Checking Anders P. Ravn Department of Computer Science, Aalborg University, Denmark Hybrid Systems – PhD School Aalborg University January 2007.
1 IFM 2005 – November 30, 2005 EXP.OPEN 2.0 A flexible tool integrating partial order, compositional, and on-the-fly verification methods Frédéric Lang.
Specification Formalisms Book: Chapter 5. Properties of formalisms Formal. Unique interpretation. Intuitive. Simple to understand (visual). Succinct.
1 Ivan Lanese Computer Science Department University of Bologna Italy Concurrent and located synchronizations in π-calculus.
Fall 2006Costas Busch - RPI1 Non-Deterministic Finite Automata.
PZ02B Programming Language design and Implementation -4th Edition Copyright©Prentice Hall, PZ02B - Regular grammars Programming Language Design.
Normal forms for Context-Free Grammars
1 Non-Deterministic Automata Regular Expressions.
Costas Busch - LSU1 Non-Deterministic Finite Automata.
1212 Models of Computation: Automata and Processes Jos Baeten.
1 Non-Deterministic Finite Automata. 2 Alphabet = Nondeterministic Finite Automaton (NFA)
Abstract Verification is traditionally done by determining the truth of a temporal formula (the specification) with respect to a timed transition system.
Synchronizations with Mobility for Graph Transformations joint work with Ugo Montanari Dipartimento di Informatica Università di Pisa Ivan Lanese Dipartimento.
Lecture 3 Graph Representation for Regular Expressions
Regular Model Checking Ahmed Bouajjani,Benget Jonsson, Marcus Nillson and Tayssir Touili Moran Ben Tulila
Introduction to ASMs Dumitru Roman Digital Enterprise Research Institute
Coalgebraic Symbolic Semantics Filippo Bonchi Ugo Montanari.
Transformation of Timed Automata into Mixed Integer Linear Programs Sebastian Panek.
PZ02B Programming Language design and Implementation -4th Edition Copyright©Prentice Hall, PZ02B - Regular grammars Programming Language Design.
Mathematical Operational Semantics and Finitary System Behaviour Stefan Milius, Marcello Bonsangue, Robert Myers, Jurriaan Rot.
Reactive systems – general
2G1516 Formal Methods2005 Mads Dam IMIT, KTH 1 CCS: Operational Semantics And Process Algebra Mads Dam Reading: Peled 8.3, 8.4, 8.6 – rest of ch. 8.
Managing XML and Semistructured Data Lecture 13: XDuce and Regular Tree Languages Prof. Dan Suciu Spring 2001.
Regular Expressions CIS 361. Need finite descriptions of infinite sets of strings. Discover and specify “regularity”. The set of languages over a finite.
Categorical Categorical theory of state-based systems in Sets : bisimilarity in Kleisli: trace semantics [Hasuo,Jacobs,Sokolova LMCS´07] in Sets : bisimilarity.
Weak Bisimilarity Coalgebraically Andrei Popescu Department of Computer Science University of Illinois.
Lecture 5 1 CSP tools for verification of Sec Prot Overview of the lecture The Casper interface Refinement checking and FDR Model checking Theorem proving.
Discrete Simulation of Behavioural Hybrid Process Calculus Tomas Krilavičius Helen Shonenberg University of Twente.
2G1516 Formal Methods2005 Mads Dam IMIT, KTH 1 CCS: Processes and Equivalences Mads Dam Reading: Peled 8.5.
Logics, automata and algorithms for graphs p. madhusudan (madhu) University of Illinois at Urbana-Champaign, USA.
T. Gregory BandyInteraction Machines SeminarFebruary 21, Union College - Computer Science Graduate Program Interaction Machines Are they more.
Algorithms for hard problems Automata and tree automata Juris Viksna, 2015.
Process Algebra (2IF45) Basic Process Algebra Dr. Suzana Andova.
CSCI 4325 / 6339 Theory of Computation Zhixiang Chen.
Operational Semantics Mooly Sagiv Reference: Semantics with Applications Chapter 2 H. Nielson and F. Nielson
1 Regular grammars Programming Language Design and Implementation (4th Edition) by T. Pratt and M. Zelkowitz Prentice Hall, 2001 Section
Formal Methods in software development
Non Deterministic Automata
Regular grammars Programming Language Design and Implementation (4th Edition) by T. Pratt and M. Zelkowitz Prentice Hall, 2001 Section
Process Algebra (2IF45) Expressiveness of BPArec
OTHER MODELS OF TURING MACHINES
PARSE TREES.
Automata and Formal Languages (CS 350/550)
Non-Deterministic Finite Automata
CSE322 Definition and description of finite Automata
Non Deterministic Automata
Finite Automata.
From: String Generation for Testing Regular Expressions
Formal Methods in software development
Regular grammars Programming Language Design and Implementation (4th Edition) by T. Pratt and M. Zelkowitz Prentice Hall, 2001 Section
Chapter 1 Regular Language
Regular grammars Programming Language Design and Implementation (4th Edition) by T. Pratt and M. Zelkowitz Prentice Hall, 2001 Section
PZ02B - Regular grammars Programming Language Design and Implementation (4th Edition) by T. Pratt and M. Zelkowitz Prentice Hall, 2001 Section PZ02B.
A MODULAR LTS FOR OPEN REACTIVE SYSTEMS
Presentation transcript:

Mathematical Operational Semantics and Finitary System Behaviour Stefan Milius, Marcello Bonsangue, Robert Myers, Jurriaan Rot

Motivation Mathematical Operational Semantics and Finitary System Behaviour | Oberseminar Erlangen | October 29, Process algebra: SOS rules specify algebraic operations on system behaviour. GSOS format  well-behaved operations (bisimilarity is a congruence) Aceto‘s Theorem: The term model of a simple GSOS specification is regular. Turi & Plotkin (Power et al., Bartels, Klin, …): Mathematical operational semantics Interplay between syntax and semantics (sos rules) captured by distributive laws Main question: Can Aceto‘s Theorem be generalized to mathematical operational semantics? Our results: Generalization of Aceto‘s Theorem Abstract rule format specifying operations on rational behaviour Applications: concrete formats for: streams, (weighted) LTS‘s, (non-)determ. automata B. Bloom, S. Istrail & A. Meyer: Bisimlation can‘t be traced. JACM 42, 1995.

Overview ●Abstract GSOS rules of Turi & Plotkin ●Simple GSOS and Aceto‘s Theorem ●Generalization of Aceto‘s Theorem ●Operations on rational behaviour ●Applications Mathematical Operational Semantics and Finitary System Behaviour | Oberseminar Erlangen | October 29, 20133

Overview ●Abstract GSOS rules of Turi & Plotkin ●Simple GSOS and Aceto‘s Theorem ●Generalization of Aceto‘s Theorem ●Operations on rational behaviour ●Applications Mathematical Operational Semantics and Finitary System Behaviour | Oberseminar Erlangen | October 29, 20134

Operations on behaviour Mathematical Operational Semantics and Finitary System Behaviour | Oberseminar Erlangen | October 29, SOS rules specify algebraic operations on system behaviour. Example: Milner‘s CCS combinators Example: the zip-operation on streams: Example: the shuffle-operation on languages:

Mathematical Operational Semantics and Finitary System Behaviour | Oberseminar Erlangen | October 29, Abstract GSOS rules Turi‘s and Plotkin‘s abstract GSOS rules: behaviour functor free (term) monad signature functor initial final ¸ -bialgebra operational model denotational model

Example: labelled transition systems GSOS format Rational Operational Models | MFPS XXIX | June 23, B. Bloom, S. Istrail & A. Meyer: Bisimulation can‘t be traced. J. ACM 42, Classical transition system specifications with rules of the form operation symbol from given signature Σ Example: Milner‘s CCS combinators

Overview ●Abstract GSOS rules of Turi & Plotkin ●Simple GSOS and Aceto‘s Theorem ●Generalization of Aceto‘s Theorem ●Operations on rational behaviour ●Applications Mathematical Operational Semantics and Finitary System Behaviour | Oberseminar Erlangen | October 29, 20138

Rational Operational Models | MFPS XXIX | June 23, Example: labelled transition systems Aceto‘s Simple GSOS L. Aceto: GSOS and Finite Labelled Transition Systems, TCS 131, Classical transition system specifications with rules of the form

Aceto‘s Theorem Rational Operational Models | MFPS XXIX | June 23, How to generalize this to distributive laws? Theorem (L. Aceto). For a bounded transition system specification having finite dependency the operational model is regular. Examples: infinite dependencyfinite dependency L. Aceto: GSOS and finite labelled transition systems. TCS 131, 1994.

Overview ●Abstract GSOS rules of Turi & Plotkin ●Simple GSOS and Aceto‘s Theorem ●Generalization of Aceto‘s Theorem ●Operations on rational behaviour ●Applications Mathematical Operational Semantics and Finitary System Behaviour | Oberseminar Erlangen | October 29,

Bipointed Specifications Mathematical Operational Semantics and Finitary System Behaviour | Oberseminar Erlangen | October 29, Definition: Bipointed specifications are natural transformations Given: Example: bipointed specifications = simple GSOS specification with bounded opns What about finite dependency?

Finite dependency Mathematical Operational Semantics and Finitary System Behaviour | Oberseminar Erlangen | October 29, Definition: Preserving finitely presentable objects Example:

Aceto‘s Theorem generalized Rational Operational Models | MFPS XXIX | June 23, Operational model Theorem. Definition. finitely presentable objects unique Example.

Overview ●Abstract GSOS rules of Turi & Plotkin ●Simple GSOS and Aceto‘s Theorem ●Generalization of Aceto‘s Theorem ●Operations on rational behaviour ●Applications Mathematical Operational Semantics and Finitary System Behaviour | Oberseminar Erlangen | October 29,

(Rational) Denotational Model Mathematical Operational Semantics and Finitary System Behaviour | Oberseminar Erlangen | October 29, Denotational model Now consider: final locally finite F-coalgebra finitely presentable objects Proposition. J. Adamek, S. Milius, J. Velebil: Iterative Algebras at Work, MSCS 2006 unique

Examples Mathematical Operational Semantics and Finitary System Behaviour | Oberseminar Erlangen | October 29, More examples: rational formal power series, rational Ʃ -trees, rational ¸ -trees, …

Operations on the rational fixpoint Mathematical Operational Semantics and Finitary System Behaviour | Oberseminar Erlangen | October 29, Theorem. „rational denotational model“ unique F-coalgeba homomorphism Extends: M. Bonsangue, S. Milius, J. Rot: On the specification of operations on the rational behaviour of systems, EXPRESS/SOS 2012.

What about more general rule formats? Counterexample:rational behaviour is not closed under operations specified by abstract GSOS rules Conjecture: all results still hold true for Klin‘s „coGSOS“ laws: cofree comonad on F

Overview ●Abstract GSOS rules of Turi & Plotkin ●Simple GSOS and Aceto‘s Theorem ●Generalization of Aceto‘s Theorem ●Operations on rational behaviour ●Applications Mathematical Operational Semantics and Finitary System Behaviour | Oberseminar Erlangen | October 29,

Application 1: Labelled Transition Systems Mathematical Operational Semantics and Finitary System Behaviour | Oberseminar Erlangen | October 29, Corollary. Operations defined by simple GSOS rules restrict to the rational fixpoint of F. coproduct of all finite labelled transition systems modulo bisimilarity Examples. All CCS combinators, e.g. Corollary. Aceto's Theorem.

Application 2: Streams Corollary. Operations defined by bipointed stream SOS rules restrict to eventually periodic streams. Examples. coGSOS rule Mathematical Operational Semantics and Finitary System Behaviour | Oberseminar Erlangen | October 29, 2013

Application 3: Non-deterministic automata Bipointed NDA SOS specifications accepting states Remark. This format is not complete w.r.t. to bipointed specifications. Corollary. Example. Shuffle operator Mathematical Operational Semantics and Finitary System Behaviour | Oberseminar Erlangen | October 29, 2013

Application 4: Deterministic Automata Mathematical Operational Semantics and Finitary System Behaviour | Oberseminar Erlangen | October 29, join-semilattices with bottom Bipointed DA SOS specifications Remark. Not complete w.r.t. to bipointed specifications. Corollary.

Application 4: Deterministic Automata Mathematical Operational Semantics and Finitary System Behaviour | Oberseminar Erlangen | October 29, Shuffle operator Sequential composition Other examples: regular expression opns incl. Kleene star, … Corollary. (to generalization of Aceto‘s theorem)

Application 5: weighted transition systems Mathematical Operational Semantics and Finitary System Behaviour | Oberseminar Erlangen | October 29, Bipointed WTS SOS specifications Remark. This format is not complete w.r.t. to bipointed specifications. Corollary. Example. Priority operator

Conclusions  Mathematical operational semantics meets finiteness:  bipointed specifications capture Aceto‘s simple GSOS  Generalization of Aceto‘s result that the operational model is regular  rational fixpoint is closed under operations specified by bipointed specifications  Many interesting applications:  labelled transition systems, streams, (non-)deterministic automata, weighted transition systems, deterministic automata on join-semilattices, etc. Future work  More on bipointed specifications in algebraic categories (e.g. complete formats, other categories: locally finite varieties, …)  Rational and context free power series  Local finiteness of operational models and rational fixpoints:  decidability of bisimilarity, algorithms, tool development Mathematical Operational Semantics and Finitary System Behaviour | Oberseminar Erlangen | October 29,