Behavioural equivalences for timed systems

Timed transition systems are behavioural models that include an explicit treatment of time flow and are used to formalise the semantics of several foundational process calculi and automata. Despite their relevance, a general mathematical characterisation of timed transition systems and their behavioural theory is still missing. We introduce the first uniform framework for timed behavioural models that encompasses known behavioural equivalences such as timed bisimulations, timed language equivalences as well as their weak and time-abstract counterparts. All these notions of equivalences are naturally organised by their discriminating power in a spectrum. We prove that this result does not depend on the type of the systems under scrutiny: it holds for any generalisation of timed transition system. We instantiate our framework to timed transition systems and their quantitative extensions such as timed probabilistic systems.

[1]  Marino Miculan,et al.  GSOS for non-deterministic processes with quantitative aspects , 2014, QAPL.

[2]  Marco Peressotti,et al.  A Uniform Framework for Timed Automata , 2016, CONCUR.

[3]  Bartek Klin,et al.  Bialgebras for structural operational semantics: An introduction , 2011, Theor. Comput. Sci..

[4]  Jan J. M. M. Rutten,et al.  Universal coalgebra: a theory of systems , 2000, Theor. Comput. Sci..

[5]  Glynn Winskel,et al.  Distributing probability over non-determinism , 2006, Mathematical Structures in Computer Science.

[6]  Rajeev Alur,et al.  A Theory of Timed Automata , 1994, Theor. Comput. Sci..

[7]  K. I. Rosenthal.  The Theory of Quantaloids , 1996 .

[8]  Alexandra Silva,et al.  Trace semantics via determinization , 2012, J. Comput. Syst. Sci..

[9]  Wang Yi,et al.  Real-Time Behaviour of Asynchronous Agents , 1990, CONCUR.

[10]  Sam Staton.  Relating Coalgebraic Notions of Bisimulation , 2009, CALCO.

[11]  Gordon D. Plotkin,et al.  Towards a mathematical operational semantics , 1997, Proceedings of Twelfth Annual IEEE Symposium on Logic in Computer Science.

[12]  Tomasz Brengos,et al.  Weak bisimulation for coalgebras over order enriched monads , 2013, Log. Methods Comput. Sci..

[13]  Marino Miculan,et al.  Weak bisimulations for labelled transition systems weighted over semirings , 2013, ArXiv.

[14]  J. Golan.  Semirings and their applications , 1999 .

[15]  Robin Milner,et al.  Communication and concurrency , 1989, PHI Series in computer science.

[16]  Vladimiro Sassone,et al.  Structural operational semantics for stochastic and weighted transition systems , 2013, Inf. Comput..

[17]  Matteo Mio,et al.  Łukasiewicz μ-calculus , 2017, Fundam. Informaticae.

[18]  Tomasz Brengos.  Lax functors and coalgebraic weak bisimulation , 2014 .

[19]  D. Vere-Jones.  Markov Chains , 1972, Nature.

[20]  Marino Miculan,et al.  Behavioural equivalences for coalgebras with unobservable moves , 2014, J. Log. Algebraic Methods Program..

[21]  Joseph Sifakis,et al.  An Overview and Synthesis on Timed Process Algebras , 1991, CAV.

[22]  Alexandra Silva,et al.  Algebra-coalgebra duality in brzozowski's minimization algorithm , 2014, ACM Trans. Comput. Log..

[23]  Marta Z. Kwiatkowska,et al.  Automatic verification of real-time systems with discrete probability distributions , 1999, Theor. Comput. Sci..

[24]  John Power,et al.  Coalgebraic semantics for timed processes , 2006, Inf. Comput..

[25]  Steve A. Schneider,et al.  An Operational Semantics for Timed CSP , 1995, Inf. Comput..

[26]  Marino Miculan,et al.  Structural operational semantics for non-deterministic processes with quantitative aspects , 2014, Theor. Comput. Sci..

[27]  Wang Yi,et al.  Time-abstracted Bisimulation: Implicit Specifications and Decidability , 1997, Inf. Comput..

[28]  Bart Jacobs,et al.  Coalgebraic Trace Semantics for Combined Possibilitistic and Probabilistic Systems , 2008, CMCS.

[29]  Alexandra Silva,et al.  A Coalgebraic View of ε-Transitions , 2013, CALCO.

[30]  Marino Miculan,et al.  On the Bisimulation Hierarchy of State-to-Function Transition Systems , 2016, ICTCS.

[31]  Tomasz Brengos.  On Coalgebras with Internal Moves , 2014, CMCS.

[32]  Peter Aczel,et al.  A Final Coalgebra Theorem , 1989, Category Theory and Computer Science.

[33]  Irina Virbitskaite,et al.  A Categorical View of Timed Weak Bisimulation , 2010, TAMC.

[34]  J J M Hooman,et al.  An introduction to compositional methods for concurrency and their application to real-time , 1992 .

[35]  Pawel Sobocinski,et al.  Relational presheaves, change of base and weak simulation , 2015, J. Comput. Syst. Sci..

[36]  Alexandra Silva,et al.  Generalizing determinization from automata to coalgebras , 2013, Log. Methods Comput. Sci..

[37]  Ana Sokolova,et al.  Probabilistic systems coalgebraically: A survey , 2011, Theor. Comput. Sci..

[38]  John Power,et al.  The Category Theoretic Understanding of Universal Algebra: Lawvere Theories and Monads , 2007, Computation, Meaning, and Logic.

[39]  Tomasz Brengos.  A Coalgebraic Take on Regular and omega-Regular Behaviour for Systems with Internal Moves , 2018, CONCUR.

[40]  Barbara König,et al.  Coalgebraic Trace Semantics for Continuous Probabilistic Transition Systems , 2013, Log. Methods Comput. Sci..

[41]  A. Kock.  Strong functors and monoidal monads , 1972 .

[42]  D. Sangiorgi.  Introduction to Bisimulation and Coinduction , 2011 .

[43]  Ana Sokolova,et al.  Generic Trace Semantics via Coinduction , 2007, Log. Methods Comput. Sci..

[44]  S. Lack.  A 2-Categories Companion , 2007, math/0702535.

[45]  Roberto Segala,et al.  Modeling and verification of randomized distributed real-time systems , 1996 .

[46]  Dirk Pattinson,et al.  Coalgebraic Weak Bisimulation from Recursive Equations over Monads , 2014, ICALP.

[47]  Jurriaan Rot,et al.  Coinduction up-to in a fibrational setting , 2014, CSL-LICS.