Zobrazeno 1 - 10
of 133
pro vyhledávání: '"Luttik B."'
Autor:
Bortnik, E., Trčka, N., Wijs, A.J., Luttik, B., van de Mortel-Fronczak, J.M., Baeten, J.C.M., Fokkink, W.J., Rooda, J.E.
Publikováno v:
In Journal of Logic and Algebraic Programming 2005 65(2):51-104
Concurrent Kleene Algebra (CKA) is a mathematical formalism to study programs that exhibit concurrent behaviour. As with previous extensions of Kleene Algebra, characterizing the free model is crucial in order to develop the foundations of the theory
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od______4094::f78cf96888c73d0427cdd8d08ef7f093
https://hdl.handle.net/11585/904894
https://hdl.handle.net/11585/904894
Publikováno v:
Electronic Proceedings in Theoretical Computer Science, Vol 120, Iss Proc. EXPRESS/SOS 2013, Pp 63-77 (2013)
EXPRESS/SOS
Gebler, E D, Goriac, E-I & Mousavi, M 2013, Algebraic Meta-Theory of Processes with Data . in J Borgström & B Luttik (eds), Proc. 20th Workshop on Expressiveness in Concurrency and 10th Workshop on Structural Operational Semantics-EXPRESS/SOS'13 . vol. 120, EPTCS, pp. 63-77 . https://doi.org/10.4204/EPTCS.120.6
Proc. 20th Workshop on Expressiveness in Concurrency and 10th Workshop on Structural Operational Semantics-EXPRESS/SOS'13, 120, 63-77
EXPRESS/SOS
Gebler, E D, Goriac, E-I & Mousavi, M 2013, Algebraic Meta-Theory of Processes with Data . in J Borgström & B Luttik (eds), Proc. 20th Workshop on Expressiveness in Concurrency and 10th Workshop on Structural Operational Semantics-EXPRESS/SOS'13 . vol. 120, EPTCS, pp. 63-77 . https://doi.org/10.4204/EPTCS.120.6
Proc. 20th Workshop on Expressiveness in Concurrency and 10th Workshop on Structural Operational Semantics-EXPRESS/SOS'13, 120, 63-77
There exists a rich literature of rule formats guaranteeing different algebraic properties for formalisms with a Structural Operational Semantics. Moreover, there exist a few approaches for automatically deriving axiomatizations characterizing strong
Conference
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Tree rules in probabilistic transition system specifications with negative and quantitative premises
Publikováno v:
Electronic Proceedings in Theoretical Computer Science, Vol 89, Iss Proc. EXPRESS/SOS 2012, Pp 115-130 (2012)
Lee, M D, Gebler, D & D'Argenio, P R 2012, Tree rules in probabilistic transition system specifications with negative and quantitative premises . in B Luttik & M A Reniers (eds), Proc. 19th Workshop on Expressiveness in Concurrency and 9th Workshop on Structural Operational Semantics-EXPRESS/SOS'12 . EPTCS, pp. 115-130 . https://doi.org/10.4204/EPTCS.89.9
Proc. 19th Workshop on Expressiveness in Concurrency and 9th Workshop on Structural Operational Semantics-EXPRESS/SOS'12, 115-130
STARTPAGE=115;ENDPAGE=130;TITLE=Proc. 19th Workshop on Expressiveness in Concurrency and 9th Workshop on Structural Operational Semantics-EXPRESS/SOS'12
EXPRESS/SOS
Lee, M D, Gebler, D & D'Argenio, P R 2012, Tree rules in probabilistic transition system specifications with negative and quantitative premises . in B Luttik & M A Reniers (eds), Proc. 19th Workshop on Expressiveness in Concurrency and 9th Workshop on Structural Operational Semantics-EXPRESS/SOS'12 . EPTCS, pp. 115-130 . https://doi.org/10.4204/EPTCS.89.9
Proc. 19th Workshop on Expressiveness in Concurrency and 9th Workshop on Structural Operational Semantics-EXPRESS/SOS'12, 115-130
STARTPAGE=115;ENDPAGE=130;TITLE=Proc. 19th Workshop on Expressiveness in Concurrency and 9th Workshop on Structural Operational Semantics-EXPRESS/SOS'12
EXPRESS/SOS
Probabilistic transition system specifications (PTSSs) in the ntmufnu/ntmuxnu format provide structural operational semantics for Segala-type systems that exhibit both probabilistic and nondeterministic behavior and guarantee that isimilarity is a co
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Publikováno v:
Combined 20th International Workshop on Expressiveness in Concurrency and 10th Workshop on Structural Operational Semantics (EXPRESS/SOS 2013, Buenos Aires, Argentina, August 26, 2013), 78-92
STARTPAGE=78;ENDPAGE=92;TITLE=Combined 20th International Workshop on Expressiveness in Concurrency and 10th Workshop on Structural Operational Semantics (EXPRESS/SOS 2013, Buenos Aires, Argentina, August 26, 2013)
Electronic Proceedings in Theoretical Computer Science, Vol 120, Iss Proc. EXPRESS/SOS 2013, Pp 78-92 (2013)
STARTPAGE=78;ENDPAGE=92;TITLE=Combined 20th International Workshop on Expressiveness in Concurrency and 10th Workshop on Structural Operational Semantics (EXPRESS/SOS 2013, Buenos Aires, Argentina, August 26, 2013)
Electronic Proceedings in Theoretical Computer Science, Vol 120, Iss Proc. EXPRESS/SOS 2013, Pp 78-92 (2013)
Modeling a sequence of design steps, or a sequence of parameter settings, yields a sequence of dynamical systems. In many cases, such a sequence is intended to approximate a certain limit case. However, formally defining that limit turns out to be su
Publikováno v:
EXPRESS/SOS
Electronic Proceedings in Theoretical Computer Science, Vol 89, Iss Proc. EXPRESS/SOS 2012, Pp 49-64 (2012)
Proceedings Combined 19th International Workshop Expressiveness in Concurrency and 9th Workshop on Structured Operational Semantics (EXPRESS/SOS 2012, Newcastle upon Tyne, UK, September 3, 2012), 49-64
STARTPAGE=49;ENDPAGE=64;TITLE=Proceedings Combined 19th International Workshop Expressiveness in Concurrency and 9th Workshop on Structured Operational Semantics (EXPRESS/SOS 2012, Newcastle upon Tyne, UK, September 3, 2012)
Electronic Proceedings in Theoretical Computer Science, Vol 89, Iss Proc. EXPRESS/SOS 2012, Pp 49-64 (2012)
Proceedings Combined 19th International Workshop Expressiveness in Concurrency and 9th Workshop on Structured Operational Semantics (EXPRESS/SOS 2012, Newcastle upon Tyne, UK, September 3, 2012), 49-64
STARTPAGE=49;ENDPAGE=64;TITLE=Proceedings Combined 19th International Workshop Expressiveness in Concurrency and 9th Workshop on Structured Operational Semantics (EXPRESS/SOS 2012, Newcastle upon Tyne, UK, September 3, 2012)
We study two notions of expressiveness, which have appeared in abstraction theory for model checking, and find them incomparable in general. In particular, we show that according to the most widely used notion, the class of Kripke Modal Transition Sy
Publikováno v:
Electronic Proceedings in Theoretical Computer Science, Vol 64, Iss Proc. EXPRESS 2011, Pp 74-88 (2011)
Proceedings of the 18th International Workshop on Expressiveness in Concurrency (EXPRESS 2011), 5 september 2011, Aachen, Germany, 74-88
STARTPAGE=74;ENDPAGE=88;TITLE=Proceedings of the 18th International Workshop on Expressiveness in Concurrency (EXPRESS 2011), 5 september 2011, Aachen, Germany
Proceedings of the 18th International Workshop on Expressiveness in Concurrency (EXPRESS 2011), 5 september 2011, Aachen, Germany, 74-88
STARTPAGE=74;ENDPAGE=88;TITLE=Proceedings of the 18th International Workshop on Expressiveness in Concurrency (EXPRESS 2011), 5 september 2011, Aachen, Germany
Linearization is the procedure of rewriting a process term into a linear form, which consist only of basic operators of the process language. This procedure is interesting both from a theoretical and a practical point of view. In particular, a linear
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.